1. Find a path from source word to target word with certain intermediate words in a dictionary. It's like the one other people here shared. But one thing is that you only have a function to check if a certain word is in the dictionary or not. (no other way to access the dictionary). 2. Find the best path from upper left corner to bottom right corner in a grid by moving right or down. The "best" path is the one with highest alphabetical order after sorted.
In technical round, an interviewer asks a very basic questions. What is PSVM? How it work. Real tine example of method overloading & overriding. Abstraction & Encapsulation. Questions are asked on OOPs concept mostly.
OOD
Concepts of OOP
stack,reference variable,fibonacci series ,2nd largest element in an array
c++ questions
How many different bouquets of three flowers can you make with three different flowers available.
Given an Listof HashMaps and a key, find the hashmap corresponding to minnimum value associated to that key.
What is Smoke and Sanity Testing
Sql, Indexing, complex join queries, few theory questions...
Viewing 2901 - 2910 interview questions