brightlightkim

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...

4.1 Route Between Nodes: Given a directed graph, design an algorithm to find out whether there is a route between two nodes. This problem can be solved by just simple graph traversal, such as depth-first search or breadth-first search. We start with one of the two nodes and, during traversal, check if the other node is found. We should mark any node found in the course of the algorithm as "alrea..

Question: Three in One: Describe how you could use a single array to implement three stacks. My Thought Process: The first one is from the beginning. The middle one The last one is from the end. Problem: Stack will not have an equal size. Answer: Stack 1: [0, n/3] Stack 2: [n/3, 2n/3] Stack 3: [2n/3, n] Implementation: public class ThreeStackInOne { private int numberOfStacks = 3; private int st..

2.1 Write code to remove duplicates from an unsorted linked list. The first algorithm that came to my mind was storing data to Set and see if it shows an error when inserting a value to see if it exists. If it already exists then remove the node. Just checked the last Index. public Node deleteDuplicatedNodes(Node head){ Node n = head; Set set = new HashSet(); set.add(n.data); while(n.next != nul..

36. Valid Sudoku Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: Each row must contain the digits 1-9 without repetition. Each column must contain the digits 1-9 without repetition. Each of the nine 3 x 3 sub-boxes of the grid must contain the digits 1-9 without repetition. Note: A Sudoku board (partially filled) could be v..

Question: You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most water. Return the maximum amount of water a container can store. Notice that you may not slant the container. Example 1: Inp..

1.1. Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures? 1) Brute Force (I made this not to use additional data structure) Calculate each item by iterating the string >> result in O(n^2) boolean isUnique(String[] string){ for (int i = 0; i < string.length; i++){ //Since we compute one for i we don't have to start from i ag..