Tan-mused

LeetCode POTD | Smallest Integer Divisible by K | Solution C++ | Hindi | Tan-mused

LeetCode POTD | Binary Prefix Divisible By 5 | Bit Manipulation | Solution C++ | Tan-mused

LeetCode POTD | Keep Multiplying Found Values by Two | Solution C++ | Tan-mused

LeetCode POTD | 1-bit and 2-bit Characters | Intuition | Solution C++ | Tan-mused

LeetCode POTD | Check If All 1's Are at Least Length K Places Away | EASY | Solution C++ | Tan-mused

LeetCode POTD | Number of Substrings With Only 1s | Solution C++ | Tan-mused

LeetCode POTD | Count Operations to Obtain Zero | Solution C++ | Tan-mused

LeetCode POTD | Minimum Time to Make Rope Colorful | Solution C++ | Tan-mused

LeetCode SQL 50 | #6 - Replace Employee ID With The Unique Identifier | SQL JOINS | Tan-mused

LeetCode SQL 50 |#5 - Invalid Tweets | SQL Tutorial for Beginners | Tan-mused

LeetCode POTD | The Two Sneaky Numbers of Digitville | Solution C++ | Two methods | Tan-mused

LeetCode POTD | Simple Bank System | C++ | Solution (Object Oriented Design) | Tan-mused

LeetCode POTD | Calculate Money in Leetcode Bank | Solution C++ | Tan-mused

LeetCode POTD | Check If Digits Are Equal in String After Operations I | Solution | C++ | Tan-mused

LeetCode SQL 50 Problems | #4 - Article Views I | SQL Tutorial for Beginners | Tan-mused

LeetCode SQL 50 Problems | #3 - Big Countries | SQL Tutorial for Beginners | Tan-mused

LeetCode SQL 50 Problems | #2 - Find Customer Referee | SQL Tutorial for Beginners

LeetCode POTD| #3350 Adjacent Increasing Subarrays II | C++ DSA Solution | Brute Force and optimized

LeetCode Problem of the Day | #3349 Adjacent Increasing Subarrays Detection I | CPP | Tan-mused

LeetCode SQL 50 Problems | #1 - Recyclable and Low Fat Products| SQL Tutorial for Beginners

Aao Na । Its Raining And You Miss Her Too Much । Nostalgia। Love। Music