Moloco
Ad-ML loops where algorithms meet real-time serving — coding rounds plus design questions about bidding and model latency.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: two algorithm rounds
- 4Design round on real-time ML serving
- 5Behavioral round
Questions
Callback's practice questions and the LeetCode questions Moloco has been asking, filtered together.
Asked on LeetCode
15 questions · all time
- Design a Stack With Increment OperationmediumArrayStackDesignfrequency 100.0
- LRU CachemediumHash TableLinked ListDesignDoubly-Linked Listfrequency 100.0
- Longest String ChainmediumArrayHash TableTwo PointersString+2frequency 100.0
- Number of IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 100.0
- Check if a Parentheses String Can Be ValidmediumStringStackGreedyBracket Sequencesfrequency 80.4
- Course Schedule IImediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sortfrequency 80.4
- Decode StringmediumStringStackRecursionfrequency 80.4
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to LimitmediumArrayQueueSliding WindowHeap (Priority Queue)+2frequency 80.4
- Making A Large IslandhardArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 80.4
- Merge k Sorted ListshardLinked ListDivide and ConquerHeap (Priority Queue)Merge Sort+1frequency 80.4
- Minimum Window SubstringhardHash TableStringSliding Windowfrequency 80.4
- Number of Islands IIhardArrayHash TableUnion-Findfrequency 80.4
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 80.4
- Single Element in a Sorted ArraymediumArrayBinary Searchfrequency 80.4
- Trapping Rain WaterhardArrayTwo PointersDynamic ProgrammingStack+1frequency 80.4