πHalfway there!π―
Six months ago, I committed to the #365DaysOfDSA challenge.
Today marks 181 days of showing up, learning, and improving, one problem at a time.
I still have halfway to go, and I'm more motivated than ever. The journey continues!π₯
#DSA#LeetCode#Java
πDay 232/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 2946 β Matrix Similarity After Cyclic Shift
πΉUsed modulo to compare each element with its shifted position based on even/odd rows.
#DSA#LeetCode#Java#CodingJourney#100DaysOfDSA
π Day 231/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 3069 β Distribute Elements Into Two Arrays I
πΉSplit elements into two arrays based on their last elements, then merge them back.
#DSA#LeetCode#Java#CodingJourney#100DaysOfDSA
π Day 230/365 of #365DaysOfDSA π
Solved 1 Problem Today
β LC 1386 β Cinema Seat Allocation
πΉ Used a HashMap to store reserved seats and check possible family placements row by row.
#DSA#LeetCode#Java#CodingJourney#100DaysOfDSA
π Day 229/365 of #365DaysOfDSA π
Solved 1 DSA Problem Yesterday
β LC 3844 β Largest Integer
πΉ Used a frequency array to track how often each number appears across all subarrays.
#DSA#LeetCode#Java#CodingJourney#100DaysOfDSA
πDay 228/365 of #365DaysOfDSA π
Resolved 1 DSA Problem Today
β LC 4024 β Nearest Available Drone
πΉ Used a simple traversal to find the closest reachable drone using Manhattan distance.
#DSA#LeetCode#Java#CodingJourney
π Day 227/365 of #365DaysOfDSA π
Solved 1 DSA Problem Yesterday
β LC 4024 β Nearest Available Drone
πΉ Used a PriorityQueue to find the closest reachable drone using Manhattan distance.
#DSA#LeetCode#Java
π Day 226/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 3702 β Longest Subsequence With Non-Zero Bitwise XOR
πΉFind the XOR of all elements. If itβs non-zero, return n; otherwise, remove one non-zero element and return n-1.
#DSA#LeetCode#Java#100DaysOfDSA
πDay 225/365 of #365DaysOfDSA π
Solved 1 DSA Problem Yesterday
β LC 2958 β Length of Longest Substring With At Most Two Occurrences
πΉUse a sliding window with a HashMap to maintain character frequencies and shrink the window whenever any character appears more than twice
#DSA
πDay 224/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 190 β Reverse Bits
πΉ Reverse all 32 bits by taking the last bit of n, adding it to ans, and using bit shifting to build the reversed number.
#DSA#LeetCode#Java#Algorithms#ProblemSolving
πDay 223/365 of #365DaysOfDSA π
Solved 1 DSA Problem Yesterday
β LC 2958 β Length of Longest Subarray With at Most K Frequency
πΉ Use a sliding window with a HashMap to maintain element frequencies and shrink the window whenever the frequency exceeds k.
#DSA#LeetCode#Java
πDay 222/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 2996 β Smallest Missing Integer Greater Than Sequential Prefix
πΉFind the sequential prefix sum, then increment it until itβs missing.
#DSA#LeetCode#Java
π Day 221/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 164 β Maximum Gap
πΉ Sort the array and find the maximum difference between consecutive elements.
#DSA
πDay 219/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 86 β Partition List
πΉSplit nodes into two lists (< x and β₯ x), then connect them while preserving their original order.
#DSA#LeetCode#Java#Algorithms#ProblemSolving
π Day 218/365 of #365DaysOfDSA π
Solved 1 Problem Today
β LC 12 β Integer to Roman
πΉUse precomputed Roman numeral mappings for thousands, hundreds, tens, and ones to build the answer directly.
#DSA#LeetCode#Java#Algorithms#ProblemSolving
πDay 217/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 3345 β Smallest Divisible Digit Product I
πΉ Keep checking the digit product of consecutive numbers until it becomes divisible by the target.
πDay 216/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 3310 β Remove Methods From Project
πΉ Used BFS to mark suspicious methods, then verified if they could be safely removed.
#DSA#LeetCode#Java#Graphs#BFS#Algorithms
πDay 215/365 of #365DaysOfDSA π
Solved 1 DSA Problem Today
β LC 3656 β Find Missing Elements of a Range
πΉ Used a HashSet for fast lookups and collected all missing numbers between the minimum and maximum values.