Ankit Singh Tomar @Ankitdotdev

Day 185/365 of the DSA grind! Binary Search & Monotonic Stacks: • Search in Rotated Array II: Handled duplicates in binary search by shrinking bounds when left == mid == right. • Largest Rectangle in Histogram (Hard): Used a monotonic stack! Appended a 0 to the array to elegantly flush the stack at the end. • Maximal Rectangle (Hard): Treated each row of the matrix as a histogram baseline and reused the exact same monotonic stack logic! #DSA #Java #100DaysOfCode #LeetCode #MonotonicStack

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 184/365 of the DSA grind! Classic arrays & backtracking: • Sort Colors: Implemented the Dutch National Flag algorithm! Used 3 pointers to sort 0s, 1s, and 2s in-place with a single O(N) pass. • Subsets: Generated the power set using standard recursive backtracking logic. • Subsets II: Handled duplicates in the power set by sorting the array first and skipping adjacent identical elements during the recursion loop! #DSA #Java #100DaysOfCode #LeetCode #Backtracking

keyboard_arrow_left Previous keyboard_arrow_right Next

@upamanyuacharya Refining prompt will come after sometimes I guess I usually did not cared about the prompt initially now I sit and rethink my prompt twice or thrice make sure I use tokens properly And you are correct people treat the output from LLMs almost correct without confidently reading it

Day 183/365 of the DSA grind! Cyclic Sort & Backtracking with duplicates: • First Missing Positive (Hard): Used Cyclic Sort to swap numbers to their correct indices. O(N) time, O(1) space, Beats 100%! • Combination Sum II: Backtracking! Sorted the array and skipped duplicates at the same depth to ensure unique combinations. • Permutations II: Handled duplicates using a used boolean array and enforced relative ordering to generate only unique permutations. #DSA #Java #100DaysOfCode #LeetCode #Backtracking

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 182/365 of the DSA grind! Array manipulations & Two-Pointers: • 3Sum Closest: Sorted array + two pointers tracking the absolute minimum difference from the target. • 4Sum: O(N³) approach with meticulous duplicate-skipping at all 4 pointer levels and long casting to prevent overflow! • Next Permutation: Found the next lexicographical arrangement in-place (O(1) space, O(N) time) by finding the pivot, swapping, and reversing the tail! #DSA #Java #100DaysOfCode #LeetCode #Arrays

keyboard_arrow_left Previous keyboard_arrow_right Next

@Unnati_twts Can you add me??

Day 181/365 of the DSA grind! String formatting & elegant 2D DP today: • Text Justification (Hard): A pure implementation challenge! Built a word processor's logic with greedy word packing, precise space distribution, and tons of edge cases. • Maximal Square (Medium): Beautiful DP logic! Found the max square area by taking the minimum of the top, left, and top-left DP states + 1 for every '1' in the matrix. #DSA #Java #100DaysOfCode #LeetCode #DynamicProgramming

keyboard_arrow_left Previous keyboard_arrow_right Next

@codewithsushi Hopefully outcome of this group is same that you suspect

@codewithsushi Good initiative

Day 180/365 of the DSA grind! Classic Hard DP today: • Buy & Sell Stock III: Modeled 2 transactions as a state machine with just 4 variables. Pure O(1) space! • Edit Distance: Handled insert/delete/replace operations seamlessly with a 2D DP matrix. • Buy & Sell Stock IV: Generalized to k transactions! Optimized large k to a greedy approach, and used a space-optimized 2D DP array for the rest. #DSA #Java #100DaysOfCode #LeetCode #DynamicProgramming

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 179/365 of the DSA grind! Advanced strings & more 2D DP today: • Unique Paths II: Reused the input obstacle grid for O(1) space! Sum of top & left paths, handling obstacles as 0. • Longest Palindromic Substring: Skipped DP for the "Expand Around Center" approach to achieve pure O(1) space complexity! • Interleaving String: Used a 2D boolean DP array to precisely track valid prefix interleavings between two strings to form a third. #DSA #Java #100DaysOfCode #LeetCode #DynamicProgramming

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 178/365 of the DSA grind! Multi-dimensional and optimized DP today: • Longest Increasing Subsequence: Achieved O(N log N) using a tails array and Binary Search instead of standard O(N²) DP! • Minimum Path Sum: Modified the input grid in-place to accumulate path sums. O(1) extra space! • Triangle: Bottom-up DP! Modified the triangle list from bottom to top to find the minimum path sum, also O(1) space. #DSA #Java #100DaysOfCode #LeetCode #DynamicProgramming

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 177/365 of the DSA grind! Learning 1D Dynamic Programming today: • House Robber: Decide whether to rob or skip based on previous maxes. • Optimized down to O(1) space!Word Break: Used a boolean DP array to track valid prefix segmentations from the dictionary. • Coin Change: Bottom-up DP! Initialized array with "infinity" and tested every coin to find the mathematical minimum. #DSA #Java #100DaysOfCode #LeetCode #DynamicProgramming

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 176/365 of the DSA grind! Math, Geometry, and DP today! • Max Points on a Line (Hard): Skipped floating-point division! Used a GCD helper to reduce slopes into exact fractions and hashed them. • Pow(x, n): Fast Exponentiation! Squared the base and halved the power for O(log n) speed. • Climbing Stairs: Intro to DP! Realized it's just the Fibonacci sequence and optimized it to O(1) space using two pointers. #DSA #Java #100DaysOfCode #LeetCode #SoftwareEngineering

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 175/365 of the DSA grind! Math tricks and Binary Search today: • Factorial Trailing Zeroes: Skipped the massive n! calculation. Just counted the prime factors of 5 to find the number of 10s! • Sqrt(x): Banned from Math.sqrt()? Used Binary Search with long variables to dodge integer overflow traps. • Plus One: Array addition simulation with a clean new int[n+1] trick to handle the '999' rollover edge case! #DSA #Java #100DaysOfCode #LeetCode #Algorithms

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 174/365 of the DSA grind! More Bit Manipulation and basic Math today: • Single Number II: Standard XOR fails on triplets! Built a base-3 logic circuit using ones and twos to clear out bits seen three times. • Bitwise AND of Numbers Range: Skipped the massive loop! Right-shifted bounds to find the common prefix, then left-shifted back to pad with zeros. • Palindrome Number: Skipped string conversion. Extracted digits purely with % 10 and / 10! #DSA #Java #100DaysOfCode #LeetCode #SoftwareEngineering

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 173/365 of the DSA grind! Close to the metal today with Bit Manipulation! • Single Number: The ultimate XOR trick! Duplicates cancel each other out to 0, leaving only the unique number in O(1) space. • Number of 1 Bits: Brian Kernighan's Algorithm! n &= (n - 1) instantly drops the lowest set bit. • Reverse Bits: Rebuilt a 32-bit integer bit-by-bit using &, |, and logical shifts (>>>). #DSA #Java #100DaysOfCode #LeetCode #SoftwareEngineering

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 172/365 of the DSA grind! Two Heaps and some Binary Math today: •Find Median from Data Stream (Hard): Balanced a Max-Heap (lower half) against a Min-Heap (upper half) to guarantee instant O(1) median lookups! • Find K Smallest Pairs: Used a Min-Heap to dynamically explore pairs without wasting time calculating all O(N^2) combinations. • Add Binary: Classic right-to-left string addition with a carry tracker. #DSA #Java #100DaysOfCode #LeetCode

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 171/365 of the DSA grind! Two LeetCode Hards and QuickSelect today! • Median of Two Sorted Arrays (Hard): Binary searched the smaller array to find the perfect partition line in O(log(min(m,n)))! • Kth Largest Element: QuickSelect with a randomized pivot to achieve O(N) average time. • IPO (Hard): Sorted by capital, dumped affordable projects into a Max-Heap, and greedily popped the highest profits! #DSA #Java #100DaysOfCode #LeetCode #Algorithms

keyboard_arrow_left Previous keyboard_arrow_right Next