codesniper
  • Home (current)
  • Templates (current)
  • Starters
    Brain Sharpners Beginner Brute Force Greedy
  • Intermediate
    Sub(array/seq) Maths Bits Implementation Recursion Sorting Binary Search Two Pointers Hashing
  • Advance
    Dp Standard Dp Tree Graph DSU Segment Tree Mixed Problems(Hard)
  • Login
    Signin Signup
  • Add (current)
  1. 1. Maximum Number of Jumps to Reach the Last Index
  1. 2. Longest Non-decreasing Subarray From Two Arrays
  1. 3. Maximum Number of Non-overlapping Palindrome Substrings
  1. 4. Tenzing and Balls
  1. 5. Number of Great Partitions
  1. 6. Egg Drop With 2 Eggs and N Floors
  1. 7. Word Break
  1. 8. Super Egg Drop
  1. 9. Throw and Take
  1. 10. Sherlock and Cost
  1. 11. Kingdom Division
  1. 12. Moamen and XOR
  1. 13. Earn or Unlock
  1. 14. Stone Division, Revisited
  1. 15. Up the Strip (simplified version)
  1. 16. Up the Strip
  1. 17. Counting Factorizations
  1. 18. Stringforces
  1. 19. Planar Reflections
  1. 20. Armchairs
  1. 21. Tenzing and Random Operations
  1. 22. Rescue Niwen!

Copyright © All rights reserved