elements of programming interviews vs jaa

Given a stream of unsorted integers, find the median element in sorted order at any given time. So, the output for ” CS degree”, “CS degree”, “CS degree “, or ” CS degree ” are all the same: “degree CS”.

Also remove all leading and trailing whitespaces. If there are multiple spaces between words reduce them to a single white space. Consider all consecutive non-whitespace characters as individual words. To clarify, input: “Interviews are awesome!” output: “awesome! are Interviews”. Given an input string, reverse all the words. Generate all permutations of a given string. So, if the array is and k is 3 then the result is 2, because it’s the 3rd element in sorted order (but the 3rd distinct element is 3). Given an array of integers find the kth element in the sorted order (not the kth distinct element). Given an array convert it to in-place using constant extra space Return the transformation chain which has the smallest number of intermediate words. Given a source word, target word and an English dictionary, transform the source word to target by changing/adding/removing 1 character at a time, while all intermediate words being valid English words. Given a binary tree, check whether it’s a binary search tree or not. So, given these 3 strings write a function that detects whether str3 is a valid shuffle of str1 and str2. For example, given str1=”abc” and str2=”def”, str3=”dabecf” is a valid shuffle since it preserves the character ordering of the two strings. Str3 is said to be a shuffle of str1 and str2 if it can be formed by interleaving the characters of str1 and str2 in a way that maintains the left to right ordering of the characters from each string. We are given 3 strings: str1, str2, and str3. Given a linkedlist of integers and an integer value, delete every node of the linkedlist containing that value. Given these two arrays, find which element is missing in the second array.

A second array is formed by shuffling the elements of the first array and deleting a random element.

There is an array of non-negative integers. Given an array of integers (positive and negative) find the largest continuous sum. Our program will be called multiple times with different rectangular regions from the same matrix. Given a matrix of integers and coordinates of a rectangular region within the matrix, find the sum of numbers falling inside the rectangle. Given an integer array, output all pairs that sum up to a specific value k. There are 28 questions in total, and since 28 is a perfect number (as Donald Knuth also mentioned) I decided that’s a good place to stop. The complete list of all my programming interview question articles with pointers to original posts.

Elements of programming interviews vs jaa