1. Two City Scheduling 2. All paths from source to target 3. Matrix grid problem. Some cells have 1's and the rest have zeros. Every day all cells adjacent to the 1 cells turn into ones. Write a function to return number of days it takes for the whole grid to turn to 1's
LinkedList DFS, BST problems.
Round1: Given a matrix filled with different integers and an entry point, count the number of connected points(adjacent up, down, left, right) with the same value as the entry point. Round 2: Box stacking problem without rotating sides. Do it using DP. Find all paths from a source to destination in a graph.
lots of people in a running competition and there are lots of check points, build and maintain a real time top ten list.
Leetcode medium, top company tagged question
Medium Leetcode, Bloomberg frequently used questions
One of the leetcode problems if you filter by company.
1. Given a list of non-unique integers and a target value, return the count of how many pairs of integers sum to the target value 2. Write a square root function (without using a built-in or library square root function) 3. Given a sorted linked list, remove all duplicate nodes 4. Implement a class that uses entry/exit swipe information (card, swipe, station) to answer queries of average transit time between pairs of stations. (design and implement api)
Asked medium level leetcode questions.
the longest path in binary tree and Merge Scheduling Problem
Viewing 4521 - 4530 interview questions