* Describe a balanced binary tree. * When would you want to use a balanced tree rather than a hashmap?
Software Engineer Interview Questions
466,457 software engineer interview questions shared by candidates
What sort would you use if you required tight max time bounds and wanted highly regular performance.
select a random number between 1 & 7
Given a string, find the longest substring which contains 2 unique characters. ""abcbbbbcccbdddadacb" => "bcbbbbcccb"
Implement hash table. Given a mountain of integers :: like 1 2 3 9 6 5 or 4 9 3 give the maximum
Suppose you have an arbitrarily connected graph with n nodes. Come up with an algorithm to identify each set of connected nodes (i.e. identify all the islands in the graph). What's the complexity? Can you find a solution in O(n log n)?
How to implement a queue simply using two stacks and how to implement a highly efficient queue using two stacks.
How would you reverse the image on an n by n matrix where each pixel is represented by a bit?
Given an array of character you must delete all the characters that got repeated 3 or more times consecutively and add '0' in the end of the array for every deleted character Example: "aabbbbcdddee" -> "aacee0000000" "22221" ->"00001 " The problem must be solved in: O(1) memory O(n) time And you can't overwrite a cell in the array more than once.
Why Bloomberg? Tell me about yourself and what you do? Given 11000111, output how far each 0 is from the current index. So output should be 21000123
Viewing 441 - 450 interview questions
See Interview Questions for Similar Jobs
Game ProgrammerMobile EngineerOperations EngineerMobile Developer.net DeveloperFirmware EngineerPrincipal EngineerAtg DeveloperC DeveloperSoftware DeveloperDevops EngineerJr Security AnalystPython DeveloperQa EngineerData EngineerLead EngineerSenior DeveloperTechnical Program ManagerApplication Developer