[ INFO ]category: Behavioral · Onsite difficulty: medium freq: first seen: 2024-04-03
[MEDIUM][ONSITE]OnsiteSDE IIRejected
$catproblem.md
Microsoft | SDE2 | March | Rejected
Years of Experience: 2.8
Position: SDE 2
Date: March
Round 1 (DSA | 1 hour):
Find the substring in the string with cyclic order.
Example 1:
Input: string s1 : abcdef
string s2 to find : cdefa
Output : True
Explanation : after doing 2 right rotations in string s1, we can find the string s2.
Find all the overlapping squares where the top-left and bottom-right points are given in an array. We have to find how many squares overlap each other.
Round 2 (LLD | 1 hour):
Design an LRU cache using appropriate data structures. Implemented using a LinkedList and a Map.
Round 3 (HLD | 1 hour):
Discussion of my project experience.
Discussion of a novel problem I had solved that was not readily available online. My answer was not satisfactory.
Questions about semaphores; I was unable to implement one at that time.
Implementation of a class using pre-implemented functions, according to a specified order. Successfully implemented the classes.