Find top k largest numbers in array in O(n) time
Software Development Interview Questions
37,298 software development interview questions shared by candidates
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.
62-63=1; Changing only one element (either digit or operand), make this statement true.
you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door.
Create a Priority Queue with all methods.
given an unsigned char array, find if there is a subarray whose elements sum up to a given value
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 the next node in a binary tree from any node (implying successor to a node)
How to come out of a maze given that you can move one step at a time and you cannot turn left.
Viewing 471 - 480 interview questions
See Interview Questions for Similar Jobs
Python DeveloperSystems DeveloperC DeveloperJava DeveloperSoftware EngineerSoftware Qa EngineerDevops EngineerTechnical Program ManagerHadoop DeveloperSenior DeveloperSoftware ProgrammerAtg DeveloperSoftware Test EngineerComputer ScientistMobile EngineerIt DeveloperMobile DeveloperApplications Support EngineerSoftware Applications Engineer