Given a string A and B, find the smallest substring of A that contains all the characters from B. (implement solution in O(n), keep in mind chars in B can repeat)
Softwareentwickler Backend Interview Questions
512,832 softwareentwickler backend interview questions shared by candidates
Implement data structure "Map" storing pairs of integers (key, value) and define following member functions in O(1) runtime: void insert(key, value), void delete(key), int get(key), int getRandomKey().
The wiggle problem, given an array of integers arrange them such that alternate elements are large and small.(2,5,3,6,...)
Find and return the first duplicate integer in an array in O(n) time and O(1) space. Assume there will always be at least one duplicated integer in the array.
efficiently search for an input word in an unbounded dictionary.
Was ist bei Kalkulationen von Floating Points zu beachten? Gibt es zum Beispiel Probleme mit der Aussage 1.0f + e-30.
What kind of data structure would you use to index annagrams of words? e.g. if there exists the word "top" in the database, the query for "pot" should list that...
You are given a random binary tree 5 / \ 4 9 / \ / \ 3 5 6 8 Write code to print it out in order level ie 5 4 9 3 5 6 8 The tree need not be balanced. Write all the datastructures for the tree and make sure that you print newlines after each level. Also write test cases to test your code.
How would you store 1 million phone numbers?
Prüfen, ob zwei Blätter eines Graphen verbunden sind oder nicht, wie Algorithmus verbessern
Viewing 1441 - 1450 interview questions