written test
multiple choice on os, sql, oops,
1.maximum no of overlaps at any time interval
2.dynamic programming
3.minimum steps to reach destination in snakes and ladders

Interview round 1:
1.An array in which each element occurs in pairs except one. How can u find it?
2.Check whether a given binary tree is binary search tree or not?
3.How to check whether a given point lies in a triangle or not?
4. Implement a stack using 2 queues.
5. What is paging? Difference b/w paging and segmentation?
6. Different types of memories.(primary,secondary)
7. How will u search in a rotated array in minimum time complexity?
8. Print all the pairs which make sum x in an array of n integers?
9. Print all nodes in a binary tree in zigzag format.

Interview round 2:
1.Dynamic programming( longest increasing sequence)
2.dynamic programming (longest ap sequence)
3. how can generate a different string every time.
4. how can you compare 2 elements without using any relational operator?
5. You need to deliver goods to n different places, you have fuel constraint and a delivery time limit for each of the n places. Design a algo to deliver the goods efficiently. (combination of 2 graph algorithms)
6. LRU cache data structure implementation.
7. some questions on my project.
8.BFS,DFS

Interview round 3:
1.How are some sites blocked in a particular place?
2.If a village has 100 couples(1:1 sex ratio), they have a belief dat girl child is precious, so they keep on giving birth until the have a girl child. what will be the sex ratio in that case?
3.In how many different ways can you find sum of 50 51 52…..150 numbers.
4.Some questions on internship.
5.Types of memories.

Question

written test 
multiple choice on os, sql, oops,
1.maximum no of overlaps at any time interval 
2.dynamic programming 
3.minimum steps to reach destination in snakes and ladders

Interview round 1: 
1.An array in which each element occurs in pairs except one. How can u find it?
2.Check whether a given binary tree is binary search tree or not?
3.How to check whether a given point lies in a triangle or not?
4. Implement a stack using 2 queues.
5. What is paging? Difference b/w paging and segmentation?
6. Different types of memories.(primary,secondary)
7. How will u search in a rotated array in minimum time complexity?
8. Print all the pairs which make sum x in an array of n integers?
9. Print all nodes in a binary tree in zigzag format.


Interview round 2:
1.Dynamic programming( longest increasing sequence)
2.dynamic programming (longest ap sequence)
3. how can generate a different string every time.
4. how can you compare 2 elements without using any relational operator?
5. You need to deliver goods to n different places, you have fuel constraint and a delivery time limit for each of the n places. Design a algo to deliver the goods efficiently. (combination of 2 graph algorithms)
6. LRU cache data structure implementation.
7. some questions on my project.
8.BFS,DFS

Interview round 3:
1.How are some sites blocked in a particular place? 
2.If a village has 100 couples(1:1 sex ratio), they have a belief dat girl child is precious, so they keep on giving birth until the have a girl child. what will be the sex ratio in that case?
3.In how many different ways can you find sum of 50 51 52…..150 numbers.
4.Some questions on internship.
5.Types of memories.

Walmart

Walmart Interview Question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches