Given an unsorted array of integers, sort them in such a way that all negatives come first, followed by zeroes, followed by all positives. 5,-6,8,0,4,-10,11 could become -6,-10,0,8,4,11 (does not have to be sorted into increasing order) What is the run time of this? Can we reduce the run time, if so, how (implement the new way)? Doing black box testing, how can we determine the run time? How can we determine if we have a memory leak?
given two sorted linked list, merge them into one linked list.
Reverse a link list. Try to do it recursively as well.
How do you simulate the functionality of a queue using 2 stacks
How would you reverse a string?
Given a regular phone number dial pad, write code that will list out all the possible letter combinations that can be made given three numerical digits as input. For example, the base function would look like this: function numberToChars(int *numbers) { // would return an array of different character combinations // if input was 123 // output: adg, adh, adi, bdg, etc... }
Given a array of integers, write code to find the max possible sum of sub-arrays. Use arithmetic progression.
Second interview more technical questions
Codifica una funcion que invierta un string de varias palabras conservando el orden de las palabras
reverse a string in place
Viewing 521 - 530 interview questions