Given an array where each entry can be another array, and so forth, flatten the array. [4, [3, 6, [9, 1, 9, [5, 1]]], 8] -> [4, 3, 6, 9, 1, 9, 5, 1, 8]
Programmer Analyst Interview Questions
712,956 programmer analyst interview questions shared by candidates
Return the head node of the singly linked list with each pair of nodes swapped. If there is a last odd node leave it in place. Example: Input: 1 -> 2 -> 3 -> 4 -> 5 Output: 2 -> 1 -> 4 -> 3 -> 5
You are given a list of strings (e.g. ["cat", "dog", "hat", "apple", "c"] ). Write a program that would take as input a string containing a wild card character, like "*at", "**t" (could be "cat", "hat", "bat"), "ca*", etc. and return true if there is a corresponding string in the list, and false otherwise.
You have 8 balls. All are identical except one is slightly heavier. You have a balance. What is the minimum number of weighings required to find the heavier ball?
Describe a function (in C) that does the following Input : an integer. Output: if that integer is 4, the function returns 7. if that integer is 7, the function returns 4. constraints: the input is SURE to be either 4 or 7. no need to validate. you are not allowed to use any condition/flow commands (if, switch, while, for, trinary operator...) you are not allowed to use any external library or import anything (like math..) you are not allowed to use %(modulu), * (multiplication)
reverse bits of an integer that is a power of 2 , keeping complexity in mind.
How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?
Reverse the words in a sentence. For example, "Have a nice day" becomes "day nice a Have"
string compression: aaabbbbcc ->a3b4c2
You have two linked lists that merge at some node. The lists could be billions of nodes long. Find the node where the lists merge in the most optimal time while using a low amount of memory.
Viewing 691 - 700 interview questions