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. Remove spaces
  1. 2. Find key
  1. 3. Series AP
  1. 4. If-else
  1. 5. Make it small
  1. 6. 2 power
  1. 7. Codeforces checking
  1. 8. Following Directions
  1. 9. Immediate Smaller
  1. 10. Maximum Subarray Sum
  1. 11. Firsrt time k
  1. 12. Move Zeroes
  1. 13. Count nodes
  1. 14. Reverse Linked List
  1. 15. Is Circular
  1. 16. Remove it
  1. 17. Remove it again!
  1. 18. Stack with LL
  1. 19. Next Greater
  1. 20. Left Smallest
  1. 21. Valid Parentheses
  1. 22. Trapping Rain Water
  1. 23. Skyscrapers (easy version)
  1. 24. Skyscrapers (hard version)
  1. 25. Queue through LL
  1. 26. Queue using Two Stacks
  1. 27. First Unique
  1. 28. Recent Calls
  1. 29. Design Circular Queue
  1. 30. Buy tickets
  1. 31. Sliding Maximum
  1. 32. Truck Tour
  1. 33. Snake and Ladder

Copyright © All rights reserved