332+ Authentic MNC Memory Papers& PYQs

Actual previous year exam questions, pseudo-code bitmasks, DSA test cases, and solved memory banks for TCS NQT, Infosys, Accenture & Cognizant.

332+ SolvedMemory Papers
8 Top MNCsCampus Recruiters
100% VerifiedStep-by-Step Logic
2023–2026Exam Batches
Pooja SharmaAditya DeshmukhAnanya Nair
+25k
25,000+ Freshers Practiced these memory questions before written tests
Company:
Verified Memory Questions332 Total
Practice in Live Simulator
TCS NQT logo
TCS NQT2026 Exam • Coding Round
Coding DSAEasy Repeat Rate 85%+

IOCL Recruitment 2026 — Two Sum Target Pair Index (Optimal O(N) Hash Map)

[TCS NQT 2026 Campus Memory Question #1] Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target` in O(N) time.
Coding DSA Solution
vector<int> twoSum(vector<int>& nums, int target) {
  unordered_map<int, int> mp;
  for(int i=0; i<nums.size(); i++) {
    int comp = target - nums[i];
    if(mp.count(comp)) return {mp[comp], i};
    mp[nums[i]] = i;
  }
  return {};
}
AO(N) Time, O(N) Space
BO(N^2) Time, O(1) Space
CO(N log N) Time, O(1) Space
DO(2^N) Recursion
Run In Live Simulator
Infosys logo
Infosys2025 Exam • Written Test
Pseudo CodeMedium Repeat Rate 85%+

RRB New Recruitment 2026 — Bitwise Left-Shift & Bitmask Evaluation

[Infosys 2025 Campus Memory Question #2] What is the output of the following Pseudo Code? Integer a = 5, b = 2 Integer c = (a << b) ^ (a >> 1) Print c
Pseudo Code Solution
int a = 5, b = 2;
int c = (a << 2) ^ (a >> 1);
printf("%d", c);
A22
B18
C20
D24
Run In Live Simulator
Accenture logo
Accenture2024 Exam • Written Test
Numerical AbilityHard Repeat Rate 85%+

L&T New Hiring Drive — Pipe and Cistern Filling Time Ratio

[Accenture 2024 Campus Memory Question #3] Pipe A can fill a tank in 6 hours, and Pipe B can empty it in 8 hours. If both pipes are opened simultaneously, in how many hours will the tank be completely filled?
A24 hours
B18 hours
C12 hours
D30 hours
Run In Live Simulator
Cognizant logo
Cognizant2026 Exam • Written Test
Automata FixEasy Repeat Rate 85%+

Deleitte Off Campus Big Hiring — String Palindrome Pointer Traversal Bug

[Cognizant 2026 Campus Memory Question #4] The following function fails when checking palindromes for odd-length strings. Identify the fix required.
Automata Fix Solution
bool isPalindrome(string s) {
  int left = 0, right = s.length() - 1;
  while(left < right) {
    if(s[left++] != s[right--]) return false;
  }
  return true;
}
AThe code is already correct and optimal: O(N) Time, O(1) Space
BChange `while(left < right)` to `while(left <= right)`
CIncrement `left += 2`
DUse `s.substr()` recursion
Run In Live Simulator
Zoho logo
Zoho2025 Exam • Written Test
ReasoningMedium Repeat Rate 85%+

ISRO New Recruitment 2026 — Circular Seating Arrangement Direction Inference

[Zoho 2025 Campus Memory Question #5] Six people A, B, C, D, E, and F are sitting in a circle facing the center. B is between A and C. E is between D and F. D is to the immediate left of A. Who is sitting opposite to B?
AE
BD
CF
DA
Run In Live Simulator
Wipro logo
Wipro2024 Exam • Coding Round
Coding DSAHard Repeat Rate 85%+

Google New Drive — Two Sum Target Pair Index (Optimal O(N) Hash Map)

[Wipro 2024 Campus Memory Question #6] Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target` in O(N) time.
Coding DSA Solution
vector<int> twoSum(vector<int>& nums, int target) {
  unordered_map<int, int> mp;
  for(int i=0; i<nums.size(); i++) {
    int comp = target - nums[i];
    if(mp.count(comp)) return {mp[comp], i};
    mp[nums[i]] = i;
  }
  return {};
}
AO(N) Time, O(N) Space
BO(N^2) Time, O(1) Space
CO(N log N) Time, O(1) Space
DO(2^N) Recursion
Run In Live Simulator
Capgemini logo
Capgemini2026 Exam • Written Test
Pseudo CodeEasy Repeat Rate 85%+

American Express New Hiring — Bitwise Left-Shift & Bitmask Evaluation

[Capgemini 2026 Campus Memory Question #7] What is the output of the following Pseudo Code? Integer a = 5, b = 2 Integer c = (a << b) ^ (a >> 1) Print c
Pseudo Code Solution
int a = 5, b = 2;
int c = (a << 2) ^ (a >> 1);
printf("%d", c);
A22
B18
C20
D24
Run In Live Simulator
Deloitte logo
Deloitte2025 Exam • Written Test
Numerical AbilityMedium Repeat Rate 85%+

Swiggy New Hiring Drive — Pipe and Cistern Filling Time Ratio

[Deloitte 2025 Campus Memory Question #8] Pipe A can fill a tank in 6 hours, and Pipe B can empty it in 8 hours. If both pipes are opened simultaneously, in how many hours will the tank be completely filled?
A24 hours
B18 hours
C12 hours
D30 hours
Run In Live Simulator
Showing 18 of 332 questions
...
STAY UPDATED ON CAMPUS DRIVES

Sign Up to Receive Our Latest
Updates