Company: Freshwork
Role : SSE
Exp: 6+ Years
First round(DSA):
Unsorted array with negative, positive and zero,
Give 2 numbers that sum close to zero
i.e. [-3-2,1,01,2] o/p: -2,2

Short listed for next round:
Second round(DSA + LLD):
longest substring that have distinct character
Sql queries
Whats app database design, code implementation
Microservices questions

Short listed for 3rd round
Third Round(DSA + HLD)
isvalid BST? and if not then return nodes
Figur out what number is which number's cube? without math function/libraries

i.e. 125->5
8 -> 2

Reject on 3rd round as not well prepared. I have just started DSA practices, but ya it's good experience