Berryisbetter's blog

By Berryisbetter, history, 7 months ago, In English

I could not find it online so I made it myself, I hope you will find it useful!

Problem : Number of solvers

  • Weird Algorithm : 73338
  • Missing Number : 62177
  • Repetitions : 54281
  • Increasing Array : 50436
  • Permutations : 44614
  • Distinct Numbers : 33154
  • Dice Combinations : 32886
  • Number Spiral : 31522
  • Bit Strings : 29957
  • Minimizing Coins : 28281
  • Trailing Zeros : 28124
  • Coin Combinations I : 26104
  • Two Sets : 25446
  • Coin Piles : 24696
  • Apartments : 24318
  • Removing Digits : 24291
  • Two Knights : 23643
  • Grid Paths : 23168
  • Ferris Wheel : 23109
  • Counting Rooms : 22561
  • Palindrome Reorder : 22339
  • Coin Combinations II : 22133
  • Sum of Two Values : 21004
  • Maximum Subarray Sum : 20797
  • Book Shop : 20376
  • Creating Strings : 19359
  • Building Roads : 19197
  • Restaurant Customers : 18982
  • Concert Tickets : 18507
  • Apple Division : 18503
  • Stick Lengths : 18339
  • Movie Festival : 17839
  • Message Route : 16337
  • Building Teams : 15780
  • Money Sums : 15420
  • Edit Distance : 15362
  • Static Range Sum Queries : 15022
  • Array Description : 14663
  • Labyrinth : 14632
  • Towers : 14395
  • Playlist : 13870
  • Shortest Routes I : 13296
  • Gray Code : 13026
  • Rectangle Cutting : 12900
  • Subordinates : 12596
  • Collecting Numbers : 12588
  • Round Trip : 12488
  • Increasing Subsequence : 12424
  • Tower of Hanoi : 12254
  • Two Sets II : 12191
  • Missing Coin Sum : 12076
  • Subarray Sums I : 11726
  • Dynamic Range Sum Queries : 11680
  • Static Range Minimum Queries : 11301
  • Traffic Lights : 11225
  • Chessboard and Queens : 11140
  • Sum of Three Values : 11065
  • Subarray Sums II : 11049
  • Shortest Routes II : 11049
  • Removal Game : 10858
  • Exponentiation : 10670
  • Range Xor Queries : 10511
  • Dynamic Range Minimum Queries : 10447
  • Tree Diameter : 10326
  • Factory Machines : 9848
  • Subarray Divisibility : 9575
  • Tasks and Deadlines : 9540
  • Nearest Smaller Values : 9278
  • Counting Divisors : 9005
  • Course Schedule : 8681
  • Range Update Queries : 8454
  • Forest Queries : 8306
  • Array Division : 8267
  • Projects : 8159
  • Room Allocation : 8149
  • Exponentiation II : 7766
  • Counting Towers : 7633
  • Reading Books : 7625
  • Tree Distances I : 7577
  • Monsters : 7384
  • Flight Discount : 7327
  • Sum of Four Values : 7183
  • Josephus Problem I : 7117
  • Digit Queries : 7016
  • Tree Matching : 6879
  • Company Queries I : 6762
  • High Score : 6688
  • Road Construction : 6465
  • Game Routes : 6410
  • Round Trip II : 6405
  • Company Queries II : 6320
  • Tree Distances II : 6139
  • Common Divisors : 6133
  • Cycle Finding : 6091
  • Distance Queries : 6048
  • Road Reparation : 6045
  • Hotel Queries : 5984
  • Sliding Median : 5821
  • Longest Flight Route : 5675
  • Flight Routes Check : 5620
  • Flight Routes : 5187
  • Subarray Distinct Values : 5137
  • Movie Festival II : 5094
  • Collecting Numbers II : 5065
  • List Removals : 4945
  • Elevator Rides : 4664
  • Grid Paths : 4640
  • Maximum Subarray Sum II : 4559
  • Investigation : 4521
  • Planets and Kingdoms : 4476
  • Subtree Queries : 4436
  • Binomial Coefficients : 4336
  • Josephus Problem II : 4215
  • String Matching : 4100
  • Nested Ranges Check : 3940
  • Sliding Cost : 3923
  • Salary Queries : 3728
  • Planets Queries I : 3686
  • Creating Strings II : 3590
  • Sum of Divisors : 3571
  • Distributing Apples : 3539
  • Counting Paths : 3508
  • Path Queries : 3476
  • Counting Numbers : 3461
  • Distinct Colors : 3280
  • Fibonacci Numbers : 3264
  • Subarray Sum Queries : 3200
  • Finding Borders : 3198
  • Distinct Values Queries : 3060
  • Point Location Test : 2975
  • Coin Collector : 2878
  • Nested Ranges Count : 2853
  • Christmas Party : 2827
  • Prefix Sum Queries : 2777
  • Counting Tilings : 2670
  • Planets Cycles : 2617
  • Hamiltonian Flights : 2581
  • Finding a Centroid : 2556
  • Meet in the Middle : 2499
  • Mail Delivery : 2467
  • Download Speed : 2406
  • Range Updates and Sums : 2395
  • Pizzeria Queries : 2282
  • Prime Multiples : 2211
  • Divisor Analysis : 2203
  • Polygon Area : 2145
  • Finding Periods : 2142
  • Word Combinations : 2106
  • Forest Queries II : 2087
  • Nim Game I : 2055
  • Teleporters Path : 1979
  • Giant Pizza : 1854
  • Polynomial Queries : 1840
  • Throwing Dice : 1829
  • Bracket Sequences I : 1816
  • Line Segment Intersection : 1775
  • Advertisement : 1773
  • Longest Palindrome : 1758
  • School Dance : 1735
  • Multiplication Table : 1732
  • Counting Bits : 1722
  • Nim Game II : 1660
  • Graph Paths I : 1640
  • Josephus Queries : 1638
  • Stick Game : 1630
  • Planets Queries II : 1622
  • Dice Probability : 1602
  • Stick Divisions : 1582
  • Police Chase : 1562
  • Shortest Subsequence : 1502
  • Counting Coprime Pairs : 1465
  • Convex Hull : 1388
  • Graph Paths II : 1379
  • Hamming Distance : 1356
  • De Bruijn Sequence : 1353
  • Graph Girth : 1306
  • Range Queries and Copies : 1277
  • Candy Lottery : 1210
  • Knight's Tour : 1183
  • Minimal Rotation : 1171
  • Stair Game : 1150
  • Point in Polygon : 1149
  • Bit Inversions : 1121
  • Distinct Routes : 1062
  • Increasing Subsequence II : 1047
  • Increasing Array Queries : 1031
  • Maximum Xor Subarray : 1017
  • Acyclic Graph Edges : 984
  • Polygon Lattice Points : 966
  • Maximum Building I : 948
  • Path Queries II : 909
  • Reachable Nodes : 907
  • Beautiful Subgrids : 899
  • Counting Necklaces : 898
  • Swap Game : 890
  • Bracket Sequences II : 886
  • Minimum Euclidean Distance : 872
  • Fixed-Length Paths I : 822
  • Moving Robots : 805
  • Intersection Points : 804
  • Necessary Roads : 769
  • Palindrome Queries : 750
  • Course Schedule II : 746
  • Another Game : 738
  • New Roads Queries : 726
  • Counting Grids : 713
  • Necessary Cities : 706
  • Required Substring : 700
  • Grundy's Game : 692
  • Empty String : 690
  • Prüfer Code : 687
  • Bit Problem : 655
  • Reachability Queries : 653
  • Finding Patterns : 653
  • Coding Company : 642
  • Distinct Substrings : 634
  • Repeating Substring : 624
  • String Functions : 622
  • Cut and Paste : 602
  • School Excursion : 598
  • Counting Patterns : 565
  • Strongly Connected Edges : 557
  • Chess Tournament : 552
  • Xor Pyramid : 541
  • Even Outdegree Edges : 529
  • Substring Reversals : 523
  • Tree Traversals : 514
  • Pattern Positions : 511
  • Reversals and Sums : 509
  • Monster Game I : 501
  • String Removals : 492
  • Tree Isomorphism I : 488
  • Area of Rectangles : 485
  • Book Shop II : 482
  • Substring Order I : 480
  • Movie Festival Queries : 480
  • Subarray Squares : 464
  • Number Grid : 463
  • Cyclic Array : 450
  • Monster Game II : 445
  • Permutations II : 443
  • Network Breakdown : 441
  • Network Renovation : 437
  • Permutation Inversions : 433
  • Substring Distribution : 428
  • Inverse Inversions : 426
  • Tree Isomorphism II : 411
  • Sorting Methods : 408
  • Writing Numbers : 401
  • Special Substrings : 393
  • Grid Paths : 391
  • Pyramid Array : 385
  • String Reorder : 382
  • Knuth Division : 373
  • Eulerian Subgraphs : 355
  • Apples and Bananas : 354
  • Dynamic Connectivity : 347
  • Coin Grid : 347
  • Increasing Array II : 346
  • One Bit Positions : 330
  • Visiting Cities : 329
  • Houses and Schools : 323
  • Substring Order II : 315
  • Forbidden Cities : 313
  • Fixed-Length Paths II : 312
  • Signal Processing : 305
  • Parcel Delivery : 301
  • Monotone Subsequences : 294
  • Task Assignment : 280
  • Food Division : 278
  • Counting Sequences : 270
  • String Transform : 253
  • Stack Weights : 251
  • Distinct Routes II : 245
  • Maximum Building II : 236
  • Programmers and Artists : 226
  • List of Sums : 224
  • Grid Puzzle I : 220
  • Flight Route Requests : 219
  • Swap Round Sorting : 202
  • Creating Offices : 200
  • Critical Cities : 195
  • Missing Coin Sum Queries : 184
  • Inversion Probability : 184
  • New Flight Routes : 180
  • Bit Substrings : 163
  • Robot Path : 155
  • Counting Bishops : 155
  • Grid Puzzle II : 154
  • Reversal Sorting : 153
  • Coin Arrangement : 142
  • Functional Graph Distribution : 106
  • Binary Subsequences : 103
  • Counting Reorders : 100
  • Grid Completion : 94
  • Removing Digits II : 88
  • Filling Trominos : 87
  • Letter Pair Move Game : 82
  • Two Stacks Sorting : 55
  • Grid Path Construction : 49
  • Vote: I like it
  • +28
  • Vote: I do not like it

»
7 months ago, # |
  Vote: I like it -32 Vote: I do not like it

Lol

»
7 months ago, # |
  Vote: I like it +10 Vote: I do not like it

Brother it's quite unreadable. I have two suggestions: 1) Give serial no. and 2) make it a gradual list, so that we can understand it much easily.

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Berryisbetter (previous revision, new revision, compare).

»
7 months ago, # |
  Vote: I like it -13 Vote: I do not like it

I could not find it online

Could not find what? Number of people who solved the problem? Just see at the right of problem name.

Spoiler
»
7 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Two Stacks Sorting is a brilliant problem

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

CSES problems are based on Competitive topics or focuses mostly on DSA like leetcode?

  • »
    »
    7 months ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    I would say it is tougher than leetcode. But it covers problems based on lot of standard ideas and their variations, from easy to hard.

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

If you get time, pls do something similar for Project Euler too!

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Adding Links for the problem name would be amazing!

  • »
    »
    7 months ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    Me and him are friends and from what I understood he did it by copy-pasting all the text and filtering commas and such, so it would require much additional work.
    But I'll tell him about it to see if we can do it efficiently with some js

»
5 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

how to find the problems?

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

You can find cses solutions at my blog : solutions

»
3 months ago, # |
  Vote: I like it +1 Vote: I do not like it

would have been better if you had put link inside the names like this