2d matrix of sorted boolean array
Software Development Engineer Intern Interview Questions
2,288 software development engineer intern interview questions shared by candidates
Leetcode medium one-dimensional dynamic programming question.
Describe a challenging experience you had and what you did to overcome it
To answer the technical question given.
OA1 questions can be found online. It's random. Final round interview questions can be varied and found online (Leetcode premium, etc.) however I did not get one found on the list and it stumped me. I had to implement a Sandbox class for a hypothetical AWS Lambda team, coding the constructor, add, and put functions based on various criteria. The question was most similar to implement LRU cache.
LeetCode Medium: Random Pick with Weight
1.Code Question 1 Amazon Shopping provides a product search feature that makes browsing products easier. Instead of showing exact matches only, it also displays transformable results for better browsing. A word a is said to be transformable to a word b if a is a subsequence of b. Given searchWord and resultWord, find the minimum number of characters that must be appended at the end og the searchWord, such that resultWord is a subsequence of the modified searchWord. Note: A subsequence of a string is a string that results from deleting 0 or more characters from the string without changing the order of the remaining characters. For example, Amazon is a subsequence of abcmmdaqzxopn while abc is not a subsequence of cdhbqaab.
Write an algorithm to check if a string has balanced parentheses. What about if brackets [] or braces {} could be used as well and those also had to be balanced?
Classic Leetcode easy and medium questions
How can you optimize your solution?
Viewing 1761 - 1770 interview questions