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! 🎒

🔥 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

🔥 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

🔥 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

🔥 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

🧵 Day 314 of #geekstreak2025.✅ GFG POTD: Smallest Positive Missing Number. #dsa #array #potd #gfg314 #geekstreak2025

🧵 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

🧵 Day 312 of #geekstreak2025.✅ GFG POTD: Count Numbers Containing Specific Digits. 🔁 #dsa #math #digits #potd #gfg312 #geekstreak2025

🧵 Day 311 of #geekstreak2025.✅ GFG POTD: Count Unique Vowel Strings.🧠 Counted frequency of each vowel in the string,.then multiplied all frequencies × factorial of distinct vowels count. Used hashmap + frequency logic — worked clean! . #dsa #hashmap #math #string #potd

🧵 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

🧵 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

🧵 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

🧵 Day 307 of #geekstreak2025.✅ GFG POTD: Divisible by 13. Simply used the classic modulo while parsing digits trick,.Processed left to right keeping (rem × 10 + digit) % 13 — clean & efficient . 🔁 #dsa #modulo #math #string #potd #gfg307

🧵 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

🧵 Day 305 of #geekstreak2025.✅ GFG POTD: Maximum Sum of Elements Not Part of LIS.🧠 First calculated total sum of array,.then found sum of elements in Longest Increasing Subsequence using DP. Answer = total − LIS sum . LIS with a twist!. #dsa #dp #lis #array #potd

🧵 Day 304 of #geekstreak2025.✅ GFG POTD: Gold Mine Problem.🧠 Used DP from right to left, exploring 3 possible directions.Stored max gold collectable from each cell — built up to the answer!.Dynamic programming done right! ✅. #dsa #dp #2darray #matrix #potd

🧵 Day 303 of #geekstreak2025.✅ GFG POTD: Trail of Ones. #dsa #maths #bitmanipulation #potd #gfg303 #geekstreak2025

🧵 Day 302 of #geekstreak2025.✅ GFG POTD: Find the Longest String.🧠 Sorted strings by length,.then used a set to check if all prefixes exist — that’s the key to validity!.Picked longest + lex smallest if multiple valid ones. #dsa #string #hashset #sorting #potd

🧵 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

🧵 Day 300 of #geekstreak2025.✅ GFG POTD: Next Element with Greater Frequency

🧵 Day 299 of #geekstreak2025.✅ GFG POTD: Next Greater Element in Circular Array.🧠 Used a monotonic stack and looped the array twice (circular trick ).to find the next greater element for each index. Stack + Modulo = clean solution . #dsa #stack #monotonicstack #array