Explore PhonePe questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.
Problems in range
92
Solved
0 / 92
Range progress
0%
Select a problem to open it on LeetCode.
| Solved | Problem | Difficulty | Frequency | Acceptance | Open problem |
|---|---|---|---|---|---|
Medium | 100.0% | 0.6% | |||
Count the Number of Arrays with K Matching Adjacent Elements Math Combinatorics Fermat's Little Theorem | Hard | 97.3% | 0.6% | ||
Medium | 97.3% | 0.5% | |||
Hard | 97.3% | 0.2% | |||
Medium | 91.1% | 0.7% | |||
Hard | 91.1% | 0.5% | |||
Medium | 91.1% | 0.7% | |||
Medium | 91.1% | 0.6% | |||
Medium | 87.4% | 0.6% | |||
Hard | 83.1% | 0.5% | |||
Medium | 83.1% | 0.4% | |||
Medium | 78.1% | 0.4% | |||
Hard | 78.1% | 0.5% | |||
Hard | 78.1% | 0.7% | |||
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Array Queue Sliding Window +3 | Medium | 71.9% | 0.6% | ||
Medium | 71.9% | 0.7% | |||
Medium | 71.9% | 0.4% | |||
Hard | 71.9% | 0.5% | |||
Medium | 71.9% | 0.5% | |||
Hard | 71.9% | 0.3% |
Showing 1–20 of 92 matching problems · All Problems