Day - 569
Solved a linked list problem today 🔗
Used the fast and slow pointer technique to locate the middle node efficiently and remove it without extra space.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 574
Minimum Cost to Fill Given Weight Problem
Solved today’s POTD ✅
Found the minimum cost to buy exactly W kg of oranges using the available packet sizes 🍊💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney
Day - 568
Solved a linked list problem today 🔗⚡
Found the middle of the list, processed twin pairs efficiently, and calculated the maximum twin sum in linear time.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 573
Exit Point in a Matrix Problem
Solved today’s POTD ✅
Traversed a matrix by changing direction whenever a 1 was encountered and found the exact cell where the path exits the grid 🧩💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney
Day - 567
Solved a string manipulation problem today ⚡
Calculated word weights, applied modulo operations, and mapped the results to characters using a reverse alphabet pattern.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 572
Binary Strings with Equal Sum of Two Halves Problem
Solved today’s POTD ✅
Counted all binary sequences where the first half and second half contain the same number of 1s 🔢💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney
Day - 566
Solved a tree LCA problem today 🌳⚡
Used path length properties and parity observations to answer multiple queries efficiently instead of processing each path from scratch.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 571
Check Repeated Substring with K Replacements Problem
Solved today’s POTD ✅
Checked whether a string could be transformed into repeated blocks of length K using at most one allowed replacement 🔤💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney
Day - 565
Solved a tree problem today 🌳
Found the maximum depth path and used a mathematical observation on odd/even edge weight assignments to count valid configurations efficiently.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 570
Equal Point in Brackets Problem
Solved today’s POTD ✅
Found the first position in a bracket string where the number of opening brackets on the left equals the number of closing brackets on the right ⚖️💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney
Day - 569
Binary Searchable Count Problem
Solved today’s POTD ✅
Found the maximum number of elements that can still be located using standard binary search, even though the array isn't sorted 🤯💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney
Day - 564
Solved a tough subarray problem today ⚡
Combined greedy thinking with efficient subarray value processing to maximize the total score while ensuring every chosen subarray was distinct.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 563
Solved a greedy observation problem today ⚡
Found the maximum possible subarray value and used it optimally across the k selections to maximize the total score.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 562
Solved an array partitioning problem today ⚡
Separated elements into less than, equal to, and greater than the pivot while preserving their original order.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 567
Delete Nodes with Greater on Right Problem
Solved today’s POTD ✅
Removed all linked list nodes that had a greater value somewhere on their right and built the final list efficiently 🔗💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney
Day - 561
Solved a tree construction problem today 🌳
Built the binary tree using parent-child relationships and identified the root by tracking nodes that never appeared as children.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 566
Finding Profession Problem
Solved today’s POTD ✅
Found the profession of a person in a special family tree by tracking how Engineer and Doctor roles change across generations 🌳💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney
Day - 560
Solved a prefix sum problem today ⚡
Calculated left and right sums efficiently for each index and found their absolute differences in a single pass.
#1000DaysOfCode#LeetCode#DSA#Python
Day - 565
Non-Attacking Black and White Knights
Solved today’s POTD ✅
Counted the number of ways to place two knights on a chessboard so they can’t attack each other ♞💻
#GeeksforGeeks#POTD#DSA#1000DaysOfCode#CodingJourney