Here are some last minute tips before your phone interview. You’ll be coding, real-time. If you don’t have experience of using them – try them out. Coding fluency is …
Given two integers n and k, return all possible combinations of k numbers out of 1 … n. Example: Input: n = 4, k = 2 Output: , , …
Write a function to find the longest common prefix string amongst an array of strings. For example, should return “a”. The common prefix length should not exceed the minimal …
Given a collection of distinct numbers, return all possible permutations. For example, have the following permutations: , , , , , and . Recursive Permutation Algorithm At position 1, …
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: 3 / \ 9 20 / …
Find the least number of perfect square numbers (1, 4, 9, 16, 25 …) which sum to the given integer n. For example, given n = 5, return 2 …