MDTech

dsa tutorialdata structures and algorithmssystem design interviewlearn programmingcoding interview preparationsoftware engineering interviewsystem design for beginnersleetcode solutionscrack the coding interviewcompetitive programmingobject oriented programmingscalable system designbig tech interview prepFAANG interview questionsMDTech - DSA & System Design

Merge Intervals | LeetCode 56 | Java | Brute to Optimal Solution

Merge Intervals | LeetCode 56 | Java | Brute to Optimal Solution

Merge Intervals | LeetCode 56 | JavaScript | 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 | Java | Brute-Best Solution Explained

Rearrange Array Elements by Sign | Leetcode 2149 | JavaScript | 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 | Boyer-Moore Voting Algorithm | Java

Majority Element II | Leetcode 229 | JavaScript | Boyer-Moore Voting Algorithm

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 | Java | 1 Pass Solution

Sort 0's 1's and 2's | Dutch National flag | Leetcode 75- Sort Colors | JavaScript | 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 | 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 | DP/Kadane's like approach | Part 2

Maximum Product Subarray - Leetcode152 | JavaScript | Prefix-suffix product approach | Part 1

Maximum Product Subarray - Leetcode152 | JavaScript | Prefix-suffix product approach | Part 1

Maximum Product Subarray - Leetcode152 | Java | 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 | Java | No Division | Prefix Sum

Product of Array Except Self | Leetcode 238 | JavaScript | 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 | Java | Brute-Better-Best

Subarray Sum Equals K | Leetcode 560 | Prefix Sum + HashMap | JavaScript | Brute-Better-Best

Subarray Sum Equals K | Leetcode 560 | Prefix Sum + HashMap | JavaScript | Brute-Better-Best

Container With Most Water | Leetcode 11 | Java | Two Pointer Explained

Container With Most Water | Leetcode 11 | Java | Two Pointer Explained

Container With Most Water | Leetcode 11 | JavaScript | Two Pointer Explained

Container With Most Water | Leetcode 11 | JavaScript | Two Pointer Explained

Remove Duplicates from Sorted Array II | JavaScript Solution | LeetCode 80 Explained | Two pointers

Remove Duplicates from Sorted Array II | JavaScript Solution | LeetCode 80 Explained | Two pointers

Remove Duplicates from Sorted Array II | Java Solution | LeetCode 80 Explained | Two pointers

Remove Duplicates from Sorted Array II | Java Solution | LeetCode 80 Explained | Two pointers

Remove duplicates from sorted array | Leetcode 26 | JavaScript | Two pointers | In-place

Remove duplicates from sorted array | Leetcode 26 | JavaScript | Two pointers | In-place

Remove duplicates from sorted array | Leetcode 26 | Java | Two pointers | In-place

Remove duplicates from sorted array | Leetcode 26 | Java | Two pointers | In-place

Remove Element | Leetcode 27 | Java | Two pointers | 2 optimal solutions

Remove Element | Leetcode 27 | Java | Two pointers | 2 optimal solutions

Remove Element | Leetcode 27 | JavaScript | Two pointers | 2 optimal solutions

Remove Element | Leetcode 27 | JavaScript | Two pointers | 2 optimal solutions

Move Zeroes to End | Leetcode 283 | Java | Two pointers | Brute - Better - Best

Move Zeroes to End | Leetcode 283 | Java | Two pointers | Brute - Better - Best

Move Zeroes to End | Leetcode 283 | JavaScript | Two pointers | Brute - Better - Best

Move Zeroes to End | Leetcode 283 | JavaScript | Two pointers | Brute - Better - Best

Merge sorted Arrays | Leetcode 88 | Java | Two pointer | Array | Brute - Better - Best

Merge sorted Arrays | Leetcode 88 | Java | Two pointer | Array | Brute - Better - Best

Merge sorted Arrays | Leetcode 88 | JavaScript | Two pointers | Array | Brute-Better-Best

Merge sorted Arrays | Leetcode 88 | JavaScript | Two pointers | Array | Brute-Better-Best

Rotate Array | Leetcode 189 | Java | Array | Rotate Array right by k steps

Rotate Array | Leetcode 189 | Java | Array | Rotate Array right by k steps

Rotate Array | Leetcode 189 | JavaScript | Array | Rotate Array right by k steps

Rotate Array | Leetcode 189 | JavaScript | Array | Rotate Array right by k steps