Канал: devwithcp

539. Minimum Time Difference || Simple Approach || Leetcode || Detailed Explanation

539. Minimum Time Difference || Simple Approach || Leetcode || Detailed Explanation

1371. Find the Longest Substring Containing Vowels in Even Counts || Bitmask || Leetcode || Detailed

1371. Find the Longest Substring Containing Vowels in Even Counts || Bitmask || Leetcode || Detailed

2419. Longest Subarray With Maximum Bitwise AND || Simple || Leetcode || Detailed Explanation

2419. Longest Subarray With Maximum Bitwise AND || Simple || Leetcode || Detailed Explanation

1310. XOR Queries of a Subarray || Simple XOR || Detailed Explanation || Leetcode

1310. XOR Queries of a Subarray || Simple XOR || Detailed Explanation || Leetcode

2807. Insert Greatest Common Divisors in Linked List || Simple Simulation || Leetcode

2807. Insert Greatest Common Divisors in Linked List || Simple Simulation || Leetcode

2326. Spiral Matrix IV || Simple Simulation || Editorial || Leetcode || Detailed Explanation

2326. Spiral Matrix IV || Simple Simulation || Editorial || Leetcode || Detailed Explanation

1367. Linked List in Binary Tree || Recursion || DFS || Detailed Explanation

1367. Linked List in Binary Tree || Recursion || DFS || Detailed Explanation

3217. Delete Nodes From Linked List Present in Array || Simple || Leetcode || Editorail

3217. Delete Nodes From Linked List Present in Array || Simple || Leetcode || Editorail

2028. Find Missing Observations || Simple Math || Editorial || Leetcode || Detailed Explanation

2028. Find Missing Observations || Simple Math || Editorial || Leetcode || Detailed Explanation

874. Walking Robot Simulation || Editorial || Detailed Explanation || Leetcode

874. Walking Robot Simulation || Editorial || Detailed Explanation || Leetcode

1894. Find the Student that Will Replace the Chalk || Array || 2 Approach || Editorial || Detailed

1894. Find the Student that Will Replace the Chalk || Array || 2 Approach || Editorial || Detailed

2699. Modify Graph Edge Weights || dijkstra || Graph || Hard becomes easy || Editorial

2699. Modify Graph Edge Weights || dijkstra || Graph || Hard becomes easy || Editorial

947. Most Stones Removed with Same Row or Column || DFS || Graph || Editorial

947. Most Stones Removed with Same Row or Column || DFS || Graph || Editorial

#2 C++ STL In One Video || Competitive Programming & DSA Course || Editorial || Detailed Explanation

#2 C++ STL In One Video || Competitive Programming & DSA Course || Editorial || Detailed Explanation

1905. Count Sub Islands || Why Graph || DFS || BFS || Editorial || Detailed Explanation

1905. Count Sub Islands || Why Graph || DFS || BFS || Editorial || Detailed Explanation

1514. Path with Maximum Probability || Why Dijkstra || BFS || Editorial || Leetcode

1514. Path with Maximum Probability || Why Dijkstra || BFS || Editorial || Leetcode

564. Find the Closest Palindrome || 2 Approach || Binary Search || Closest palindrome || Editorial

564. Find the Closest Palindrome || 2 Approach || Binary Search || Closest palindrome || Editorial

592. Fraction Addition and Subtraction || Simple approach || Leetcode || Editorial

592. Fraction Addition and Subtraction || Simple approach || Leetcode || Editorial

476. Number Complement || Brute force || Bitwise || Leetcode || Detailed Explanation || Editorial

476. Number Complement || Brute force || Bitwise || Leetcode || Detailed Explanation || Editorial

#1 C++ Basic in One Video | Competitive Programming & DSA Course

#1 C++ Basic in One Video | Competitive Programming & DSA Course

664. Strange Printer | Partition DP | Recursion + memo | Leetcode | Detailed Explanation | Editorial

664. Strange Printer | Partition DP | Recursion + memo | Leetcode | Detailed Explanation | Editorial

1140. Stone Game II || Recursion + memo || Tabulation || Editorial || Leetcode

1140. Stone Game II || Recursion + memo || Tabulation || Editorial || Leetcode

264. Ugly Number II || Set || Min Heap || 1D DP || Leetcode || Editorial || Detailed Explanation

264. Ugly Number II || Set || Min Heap || 1D DP || Leetcode || Editorial || Detailed Explanation

1937. Maximum Number of Points with Cost || space optimized || why greedy fails || 2D DP || leetcode

1937. Maximum Number of Points with Cost || space optimized || why greedy fails || 2D DP || leetcode

624. Maximum Distance in Arrays || min-max || Heap || editorial || Leetcode-624 || Devwithcp

624. Maximum Distance in Arrays || min-max || Heap || editorial || Leetcode-624 || Devwithcp

719. Find K-th Smallest Pair Distance || Sliding Window || Binary Search || Leetcode || Editorial

719. Find K-th Smallest Pair Distance || Sliding Window || Binary Search || Leetcode || Editorial

40. Combination Sum II || Editorial || Why Backtracking? || Detailed Explanation

40. Combination Sum II || Editorial || Why Backtracking? || Detailed Explanation

273. Integer to English Words || Recursion || Editorial

273. Integer to English Words || Recursion || Editorial

3016. Minimum Number of Pushes to Type Word II || editorial || map || priority_queue || devwithcp

3016. Minimum Number of Pushes to Type Word II || editorial || map || priority_queue || devwithcp

1508. Range Sum of Sorted Subarray Sums || Binary Search || Priority Queue || 3 Approach || Dry Run

1508. Range Sum of Sorted Subarray Sums || Binary Search || Priority Queue || 3 Approach || Dry Run

1460. Make Two Arrays Equal by Reversing Subarrays || Editorial || Detailed Explanation

1460. Make Two Arrays Equal by Reversing Subarrays || Editorial || Detailed Explanation

Question Asked by Google in Online Assessment. #shorts #education #interviewquestions #google

Question Asked by Google in Online Assessment. #shorts #education #interviewquestions #google

2134. Minimum Swaps to Group All 1's Together II | Editorial | Why grouping zeros and grouping ones

2134. Minimum Swaps to Group All 1's Together II | Editorial | Why grouping zeros and grouping ones

Codechef Starters 145 (Div- 2) || D. Beautiful Array || Editorial || Detailed Explanation

Codechef Starters 145 (Div- 2) || D. Beautiful Array || Editorial || Detailed Explanation

1105. Filling Bookcase Shelves | Why Greedy fails || Recursion + memo || Iterative DP || Dry Run

1105. Filling Bookcase Shelves | Why Greedy fails || Recursion + memo || Iterative DP || Dry Run

Educational Codeforces Round 168 (Rated for Div. 2) | Editorial of problem D || D. Maximize the Root

Educational Codeforces Round 168 (Rated for Div. 2) | Editorial of problem D || D. Maximize the Root

1653. Minimum Deletions to Make String Balanced || Stack || Space optimized || Editorial

1653. Minimum Deletions to Make String Balanced || Stack || Space optimized || Editorial

1395. Count Number of Teams || Recursion + memoization || space optimized || Editorial || Devwithcp

1395. Count Number of Teams || Recursion + memoization || space optimized || Editorial || Devwithcp

2045. Second Minimum Time to Reach Destination || Dijkstra || BFS || Editorial

2045. Second Minimum Time to Reach Destination || Dijkstra || BFS || Editorial

2976. Minimum Cost to Convert String I || Dijkstra || Floyd Warshal || Editorial || Leetcode

2976. Minimum Cost to Convert String I || Dijkstra || Floyd Warshal || Editorial || Leetcode

1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance || Dijkstra

1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance || Dijkstra

Codechef Starters 144 (Div - 2) || Editorial for A, B, C, D || Detailed Explanation

Codechef Starters 144 (Div - 2) || Editorial for A, B, C, D || Detailed Explanation

912. Sort an Array || Editorial || Complete Dry Run || Detailed Explanation

912. Sort an Array || Editorial || Complete Dry Run || Detailed Explanation

Codeforces Round 961 ( Div - 2) || Editorial for A, B1, B2, C || Detailed explanation

Codeforces Round 961 ( Div - 2) || Editorial for A, B1, B2, C || Detailed explanation

2191. Sort the Jumbled Numbers || 2 Approaches || Editorial || Detailed Explanation || Leetcode

2191. Sort the Jumbled Numbers || 2 Approaches || Editorial || Detailed Explanation || Leetcode

1636. Sort Array by Increasing Frequency | Custom Comparator | Editorial | Detailed Explanation

1636. Sort Array by Increasing Frequency | Custom Comparator | Editorial | Detailed Explanation

2418. Sort the People || Editorial || map || Leetcode || Detailed Explanation

2418. Sort the People || Editorial || map || Leetcode || Detailed Explanation

2392. Build a Matrix With Conditions || Toposort with DFS and BFS || Editorial || Devwithcp

2392. Build a Matrix With Conditions || Toposort with DFS and BFS || Editorial || Devwithcp

1605. Find Valid Matrix Given Row and Column Sums || Editorial || Optimized Space || Devwithcp

1605. Find Valid Matrix Given Row and Column Sums || Editorial || Optimized Space || Devwithcp

Codechef Starters 143 (Div - 2) || Editorial of Problem D || D. Spread of Ratism || Devwithcp

Codechef Starters 143 (Div - 2) || Editorial of Problem D || D. Spread of Ratism || Devwithcp

1380. Lucky Numbers in a Matrix || 2 Approach || Optimized Space || Detailed Explanation

1380. Lucky Numbers in a Matrix || 2 Approach || Optimized Space || Detailed Explanation

1530. Number of Good Leaf Nodes Pairs || 2 Approach || Editorial || DFS || BFS || Complete Dry Run

1530. Number of Good Leaf Nodes Pairs || 2 Approach || Editorial || DFS || BFS || Complete Dry Run

1110. Delete Nodes And Return Forest || Editorial || Detailed Explanation

1110. Delete Nodes And Return Forest || Editorial || Detailed Explanation

Codeforces Round - 958 (Div - 2) || Editorial for Problem A, B, C, D || Devwithcp

Codeforces Round - 958 (Div - 2) || Editorial for Problem A, B, C, D || Devwithcp

2096. Step-by -Step Directions From a Binary Tree Node to Another || 236. LCA || Devwithcp

2096. Step-by -Step Directions From a Binary Tree Node to Another || 236. LCA || Devwithcp

2196. Create Binary Tree From Descriptions || Complete Dry Run of Code || Detailed Explanation

2196. Create Binary Tree From Descriptions || Complete Dry Run of Code || Detailed Explanation

Leetcode Weekly Contest 406 || A, B, C, D || Complete Dry Run || Detailed Explanation

Leetcode Weekly Contest 406 || A, B, C, D || Complete Dry Run || Detailed Explanation

726. Number of Atoms || Complete Dry Run || Detailed Explanation

726. Number of Atoms || Complete Dry Run || Detailed Explanation

Become Pro by learning these bitwise operator techniques for competitive programming or regret later

Become Pro by learning these bitwise operator techniques for competitive programming or regret later

Maximum Score From Removing Substrings || Stack || String || Greedy || Leetcode 1717

Maximum Score From Removing Substrings || Stack || String || Greedy || Leetcode 1717

Codechef Starters 142 (Div - 2) || A, B, C, D || Dry run || Detailed Explanation

Codechef Starters 142 (Div - 2) || A, B, C, D || Dry run || Detailed Explanation

Codeforces Round - 956 (Div - 2) || A, B, C, D || Complete Dry Run || Detailed Explanation

Codeforces Round - 956 (Div - 2) || A, B, C, D || Complete Dry Run || Detailed Explanation

Leetcode Biweekly Contest - 134 || A, B, C, D || Complete Dry Run || Detailed Explanation

Leetcode Biweekly Contest - 134 || A, B, C, D || Complete Dry Run || Detailed Explanation

Find the Minimum and Maximum Number of Nodes Between Critical Points || Leetcode- 2058 || Devwithcp

Find the Minimum and Maximum Number of Nodes Between Critical Points || Leetcode- 2058 || Devwithcp

Codechef Starters 141 ( Div - 2) || A, B, C, D || Dry Run || Detailed Explanation

Codechef Starters 141 ( Div - 2) || A, B, C, D || Dry Run || Detailed Explanation

Minimum Difference Between Largest and Smallest Value in three Moves || Leetcode - 1509 || Devwithcp

Minimum Difference Between Largest and Smallest Value in three Moves || Leetcode - 1509 || Devwithcp

E. Wonderful Tree! || DP on Trees || Detailed Explanation || Codeforces

E. Wonderful Tree! || DP on Trees || Detailed Explanation || Codeforces

Codeforces Epic Institute of technology Round Summer 2024 (Div -1 + Div - 2) || Detailed Explanation

Codeforces Epic Institute of technology Round Summer 2024 (Div -1 + Div - 2) || Detailed Explanation

Remove Max Number of Edges to Keep Graph Fully Traversable || Leetcode 1579 || DSU || Dry Run

Remove Max Number of Edges to Keep Graph Fully Traversable || Leetcode 1579 || DSU || Dry Run

All Ancestors of a Node in a Directed Acyclic Graph || Leetcode - 2192 || Toposort || DFS || Dry Run

All Ancestors of a Node in a Directed Acyclic Graph || Leetcode - 2192 || Toposort || DFS || Dry Run

Codechef Starters 140 (DIV - 2) || A,B, C, D, E || Dry Run || Detailed Explanation

Codechef Starters 140 (DIV - 2) || A,B, C, D, E || Dry Run || Detailed Explanation

1791. Find Center of Star Graph || 2 Simple approaches || Leetcode potd || Detailed Explanation

1791. Find Center of Star Graph || 2 Simple approaches || Leetcode potd || Detailed Explanation

Codeforces Round 955 (Div - 2) || A, B, C, D || Dry Run || Detailed Explanation || Devwithcp

Codeforces Round 955 (Div - 2) || A, B, C, D || Dry Run || Detailed Explanation || Devwithcp

Balance a Binary Search Tree || Leetcode 1382 || Detailed Explanation || Devwithcp

Balance a Binary Search Tree || Leetcode 1382 || Detailed Explanation || Devwithcp

Binary Search Tree to Greater Sum Tree || Two approach || Stack || Recursion || Leetcode 1038

Binary Search Tree to Greater Sum Tree || Two approach || Stack || Recursion || Leetcode 1038

Minimum Number of K Consecutive Bit Flips || Sliding Window || Leetcode 995 || Detailed Explanation

Minimum Number of K Consecutive Bit Flips || Sliding Window || Leetcode 995 || Detailed Explanation

Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit || Leetcode 1438

Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit || Leetcode 1438

Codechef Starters 139 ( Div -2) || A, B, C, D || Detailed Explanation || Live Coding || Devwithcp

Codechef Starters 139 ( Div -2) || A, B, C, D || Detailed Explanation || Live Coding || Devwithcp

Count Number of Nice Subarrays || Leetcode-1248 || Sliding WIndow || Detailed Explanation

Count Number of Nice Subarrays || Leetcode-1248 || Sliding WIndow || Detailed Explanation

Grumpy Bookstore Owner || Leetcode 1052 || Sliding Window || Detailed Explanation

Grumpy Bookstore Owner || Leetcode 1052 || Sliding Window || Detailed Explanation

Magnetic Force Between Two Balls || Leetcode 1552 || Brute Force || Binary Search || Detailed

Magnetic Force Between Two Balls || Leetcode 1552 || Brute Force || Binary Search || Detailed

1482. Minimum Number of Days to Make m Bouquets || Brute force || Binary Search || Leetcode POTD

1482. Minimum Number of Days to Make m Bouquets || Brute force || Binary Search || Leetcode POTD

Middlewares are weirdest in nextjs? || Middlewares || Next.js || Devwithcp

Middlewares are weirdest in nextjs? || Middlewares || Next.js || Devwithcp

826. Most Profit Assigning Work || Binary Search || Two Pointer || Detailed Explanation || Leetcode

826. Most Profit Assigning Work || Binary Search || Two Pointer || Detailed Explanation || Leetcode

633. Sum of Square Numbers || Two Pointer || Binary search || Basic Math leetcode POTD || Devwithcp

633. Sum of Square Numbers || Two Pointer || Binary search || Basic Math leetcode POTD || Devwithcp

330. Patching Array || leetcode POTD || Devwithcp || Detailed Explanation

330. Patching Array || leetcode POTD || Devwithcp || Detailed Explanation

502. IPO || Greedy || Max Heap || Leetcode POTD || Devwithcp

502. IPO || Greedy || Max Heap || Leetcode POTD || Devwithcp

Bag of Tokens || Greedy || Google || Leetcode- 948 || Detailed Explanation || devwithcp

Bag of Tokens || Greedy || Google || Leetcode- 948 || Detailed Explanation || devwithcp

Maximum odd binary number || Leetcode 2864 || Count() || reverse() || sort() || unordered_map

Maximum odd binary number || Leetcode 2864 || Count() || reverse() || sort() || unordered_map

All you need to know about Nextjs 14 (Server actions and partial Pre-rendering) || Devwithcp

All you need to know about Nextjs 14 (Server actions and partial Pre-rendering) || Devwithcp

Maximum Length of a Concatenated String with Unique Characters || Recursion || Leetcode -1239

Maximum Length of a Concatenated String with Unique Characters || Recursion || Leetcode -1239

Pseudo-Palindromic Paths in a Binary Tree || Amazon || Bit masking || Traversal || Leetcode-1457

Pseudo-Palindromic Paths in a Binary Tree || Amazon || Bit masking || Traversal || Leetcode-1457

House Robber || Recursion || Memoization || Tabulation || Leetcode 198 || Detailed Explanation

House Robber || Recursion || Memoization || Tabulation || Leetcode 198 || Detailed Explanation

Minimum Falling Path Sum || Amazon || Google || Microsoft || Leetcode 931 || Detailed Explanations

Minimum Falling Path Sum || Amazon || Google || Microsoft || Leetcode 931 || Detailed Explanations

Climbing Stairs || Amazon || Microsoft || Recursion || Memoization || Detailed Explanation || POTD

Climbing Stairs || Amazon || Microsoft || Recursion || Memoization || Detailed Explanation || POTD

Unique Number of Occurrences || Google || Amazon || Leetcode 1207 || Detailed Explanations || POTD

Unique Number of Occurrences || Google || Amazon || Leetcode 1207 || Detailed Explanations || POTD

Insert Delete GetRandom O(1) || Amazon || Google || Leetcode - 380 || POTD

Insert Delete GetRandom O(1) || Amazon || Google || Leetcode - 380 || POTD

Combination Sum IV || Recursion || DP || Google || Amazon || Leetcode - 377 || Detail Explanation

Combination Sum IV || Recursion || DP || Google || Amazon || Leetcode - 377 || Detail Explanation

Split Linked List In Parts || Linked List || Amazon || Uber || Leetcode - 725 || Detail Explanations

Split Linked List In Parts || Linked List || Amazon || Uber || Leetcode - 725 || Detail Explanations

Maximum Length of Pair Chain || Recursion || DP || Amazon || Google || Leetcode- 646 || Explanation

Maximum Length of Pair Chain || Recursion || DP || Amazon || Google || Leetcode- 646 || Explanation

Interleaving String || Recursion || DP || 5 Approach || Google || Media.net || Leetcode - 97

Interleaving String || Recursion || DP || 5 Approach || Google || Media.net || Leetcode - 97

Text Justification || Implementation || Google || Uber || Leetcode - 68 || Detail Explanation

Text Justification || Implementation || Google || Uber || Leetcode - 68 || Detail Explanation

Reorganize String || Max Heap || Amazon || Uber || Tesla || Leetcode - 767 || Detail Explanation

Reorganize String || Max Heap || Amazon || Uber || Tesla || Leetcode - 767 || Detail Explanation

Repeated Substring Pattern || String || Google || Amazon || Leetcode - 459 || Detail Explanation

Repeated Substring Pattern || String || Google || Amazon || Leetcode - 459 || Detail Explanation

Sort Items by Groups Respecting Dependencies || Toposort || Graph || Amazon || Leetcode - 1203

Sort Items by Groups Respecting Dependencies || Toposort || Graph || Amazon || Leetcode - 1203

Find Critical And Pseudo-Critical Edges In Minimum Spanning Tree || MST || Amazon || Leetcode - 1489

Find Critical And Pseudo-Critical Edges In Minimum Spanning Tree || MST || Amazon || Leetcode - 1489

Maximal Network Rank || Graph || 2 Methods || Microsoft || Tesla || Leetcode - 1615

Maximal Network Rank || Graph || 2 Methods || Microsoft || Tesla || Leetcode - 1615

Sliding Window Maximum || Monotonic Deque || Amazon || Microsoft || Uber || Leetcode - 239

Sliding Window Maximum || Monotonic Deque || Amazon || Microsoft || Uber || Leetcode - 239

Partition List || Linked List || Super Easy || Google || Adobe || Leetcode- 86 || Detail Explanation

Partition List || Linked List || Super Easy || Google || Adobe || Leetcode- 86 || Detail Explanation

Kth Largest Element In An Array || Min-Heap || Sorting || Leetcode - 215 || Detail Explanation

Kth Largest Element In An Array || Min-Heap || Sorting || Leetcode - 215 || Detail Explanation

Check If There Is A Valid Partition For The Array || Recursion || Memoization ||Tabulation || Google

Check If There Is A Valid Partition For The Array || Recursion || Memoization ||Tabulation || Google

Minimum Absolute Difference Between Elements With Constraint || Leetcode Weekly Contest 358

Minimum Absolute Difference Between Elements With Constraint || Leetcode Weekly Contest 358

Double A Number Represented as a Linked List || Leetcode Weekly Contest 358 || Detail Explanation

Double A Number Represented as a Linked List || Leetcode Weekly Contest 358 || Detail Explanation

Max Pair Sum in an Array || Leetcode Weekly Contest 358 || Detail Explanation

Max Pair Sum in an Array || Leetcode Weekly Contest 358 || Detail Explanation

Unique Path II | Recursion | Memoization | Tabulation | Space Optimisation | Amazon | Leetcode - 63

Unique Path II | Recursion | Memoization | Tabulation | Space Optimisation | Amazon | Leetcode - 63

Coin Change II | Recursion | Memoization | Tabulation | Space Optimisation | AMAZON | Leetcode- 518

Coin Change II | Recursion | Memoization | Tabulation | Space Optimisation | AMAZON | Leetcode- 518