
Sumit Kumar
@SumitKumar9128
Followers
224
Following
2K
Media
356
Statuses
620
Backend developer with a passion for solving real-world problems. Maintaining my streak on GeeksforGeeks and LeetCode, one challenge at a time!
India
Joined February 2024
Excited to share that I won the 21-Day #geekstreak2024 Challenge with @DeutscheBank and @geeksforgeeks ,. This challenge motivated me to explore new challenges and grow my skills. Thank you for this amazing experience and the exclusive DB-sponsored bag! π
4
0
24
π₯ Day 319 of #geekstreak2025.β
GFG POTD: Set Matrix Zeros.Used first row & column as markers to optimize space while handling zero positions smartly. #potd #gfg319 #dsa #matrix #geekstreak2025 #coding #java
0
0
2
π₯ Day 318 of #geekstreak2025.β
GFG POTD: Majority Element - More Than n/3.Used extended Boyer-Moore Voting Algorithm to find up to 2 potential candidates and validated them. #potd #gfg318 #dsa #java #geekstreak2025 #boyermoore
0
0
8
π₯ Day 317 of #geekstreak2025.β
GFG POTD: Max Circular Subarray Sum.Used a smart twist on Kadaneβs β.π Max = max(normalKadane, totalSum - minKadane).Handled edge case where all elements are negative. #potd #gfg317 #geekstreak2025 #dsa #java #kadanesalgorithm
0
0
7
π₯ Day 316 of #geekstreak2025.β
GFG POTD: Last Moment Before All Ants Fall Out.π§ Intuition:.Ants fall when they reach either end of the plank. So, the last moment is simply the maximum time any ant takes to fall β whether it's going left or right. #geekstreak2025 #dsa #java
1
0
9
π₯ Day 315 of #geekstreak2025.β
GFG POTD: Sum of Subarrays. Brushed up the formula trick:.Each element contributes to multiple subarrays. So instead of brute force, used:. sum += arr[i] * (i + 1) * (n - i);. Saves time & avoids nested loops β total optimization win.#potd
4
0
17
π§΅ Day 314 of #geekstreak2025.β
GFG POTD: Smallest Positive Missing Number. #dsa #array #potd #gfg314 #geekstreak2025
0
0
2
π§΅ Day 313 of #geekstreak2025.β
GFG POTD: Count the Coprimes.π§ Applied Eulerβs Totient Function (phi) to count coprimes of n. Factored out primes and updated result using the standard phi formula. Clean & direct number theory! .#dsa #math #eulerstotient #numbertheory
0
0
14
π§΅ Day 312 of #geekstreak2025.β
GFG POTD: Count Numbers Containing Specific Digits. π #dsa #math #digits #potd #gfg312 #geekstreak2025
2
0
14
π§΅ Day 310 of #geekstreak2025.β
GFG POTD: LCM Triplet.π§ Applied direct formula based on parity of n β.took top 3 numbers ensuring they are co-prime or pairwise LCM-maximizing. Pure observation + math logic . π #dsa #math #numbertheory #lcm #potd #gfg310 #geekstreak2025
0
0
4
π§΅ Day 309 of #geekstreak2025.β
GFG POTD: Power of k in Factorial of n.π§ Broke k into prime factors,.then applied Legendreβs formula for each prime in n!. Summed up powers β clean number theory + math! .π #dsa #math #numbertheory #factorial #potd #gfg309 #geekstreak2025
0
0
12
π§΅ Day 308 of #geekstreak2025.β
GFG POTD: Nine Divisors.π§ Precomputed primes up to βN,.then counted numbers with exactly two distinct prime factors or a prime raised to the 8th power. Used sieve + combinatorics combo . #dsa #math #sieve #numbertheory #potd #gfg308
0
0
10
π§΅ Day 306 of #geekstreak2025.β
GFG POTD: Minimum Cuts for Special Substrings. Precomputed binary strings of powers of 5,.then used backtracking to try all valid splits minimizing cuts. Explored all partitions β classic recursion + set lookup! .#dsa #backtracking
1
0
13
π§΅ Day 303 of #geekstreak2025.β
GFG POTD: Trail of Ones. #dsa #maths #bitmanipulation #potd #gfg303 #geekstreak2025
0
0
2
π§΅ Day 301 of #geekstreak2025.β
GFG POTD: Sum of Subarray Minimums.π§ Used monotonic stack to find previous and next smaller elements. Each elementβs contribution = val Γ (# of subarrays where itβs the min). Clean math, powerful stack. π #dsa #monotonicstack #array #math
0
0
9