https://t.co/hZBdajWerJ
Day 253/365 – 365 Days of Coding
Another day, another problem solved!
Today's challenge was LeetCode 3693 – Climbing Stairs II (Medium).
Day 251/365
Solved LeetCode 1267 – Count Servers that Communicate.
Used row and column counts to identify servers that can communicate with another server.
#365DaysOfCode#LeetCode#Cpp#ProblemSolving
Day 250/365
Reached a milestone: 250 days of consistent coding!
Today's challenge: LeetCode 1882 – Process Tasks Using Servers.
Practiced task scheduling, priority queues, and managing server availability using C++.
Day 249/365! Another day, another problem solved.
Today's challenge was LeetCode 1385 – Find the Distance Value Between Two Arrays.
The key idea was to check each element in the first array and see whether every element in the second array is at a distance greater than d.
Day 248/365 – 365 Days of Code
Today's challenge was a Hard one!
LeetCode 3505 – Minimum Operations to Make Elements Within K Subarrays Equal
This problem pushed me to think carefully about sliding windows, median maintenance, and optimization.
Day 246/365
Today's challenge: LeetCode 462 – Minimum Moves to Equal Array Elements II (Medium).
The key idea? Use the median as the target.
After sorting the array, I picked the middle element and added the absolute difference between every element and that median.
Day 244/365
Today's challenge: LeetCode 3665 – Twisted Mirror Path Count (Medium).
A grid-path problem with a twist: mirrors change the robot's direction when it tries to enter them!
Day 242/365
Today's challenge: LeetCode 3841 – Palindromic Path Queries in a Tree (Hard).
The task involved character updates on tree nodes and checking whether characters along a path could be rearranged into a palindrome.
#365DaysOfCode#LeetCode#CPlusPlus#DSA
Day 241/365
Solved LeetCode 3882 – Minimum XOR Path in a Grid in C++.
The goal: find the minimum XOR across all paths from the top-left to the bottom-right, moving only right or down.
Practiced breaking the problem down with dynamic programming and bitwise XOR.
Day 240/365
Today's challenge: LeetCode 3963 – Create Grid With Exactly One Path
Built a grid in C++ with strategically placed obstacles to ensure there’s exactly one path from the top-left to the bottom-right.
Day 239/365
Today's challenge: LeetCode 3619 – Count Islands With Total Value Divisible by K
Used DFS in C++ to explore connected land cells, calculate each island's total, and check whether that total is divisible by k.
Day 238/365
Solved LeetCode 1254 – Number of Closed Islands today!
Used BFS in C++ to explore connected land cells and check whether each island stays away from the grid’s boundary.