Status: 2.10 YOE
Position: SDE 2
Location: Bangalore
Round 1: DSA
- Question 1: Probability of hitting
kheads using Dynamic Programming. (Standard DP probability math). - Question 2: Variation of Longest Substring Without Repeating Characters using the Sliding Window technique: https://leetcode.com/problems/longest-substring-without-repeating-characters/
- Result: Hire.
Round 2: LLD (Low-Level Design)
- Question: Design an Uber-like platform with multiple specific constraints and conditions.
Verdict: Rejected. I was able to come up with a design after discussion, but when translating it to code, I had some syntax errors. Time ran out before I could successfully run and compile the final code.
Comments (2)