Design a Twitter, design a TinyURL, and one LeetCode medium, one LeetCode hard
New Grad Engineer Interview Questions
3,249 new grad engineer interview questions shared by candidates
Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such that: Only one letter can be changed at a time Each transformed word must exist in the word list. Note that beginWord is not a transformed word. Note: Return an empty list if there is no such transformation sequence. All words have the same length. All words contain only lowercase alphabetic characters. You may assume no duplicates in the word list. You may assume beginWord and endWord are non-empty and are not the same. Example 1: Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"] Output: [ ["hit","hot","dot","dog","cog"], ["hit","hot","lot","log","cog"] ] Example 2: Input: beginWord = "hit" endWord = "cog" wordList = ["hot","dot","dog","lot","log"] Output: [] Explanation: The endWord "cog" is not in wordList, therefore no possible transformation.
On-site: design a bank system
minimum num of a rotated sorted array
ArrayLists, HashMap, Iterator
Tell me about a time when you sell an idea to a supervisor or teacher.
What do you Like about your coop job?
Describe a situation where you used creativity to solve a problem.
"describe the operation of a distillation column"
Recursion involving tracing a graph and find how far a point is from the origin. Something similar to Koch snowflake
Viewing 2771 - 2780 interview questions