### Cohesity\n\n1st round (DSA)\n-> substring without any repeating character\n-> Burn tree\n\n2nd round(HLD)\n-> You\'re given an server (512 MB ram & an SSD) & a highly scalable DB. That SSD contains immutable map\nWhen a request comes to server, following things will happen\n1st : Server will call the DB (return value : x)\n2nd: With the value fetched (x) from DB it will retrieve a value from SSD (let y)\n3rd : calculate SHA of (y) and return the result\n\nNow what problem can occur when you increase the no. of request calls to server. Like what all bottlenecks we can face and what are the ways to improve this system (increasing no of servers, what to do with SSD, calls, as you\'re not allowed to replicate SSD)\nAlso, he wants to go step by step, like what will be the first bottleneck (SSD, DB or SHA computing), then second bottleneck etc.\n\nCan anyone tell the real answer in comments\n\n\nVerdict : Rejected (Problem was very open ended, I did what I could & I think it was good, still not sure why got rejected, maybe something still out of my scope)\n\n\n### Angel One\n1st Round (DSA)\n-> https://leetcode.com/problems/time-needed-to-buy-tickets\n-> https://leetcode.com/problems/remove-k-digits/description\n\nVerdict : Rejected (Was not able to solve both question within given time)\n

Cohesity\n\n1st round (DSA)\n-> substring without any repeating character\n-> Burn tree\n\n2nd round(HLD)\n-> You\'re given an server (512 MB ram & an SSD) & a 