Title Template
[CapitalOne] - [ Sr. Software Engineer, Front End / Full-Stack (JavaScript ES6+, Angular, NgRX, AWS Fargate)] - [Senior]
Description Template:
Level: [Senior]
Education: [Master]
Years of Experience: [3+, 5 preferred]
Questions Asked: [
1- you have an array of tasks, visit sectionA, Add bookA, add BookB, visit sectionB, Add bookA, add bookA,…] you need to maintain last section visitied, and add books accordingly into each section, make sure to not have duplicate, I solved it with hashmap of keys are the sections, and values are the hashset of books
2- remove vowels from a string, lowe and capital case and reverse the string
3- 2 dimension table you need to make Y protein shape, or check how much minimum swap need to do to get the Y shape, was very difficult didn’t spend time on it
4- you have array of prices, and array of sell and buy representing by 0 and 1, and fixed window size k, i don’t quiet remember the question but it looks similar to grumpy bookstrore leetcode question, while you need to get the max benefits or something like that
]
IMPORTANT: Remember to specify the company name & role in the tags
Example:
Title:
Google - Software Engineer (Frontend) - Phone Screen
Description:
Education: Masters
Years of Experience (YOE): 7
Questions Asked:
Two Sum Problem:
Example 1:
2.Input: nums = [2,7,11,15], target = 9*
3.Output: [0,1]*
4.Explanation: nums[0] + nums[1] == 9, thus the output is [0, 1].*
Example 2:
5.Input: nums = [3,2,4], target = 6*
6.Output: [1,2]*