brightlightkim

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad. Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be..

Given a positive integer num, write a function which returns True if num is a perfect square else False. Follow up: Do not use any built-in library function such as sqrt. Example 1: Input: num = 16 Output: true Example 2: Input: num = 14 Output: false Constraints: 1

Let's call an array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 arr[i+1] > ... > arr[arr.length - 1] Given an integer array arr that is guaranteed to be a mountain, return any i such that arr[0] arr[i + 1] > ... > arr[arr.length - 1..

We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess. You call a pre-defined API int guess(int num), which returns three possible results: -1: Your guess is higher than the number I picked (i.e. num > pick). 1: Your gue..

class Solution { public int search(int[] nums, int target) { int high = nums.length-1; int middle, low = 0; while (low

Given a binary tree, design an algorithm that creates a linked list of all the nodes at each depth (e.g., if you have a tree with depth D, you'll have D linked lists). void createLevelLinkedList(TreeNode root, ArrayList lists, int level){ if (root == null) return; //base case LinkedList list = null; if (lists.size() == level) { list = new LinkedList(); /** * Levels are always traversed in order...

A Tree is a recursive explanation. A tree is a data structure composed of nodes. Each tree has a root node. (Actually, this isn't strictly necessary in graph theory, but it's usually how we use trees in programming, and especially programming interviews) The root node has zero or more child nodes Each child node has zero or more child nodes, and so on. The tree cannot contain cycles. The nodes m..