Hey, I'm Nitin Ahirwal.

LeetCode Challenge Day 83 — 1523. Count Odd Numbers in an Interval Range

Day 83 of my LeetCode challenge! Today’s problem is "Count Odd Numbers in an Interval Range" — a simple yet elegant math-based problem where a direct observation helps avoid unnecessary iteration.

LeetCode Challenge Day 82 — 3578. Count Partitions With Max-Min Difference at Most K

Day 82 of my LeetCode challenge! Today’s problem is "Count Partitions With Max-Min Difference at Most K" — a solid mix of sliding window, monotonic queues, and dynamic programming to efficiently count valid contiguous partitions.

LeetCode Challenge Day 81 — 3432. Count Partitions with Even Sum Difference

Day 81 of my LeetCode challenge! Today’s problem is "Count Partitions with Even Sum Difference" — a fun parity-based problem where a single mathematical observation lets us skip checking all partitions and solve it instantly.

LeetCode Challenge Day 80 — 2211. Count Collisions on a Road

Day 80 of my LeetCode challenge! Today’s problem is "Count Collisions on a Road" — an interesting simulation problem where recognizing patterns allows us to avoid simulating each step and instead derive collisions mathematically.