Imagine you are an Uber driver who begins in the middle spot of an n by n matrix. Write a code that allows you to pick up the most riders in your immediate vicinity (e.g. spots directly adjacent to your location) until all surrounding spots are 0. You can only move up, right, left or down. Example: [0, 5, 3], [2, 6, 9], [0, 1, 0]
A frog is trying to get from its lotus pad to the the last lotus pad. Each lotus pad has a number and that is how far the frog can jump from it. Integers on these pads are greater than or equal to 0. Calculate the minimum number of jumps it takes for a frog to reach the end. You are given a vector of integers that represent the lily pads.
Implement a deque using three stacks
Talk about a project that you are proud of
Linked List and string manipulation
Why do you want to work at this company?
Design a system that does X.
Find the smallest 3 integers in an array in O(n) time.
Check if a String is a palindrome with complexity lesser or equal to O(n) and memory O(1). String could contain special characters and integers.
Convert aaabbbcccc -> 4a3b4c
Viewing 211 - 220 interview questions