Given a list of words, make a function to setup multiple list inputs and streamline this process. In a separate function, given a user entered word, check the stored lists for this word. If there are any periods "." in the user given word, it acts as a universal character. (ex, b.t = bat, but, bot, ect).
Given a BST and a range, return the sum of all numbers contained in the BST that are also within that range. What is the runtime of your solution?
Longest (strictly) increasing sub array of ints, then update to allow 1 break (non-strictly increasing int) then update to allow k number of breaks + time complexity of each part
Data Structures, Algorithms, Problem solving.
How do you handle team conflict?
Given a string, return total number of repeated words.
What do you know about Akamai?
Should the client and server use the same data language for communication? (e.g. XML, JSON)
About my prior projects. Questions in C++, linked list and, tree based algorithms, Race conditions in OS.
Given an array of n element which contains elements from 0 to n-1, with any of these numbers appearing any number of times. Return via Boolean, whether a duplicate exists in the list. 2nd Level/Bonus: do this in O(1) space complexity. 3rd level: Is there a better solution if you are allowed to modify the existing data array?
Viewing 211 - 220 interview questions