MannSeCoding

At Mann Se Coding, I post daily tech content with a strong focus on:

✅ Data Structures & Algorithms (DSA)
✅ LeetCode Solutions & Daily Challenges
✅ Recursion, Dynamic Programming, and Problem-Solving Techniques
✅ Coding Interview Preparation
✅ Real-world Coding Tips and Tricks
Whether you're a student, aspiring software developer, or working professional, this channel will help you build a solid foundation in programming and technical problem-solving.

New videos every week to keep your coding game strong.

Subscribe now and start your journey toward mastering DSA and tech skills! 💻💡

Linked List Traversal l Data Structures

Linked List Intro | Memory Allocation | 20+LPA | Data Structure

L 838 Number of Distinct Bitwise ORs of Subarrays | Medium | Bit Manipulation + Set Approach

Leetcode 2311 – Longest Binary Subsequence Less Than or Equal to K | Medium | Daily Problem

LeetCode 135 Candy Problem | Greedy + Slope Approach | O(N) | HARD | Must Do For Interview!

Leetcode 2359 Find Closest Node to Given Two Nodes | Medium |Easy Solution | BFS

Leetcode 3561 Resulting String After Adjacent Removals | WEEKLY CONTEST | Stack Solution

Find the Maximum Sum of Node Values – Recursive Solution Explained | Hard | LeetcodeDaily

Set Matrix Zeroes | LeetCode Interview Question Explained with Java + Optimal Solution |O(1) space

Leetcode 3355 - Zero Array Transformation I | Difference Array Explained with Examples

Total Characters in String After Transformations I | LeetCode Solution Explained | Easy Explanation

LeetCode Weekly Contest 449 |Equal Sum Grid Partition I | Problem 2 Explained | Medium

Minimum Equal Sum of Two Arrays After Replacing Zeros | Greedy | Leetcode Medium

*HARD* Count Number of Balanced Permutations | Dynamic Programming + Combinatorics | Todays Leetcode

Find Minimum Time to Reach Last Room II | Dijkstra’s Algorithm + Priority Queue | Leetcode Medium

Find Minimum Time to Reach Last Room I - LeetCode 3341 | Dijkstra Algorithm |Java Solution |Daily

LeetCode 790 | Domino and Tromino Tiling Explained – Recursion, Memoization & Tabulation | Easy

LeetCode Daily Challenge - Problem 1128: Number of Equivalent Domino Pairs | MannSeCoding

LeetCode Daily 1007: Minimum Domino Rotations for Equal Row | Java Solution | MannSeCoding

Lettcode Daily Solution 838 | Push Dominoes | Intuitive Java Solution Explained!