Heap Sorting. What data structure do you use to implement it? Time to access and sort. Code it.
Software Development Interview Questions
36,975 software development interview questions shared by candidates
Is it possible to sort using linear time a file with lots of numbers that contain duplicates, when there are no limits of resources or space?
About the details, and interviewer will communicate with you when you are typing.
Find top k largest numbers in array in O(n) time
To find least common ancestor in a binary search tree
Q: Implement one part of a three-part problem - have a general idea of important algorithms and know how to use data structures! Work efficiently and start off getting something brute force and simple working, and then optimize later.
Given a balance and marbles where one marble weighs more than the other, how many times do you have to use the balance to find the heaviest marble for 7 marbles. Then, extend that answer to how many marbles can you weigh with 4 tries.
Remove all characters of a string from another string. The algorithm should be less than O(m*n) where m & n are lengths of strings and the space used should be less than O(m+n).
Find two smallest elements in an unsorted array using only one pass i.e. O(n)
Whiteboard programming: given a tile and a word, write a routine to determine if the word is valid. Wild card "*" might be present in tile and can be used for once when there is no match. For example, "bed" is valid given tile "abcdefg". "bread" is valid given tile "abcdefg*".
Viewing 471 - 480 interview questions
See Interview Questions for Similar Jobs
C DeveloperPython DeveloperJava DeveloperSystems DeveloperSoftware ProgrammerSoftware Test EngineerAtg DeveloperComputer ScientistMobile EngineerMobile DeveloperApplications Support EngineerSoftware Applications EngineerSoftware EngineerSoftware Qa EngineerDevops EngineerHadoop DeveloperIt DeveloperTechnical Program ManagerSenior Developer