MDTech
Find Pivot Index – LeetCode 724 Solution in Java | Brute-Better-Best
LeetCode 724: Find Pivot Index | JavaScript Explained | Brute-Better-Best
LeetCode 1480 Running Sum | Easy Explanation + Java Solution | Beginner Friendly
LeetCode 1480 Running Sum | Easy Explanation + JavaScript Solutions | Beginner Friendly
Pascal’s Triangle II | Leetcode 119 | JavaScript | Generate row only
Pascal’s Triangle II | Leetcode 119 | Java | Generate row only
Coding Pascal’s Triangle Step by Step | Leetcode 118 | Java | 3 Intuitions-Best explanation!
Coding Pascal’s Triangle Step by Step | Leetcode 118 | JavaScript | 3 Intuitions-Best explanation!
👉 LeetCode 18: 4Sum Problem Explained | Java Solution | Two Pointer + Sorting Approach
👉 LeetCode 18: 4Sum Problem Explained | JavaScript Solution | Two Pointer + Sorting Approach
Master 3Sum (LeetCode 15) in Java | Two Pointer Approach | DSA Interview Prep | MDTech
Master 3Sum (LeetCode 15) in JavaScript | Two Pointer Approach | DSA Interview Prep | MDTech
Next Permutation Explained | LeetCode 31 | Java (Step-by-Step Solution)
Next Permutation Explained | LeetCode 31 | JavaScript (Step-by-Step Solution)
Merge Intervals | LeetCode 56 | Java | Brute to Optimal Solution
Merge Intervals | LeetCode 56 | JavaScript | Brute to Optimal Solution
Rearrange Array Elements by Sign | Leetcode 2149 | Java | Brute-Best Solution Explained
Rearrange Array Elements by Sign | Leetcode 2149 | JavaScript | Brute-Best Solution Explained
Majority Element II | Leetcode 229 | Boyer-Moore Voting Algorithm | Java
Majority Element II | Leetcode 229 | JavaScript | Boyer-Moore Voting Algorithm
Sort 0's 1's and 2's | Dutch National flag | Leetcode 75- Sort Colors | Java | 1 Pass Solution
Sort 0's 1's and 2's | Dutch National flag | Leetcode 75- Sort Colors | JavaScript | 1 Pass Solution
Maximum Product Subarray - Leetcode152 | Java | DP/Kadane's like approach | Part 2
Maximum Product Subarray - Leetcode152 | JavaScript | DP/Kadane's like approach | Part 2
Maximum Product Subarray - Leetcode152 | JavaScript | Prefix-suffix product approach | Part 1
Maximum Product Subarray - Leetcode152 | Java | Prefix-suffix product approach | Part 1
Product of Array Except Self | Leetcode 238 | Java | No Division | Prefix Sum
Product of Array Except Self | Leetcode 238 | JavaScript | No Division | Prefix Sum
Subarray Sum Equals K | Leetcode 560 | Prefix Sum + HashMap | Java | Brute-Better-Best
Subarray Sum Equals K | Leetcode 560 | Prefix Sum + HashMap | JavaScript | Brute-Better-Best