Commits

Branch selector

main

User selector

All users

Datepicker

All time

Commit history

Commits on Sep 28, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  4fc6ee9View commit details

  Copy full SHA for 4fc6ee9

  Browse repository at this point

• Solved LeetCode 1614 using a running open-bracket counter to track the maximum nesting depth of parentheses in O(n) time and O(1) space with runtime = 1ms.

  rajit2004

  committed
  3d2d129View commit details

  Copy full SHA for 3d2d129

  Browse repository at this point

Commits on Sep 27, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  1d77169View commit details

  Copy full SHA for 1d77169

  Browse repository at this point

• Solved LeetCode 1190 using bracket-pair jump map with direction flipping to reverse bracketed substrings in a single O(n) walk with runtime = 2 & 3ms respectively.

  rajit2004

  committed
  daf33d0View commit details

  Copy full SHA for daf33d0

  Browse repository at this point

Commits on Sep 26, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  de77a94View commit details

  Copy full SHA for de77a94

  Browse repository at this point

• Solved LeetCode 1807 using single-pass scan with a hash-map key lookup to evaluate bracket pairs in O(n + k) time with runtime = 37ms.

  rajit2004

  committed
  fd32afbView commit details

  Copy full SHA for fd32afb

  Browse repository at this point

Commits on Sep 25, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  c39db3dView commit details

  Copy full SHA for c39db3d

  Browse repository at this point

• Solved LeetCode 1096 using recursive descent parsing of union and concatenation grammar to expand brace expressions into a sorted deduplicated string set with runtime = 9 , 10ms respectively.

  rajit2004

  committed
  7111306View commit details

  Copy full SHA for 7111306

  Browse repository at this point

Commits on Sep 24, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  9eb761cView commit details

  Copy full SHA for 9eb761c

  Browse repository at this point

• Solved LeetCode 3550 using left-to-right digit-sum scan to find the smallest index whose value's digit sum equals the index in O(n * d) with runtime = 1ms.

  rajit2004

  committed
  564b938View commit details

  Copy full SHA for 564b938

  Browse repository at this point

Commits on Sep 23, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  cb79a55View commit details

  Copy full SHA for cb79a55

  Browse repository at this point

• Solved LeetCode 1658 using complement sliding window to find the longest middle subarray with sum total-minus-x, minimizing end removals in O(n) with runtime = 4ms.

  rajit2004

  committed
  ce35544View commit details

  Copy full SHA for ce35544

  Browse repository at this point

Commits on Sep 22, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  c1afe0cView commit details

  Copy full SHA for c1afe0c

  Browse repository at this point

• Solved LeetCode 3525 using a segment tree of per-node product-remainder counts to answer point updates and start-anchored subarray queries in O(k log n) each with runtime = 226ms.

  rajit2004

  committed
  af209b7View commit details

  Copy full SHA for af209b7

  Browse repository at this point

Commits on Sep 21, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  85ba114View commit details

  Copy full SHA for 85ba114

  Browse repository at this point

• Solved LeetCode 3524 using rolling DP over product remainders to count subarrays by (product mod k) in O(n*k) time and O(k) space with runtime = 13ms.

  rajit2004

  committed
  ebfc5a7View commit details

  Copy full SHA for ebfc5a7

  Browse repository at this point

Commits on Sep 20, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  f371a78View commit details

  Copy full SHA for f371a78

  Browse repository at this point

• Solved LeetCode 3948 using single-pass weighted summation of reverse-alphabet degrees to compute the reverse degree of a string in O(n) with runtime = 1ms.

  rajit2004

  committed
  d6a9584View commit details

  Copy full SHA for d6a9584

  Browse repository at this point

Commits on Sep 19, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  b4918aaView commit details

  Copy full SHA for b4918aa

  Browse repository at this point

• Solved LeetCode 1401 using closest-point clamping with squared-distance check to test circle-rectangle overlap in O(1) time with runtime = 0ms.

  rajit2004

  committed
  ebde85aView commit details

  Copy full SHA for ebde85a

  Browse repository at this point

Commits on Sep 18, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  d87abaaView commit details

  Copy full SHA for d87abaa

  Browse repository at this point

• Solved LeetCode 1520 using interval-closure expansion and right-endpoint greedy selection to maximize non-overlapping substrings containing all occurrences of their characters with runtime = 31ms.

  rajit2004

  committed
  e6306d8View commit details

  Copy full SHA for e6306d8

  Browse repository at this point

Commits on Sep 17, 2026

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  176381dView commit details

  Copy full SHA for 176381d

  Browse repository at this point

• Solved LeetCode 1477 using sliding-window DP over positive-array prefix sums to find two non-overlapping target-sum subarrays with minimum total length in O(n) with runtime = 63 and 7ms respectively.

  rajit2004

  committed
  61d3650View commit details

  Copy full SHA for 61d3650

  Browse repository at this point

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  7432a70View commit details

  Copy full SHA for 7432a70

  Browse repository at this point

• Solved LeetCode 11 using two-pointer greedy scan that always moves the shorter wall inward to find maximum container area in O(n) with runtime = 4ms.

  rajit2004

  committed
  bcacb63View commit details

  Copy full SHA for bcacb63

  Browse repository at this point

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  59c4cb1View commit details

  Copy full SHA for 59c4cb1

  Browse repository at this point

• Solved LeetCode 1621 using stars-and-bars combinatorial formula C(n+k-1, 2k) with modular inverse to count k non-overlapping line segments in O(k + log MOD) with runtime = 27 and 1ms respectively.

  rajit2004

  committed
  67f97f3View commit details

  Copy full SHA for 67f97f3

  Browse repository at this point

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  76dac5fView commit details

  Copy full SHA for 76dac5f

  Browse repository at this point

• Solved LeetCode 2472 using earliest-ending greedy scan of length-k and length-(k+1) palindromes to maximize non-overlapping palindromic substrings with runtime 141 and 1ms respectively.

  rajit2004

  committed
  aaad0f9View commit details

  Copy full SHA for aaad0f9

  Browse repository at this point

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  11e70daView commit details

  Copy full SHA for 11e70da

  Browse repository at this point

• Solved LeetCode 836 using positive intersection-area test to detect rectangle overlap in O(1) time with runtime 0ms.

  rajit2004

  committed
  cbeb42aView commit details

  Copy full SHA for cbeb42a

  Browse repository at this point

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  d189a14View commit details

  Copy full SHA for d189a14

  Browse repository at this point

• Solved LeetCode 835 using shift histogram over 1-cell coordinate pairs to find the translation maximizing image overlap with runtime = 18ms.

  rajit2004

  committed
  f39eb88View commit details

  Copy full SHA for f39eb88

  Browse repository at this point

• 📋 Auto-update problem list

  github-actions[bot]

  committed
  b2aa306View commit details

  Copy full SHA for b2aa306

  Browse repository at this point