Practice problems across 75+ categories
Practice coding problems across all companies and topics • 3600 problems | 879 Easy | 1856 Medium | 842 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 3196 | Maximize Total Cost of Alternating Subarrays | Medium | ArrayDynamic Programming |
| 3198 | Find Cities in Each State | Easy | Database |
| 3199 | Count Triplets with Even XOR Set Bits I | Easy | ArrayBit Manipulation |
| 3200 | Maximum Height of a Triangle | Easy | ArrayEnumeration |
| 3201 | Find the Maximum Length of Valid Subsequence I | Medium | ArrayDynamic Programming |
| 3202 | Find the Maximum Length of Valid Subsequence II | Medium | ArrayDynamic Programming |
| 3203 | Find Minimum Diameter After Merging Two Trees | Hard | TreeDepth-First SearchBreadth-First Search |
| 3204 | Bitwise User Permissions Analysis | Medium | Database |
| 3205 | Maximum Array Hopping Score I | Medium | ArrayDynamic ProgrammingStack |
| 3206 | Alternating Groups I | Easy | ArraySliding Window |
| 3207 | Maximum Points After Enemy Battles | Medium | ArrayGreedy |
| 3208 | Alternating Groups II | Medium | ArraySliding Window |
| 3209 | Number of Subarrays With AND Value of K | Hard | ArrayBinary SearchBit Manipulation |
| 3210 | Find the Encrypted String | Easy | String |
| 3211 | Generate Binary Strings Without Adjacent Zeros | Medium | StringBacktrackingBit Manipulation |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
