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
Design a system that does X.
Why do you want to work at this company?
Convert aaabbbcccc -> 4a3b4c
Find the smallest 3 integers in an array in O(n) time.
First is a substring question and then there are 2 other problems that build on that
How would you add more functionality to the strategy board game you built? (forgot what exactly the functionality was)
Viewing 211 - 220 interview questions