Find how many strings in a map are anagram of a given string.

Traverse all the nodes from a distance d from the current node. The nodes can be in
any direction i.e. upwards or downwards.

find missing element in a list

given a string check if it is possible to rearrange the letters to form a

palindrome.

A few questions on DBMS were also asked.

Find the second-largest sum of two elements in a list.

2. which data structure can be used to represent the words of English Dictionary
and how?
3. Difference between tree and graph

FIRST TECHNICAL INTERVIEW

1. Introduce yourself. Tell us something that is not in your resume.
2. Coding Qs given in round 1:
a) Given a list, convert the list to a form such that there are no duplicate
elements, and the sum of the list is the least. (Was asked to solve with efficiency
O(n))
E.g.: l= [1,2,3,4,5,5,5]
Output: [1,2,3,4,5,6,7]
3. Find the missing element in two lists.
E.g.: L1= [1,2,3,4,5]
L2= [1,2,4,5]
Missing number is 3
Find the solution in O(n)
4. A matrix problem was given.
5. Difference between final, finally and finalize.

final is a keyword used in Java to restrict the modification of a variable, method,

or class. finally is a block used in Java to ensure that a section of code is
always executed, even if an exception is thrown. finalize is a method in Java used
to perform cleanup processing on an object before it is garbage collected.

6. What are generators and iterators in python?

7. Difference between python 2.x and python 3.x.
8. What is indexing in DBMS?
9. Was asked to analyze 4 commands wrt indexing in DBMS.
10. Was given three SQL questions concerning group by, join and order by.
SECOND TECHNICAL INTERVIEW
1. What do you know about the company?
2. Was explained the future projects of the company.
3. State the data structure and its real-life examples
4. Disadvantage of stack
5. You are in a passport office; tokens are given to the candidates and random
counters are assigned to them. What data structure/structures will you use to
implement this scenario efficiently.
6. Find the second largest sum of a list. Solve with one loop and efficiency O(n).
7. Code to design a snake and ladders game with OOPs concepts. Number of boards to
be created can vary. Had to mention methods, constructors, parameters, objects,
classes.

They asked me the basics of database, ACID properties, abstraction and interface,
deadlock and indexing. They also asked me to code some simple string problems
There are 'n' chocolates and for every 3 wrappers you return you get another
chocolate. How many chocolates can you get with 'n' chocolates?