Criteo
10 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 349. Intersection of Two Arrays | Easy | 100% | TopicsArrayHash TableTwo PointersBinary SearchSorting |
| 350. Intersection of Two Arrays II | Easy | 84.7% | TopicsArrayHash TableTwo PointersBinary SearchSorting |
| 733. Flood Fill | Easy | 78.3% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| 383. Ransom Note | Easy | 78.3% | TopicsHash TableStringCounting |
| 1. Two Sum | Easy | 78.3% | TopicsArrayHash Table |
| 33. Search in Rotated Sorted Array | Medium | 78.3% | TopicsArrayBinary Search |
| Random Pick with Weight | Medium | 78.3% | TopicsArrayMathBinary SearchPrefix SumRandomized |
| 53. Maximum Subarray | Medium | 69.3% | TopicsArrayDivide and ConquerDynamic Programming |
| 20. Valid Parentheses | Easy | 69.3% | TopicsStringStackBracket Sequences |
| 645. Set Mismatch | Easy | 69.3% | TopicsArrayHash TableBit ManipulationSorting |
