Badri

No. of Contests Participated: 6

2000 to 2500 difficulty problems

Remaining Money, Gladiator Fighting, Prime Sum, Expensive Buying, Cyclic Shift Minimization

Make Subarray, Tourist

XOR Sorting, GCND, Spring Cleaning, Sabotage, Alternate Jumps, Cycle and Add

Chocolate Eating, First Element Counting, Make All, Delete Sorted Subsequence

LIS and LDS, Minimum Same Difference, XOR Equal Subtract, Best Seats

Collatz Conjecture (Hard), Collatz Conjecture (Easy), Deleting Array Again, Counting Optimal Arrays, Stop The Count

B - Fair Removals, J - Varied Subsequences