OA

Three questions

a. Find distance between two strings (delete, replace, insert) for Q queries and return minDis String from S strings.

b. Find LuckyNumbers from [l,r]. 1<= l,r <= 10^18 lucky numbers x are integers, which are divisible by floor(sqRoot(x)).

c. Synchronised ticket booking system where total N seats are available.
you return for Q queries first seat available, if not available -1; First available seat is assigned (assuming enough seats are there).

Verdict : Cleared all test cases

Round 1 - DSA

2 LC easy question (don't remember).

Verdict : Positive

Round 2 - LLD
Design Redbus LLD -> expectation was functional requirements and entities, classes, interfaces (no code, just listing out) and showing user journey flow while booking.
Asked question about one SQL query which required join between 2 tables

Verdict : Positive

Round 3 - HLD

Design Google Drive - Functional Req, Non functional Req, Database tables and choice, Architecture and components were discussed

Verdict : Positive

Round 4 - Hiring Manager

Most challenging project, tradeoffs in decisions, production issue, mentoring, etc - mostly typical hiring manager questions.

Verdict : Negative - unprepared

Overall verdict : Rejected