HARDSystem Design
AI Prep
Design in-memory DB with TTL and history
OpenFree Preview
ZipHQ Interview Questions
7
MEDIUMCoding & Algorithms
AI Prep
Maximize non-adjacent sum on an N-ary tree
OpenFree Preview
MEDIUMCoding & Algorithms
AI Prep
Find flush and straight groups in cards
OpenFree Preview
MEDIUMCoding & Algorithms
AI Prep
Find root IDs and paths
OpenFree Preview
MEDIUMCoding & Algorithms
AI Prep
Compute maximum sum in a tree without adjacency
OpenFree Preview
MEDIUMSoftware Engineering Fundamentals
AI Prep
Implement a Vending Machine
OpenFree Preview
MEDIUMSoftware Engineering Fundamentals
AI Prep
Find Bugs in an LRU Cache
OpenFree Preview