lcpy gen -n <number>.
| # | Problem | Difficulty | Solution |
|---|---|---|---|
| 204 | Count Primes | Medium | solution.py |
| 479 | Largest Palindrome Product | Hard | solution.py |
| 681 | Next Closest Time | Medium | solution.py |
| 800 | Similar RGB Color | Easy | solution.py |
| 816 | Ambiguous Coordinates | Medium | solution.py |
| 829 | Consecutive Numbers Sum | Hard | solution.py |
| 845 | Longest Mountain in Array | Medium | solution.py |
| 869 | Reordered Power of 2 | Medium | solution.py |
| 906 | Super Palindromes | Hard | solution.py |
| 949 | Largest Time for Given Digits | Medium | solution.py |
| 970 | Powerful Integers | Medium | solution.py |
| 1291 | Sequential Digits | Medium | solution.py |
| 1849 | Splitting a String Into Descending Consecutive Values | Medium | solution.py |
| 1863 | Sum of All Subset XOR Totals | Easy | solution.py |
| 1958 | Check if Move is Legal | Medium | solution.py |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | solution.py |
| 2306 | Naming a Company | Hard | solution.py |
| 2929 | Distribute Candies Among Children II | Medium | solution.py |
| 3434 | Maximum Frequency After Subarray Operation | Medium | solution.py |