1. Reverse string except spaces. A string has mix of alphabets and spaces. Your task is to reverse the string, but preserve the positions of spaces. For example, reverse of " a if" is " f ia" 2. An array of size n has all but one numbers between 1 and n+1. Find the missing one.
Given a bag of nuts and a bag of bolts, each having a different size within a bag but exactly one match in the other bag, give a fast algorithm to find all matches.
Didnt ask anything about me or my resume. They sent ma link to write the code. Asked me to write the code for finding the number of words in a string without using split and scanner. Then asked me to improve the code to accommodate corner case i.e if multiple spaces or null string etc. Asked me to write the test cases for the program.
Sort an array of integers with only 1s and 0s. Then sort an array of integers with numbers between 0 and 99.
Implement a reverse hash table
Given the upper left and lower right coordinates of two rectangles, determine if they overlap
Give a 2D rectangular array represented as a 1D arrary in row-major form, rotate the array by 90 degrees
Write the code for the preorder traversal of a tree.
You have a list of sentences/words. How to find out the sub list that consists of a specific prefix? Ex: input: prefix="he", list = ["hello", "world", "hello world", "hey dude", "galaxy"....] output: ["hello", "hello world", "hey dude"]
Viewing 161 - 170 interview questions