LeetCode 4084 | Last Visited Cell in a Directional Grid | Simulation | C++

LeetCode 4085 | Find Root of a Colored Tree | Brute Force to Optimal | C++

LeetCode 4080 | Design Bus Seat Booking System | OOP + Simulation | C++

LeetCode 4081 | Prime Subset Selection II | Sieve + 0/1 DP | C++

LeetCode 4079 | Prime Subset Selection I | Sieve + Prefix Sum + Binary Search | C++

LeetCode 4072 | Maximum Alternating Subarray Sum With One Deletion | DP + Memoization | C++

LeetCode 4070 & 4071 | Minimum Rotations to Dial a Number I & II | C++

LeetCode 4058 | Maximum Pulse Value After One Subarray Rotation | C++

LeetCode 4057 & 4056 | Number of Intersecting Interval Pairs I & II | C++

LeetCode Weekly Contest 514 Q3 🚀 Maximum Area of Two Non-Overlapping Square Submatrices | C++

LeetCode 4015 | Weighted Sum of a Tree | Weekly Contest 514 Q2 🔥 BFS Solution Explained | C++

LeetCode 4014 Solution | Minimum Total Price After Applying Discounts | Easy Greedy Problem

LeetCode Weekly Contest 513 | Q2 & Q4 Explained | Count Subarrays With Even Odd Ratio I & II | C++