loads of Java Java EE questions and 2 hour discussion on the projects and detailed discussion on design and development of parking lot management system.
Senior Member Technical Staff Interview Questions
623 senior member technical staff interview questions shared by candidates
Basic java questions. Some design questions. Reason for change.
1)About project 2)Detemine loop in linked list. ans:pointer method and using maps along with time complexity. how map.insert() work? time complexity of this. Spent lots of time discussing time complexity for different scenarios. 3)which data structure can be used to implement notepad, time complexity, space complexity for basic operation like update, delete etc 4)which data structure can be used to implement telephone directory, again time complexity, space complexity for basic operation 5)different segment of C program: data, code, stack , heap 6)where will the local variables be stored, from where malloc will get memory 7) there are N prisoner standing in line, police officer will shoot every K'th person in circular manner. K < N. I have to stand in a place such that I should be the last person to die. Example : 3 prisoner. K is 2. He will shoot 2 person. Then he will start the count from 3 rd person, circle back and shoot 1 st person. Every second person will be shot. Ans for this is , I should stand in 3 rd place. 8)Some algo was given were file allocation is done and some common space will be allocated for the file. For crash situation algo was not working fine. I had fix the algo. 9)what does it mean when we say hardware is 64 bit. And what does it mean when we say OS is 64 bit. What is difference. Second round ============ 1)Lots of questions on my project. Since I am a database internal developer, lots of questions on DB server architecture and this guy screwed me left and right. 2)There are many points in 2 dimensional graph. Each Point P(i) is represented using x(i) and y(i). Out of many points find two points such that distance between then is minimum. I solved it with time complexity n square. But he wanted to optimize it. 3)Given an array find number of inversions in it. for any i and j where i<j and A[i]>A[j] then it is one inversion. solved it with n square then solved again with nlogn (quick sort). 4)Given a balanced binary tree. Find two nodes whose heights are same and has different parents. had to write the code for this. Manger round ========== General project discussion and compensation discussion.
LLD - Movie theatre HLD - Notification System
More technical questions related to the experience
All Questions related to data structures, trees, graphs, etc
Why are you leaving your current company so soon
Most difficult one was on the Database where I was given a scenario and asked to optimize the performance.
what is the angle between hour hand and minute hand when the time is 3:15?
Generic web application hosting and Linux environment Question about which layer to store business logic Why Oracle?
Viewing 411 - 420 interview questions