Programming question - Given an array of number from 1...N (No duplicates)out of which one number is missing. Find the missing number in O(N).
Software Development Interview Questions
37,013 software development interview questions shared by candidates
There were 3 rounds of interview. In first round, there were 2 questions and i had to explain and code both. First question was based on merging intervals and in other question a binary tree was given and I had to find the size of a subtree in which all the nodes have value 0. in round 2, again there were three questions and the interviewer said "I want to have a good discussion, if your are unable to give correct answer its okay, but correct answer will matter." first question was same as "house robber 3" on leetcode, except it was n-ary tree. In second question, I was given a binary tree and i had to remove and edge from the tree such that resulting two tree's heights difference is maximum. I had to return the difference of heights. In round 3 i was asked a few questions about my life and journey along with some designing questions based on OOPS
They asked me to open the camera I rejected that unless the interviewers open their cameras too.
About VMs. Dont remember all of them . About VMs. Dont remember all of them .About VMs. Dont remember all of them .About VMs. Dont remember all of them .About VMs. Dont remember all of them .
The most unexpected question was being asked how to conduct a testing suite efficiently using x number of machines. However, this turned out to be a disguise for a bin packing problem.
Implement a stack.
Write 4 locker functions: acquire_read_lock, acquire_write_lock, release_read_lock, release_write_lock. Use Windows specific helper functions. 1 more brain teasing puzzle.
Print a matrix in spiral fashion...so Matrix input example (Arrows indicate how the spiral happens...start at first arrow go in circle and move to next arrow...etc.) ->1 1 1 1 1 1 -> 2 2 2 1 1 2 2 2 1 1 1 1 1 1 Output: 11111111111111222222
a) Develop a XML parser (rules: Node closures and single root node..i.e. root node cannot be duplicated in structure). b) Count occurrences of words in a string (with string too large to be processed in memory).
reverse words in a string
Viewing 2261 - 2270 interview questions
See Interview Questions for Similar Jobs
Systems DeveloperJava DeveloperC DeveloperPython DeveloperHadoop DeveloperDevops EngineerSoftware EngineerTechnical Program ManagerMobile DeveloperAtg DeveloperSoftware Applications EngineerSoftware ProgrammerSoftware Test EngineerMobile EngineerIt DeveloperApplications Support EngineerComputer ScientistSenior DeveloperSoftware Qa Engineer