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
What are your development areas? Why would you want to work for us?
Data Structures, Algorithms, Problem solving.
How do you handle team conflict?
Given a string, return total number of repeated words.
Should the client and server use the same data language for communication? (e.g. XML, JSON)
difference between malloc and calloc OOPS concepts
About my prior projects. Questions in C++, linked list and, tree based algorithms, Race conditions in OS.
Viewing 211 - 220 interview questions