There's an array and a hash function. There are many incoming elements to be inserted into the array, and the index for each one is the hash key obtained from the hash function. There are four methods for this structure: insert, delete, find, printAll. (1) printAll should print all the elements in the array in the order they were inserted. How to implement this? (2) (After I have answered the first question) How to implement delete if your approach for (1) is used?
1. Sum of Fibonacci series
Questions were easy from OO concept of Java like Data Structure like linked list, arrays, hashmaps. Questions about experience in job and experience on projects in university and job. Talk in detail about the project relevant to the position you are applying for. Listen to the questions well and take time to reply the questions.
Questions on sorting and data structures in general.
Would I be willing to relocate to SF and give up 10% of my current pay.
What was my role in the team project?
how would you handle multiple assignments given to you at once?
questions related to SQL DBMS were asked.some questions related to project as well.
Joins in Mysql?
Background questions.. previous experience and used tools
Viewing 871 - 880 interview questions