Code With Vick

leetcode 3130 | Find All Possible Stable Binary Arrays II | Dynamic Programming | Leetcode POTD| DSA

Code With Vick

leetcode 3130 | Find All Possible Stable Binary Arrays II | Dynamic Programming | Leetcode POTD| DSA

15:20

leetcode 3129 | Find All Possible Stable Binary Arrays I | Dynamic Programming | leetcode POTD | DSA

Code With Vick

leetcode 3129 | Find All Possible Stable Binary Arrays I | Dynamic Programming | leetcode POTD | DSA

20:13

weekly contest 492 | leetcode 3861|leetcode 3862|leetcode 3863|leetcode 3864 | DSA | Easy solutions

Code With Vick

weekly contest 492 | leetcode 3861|leetcode 3862|leetcode 3863|leetcode 3864 | DSA | Easy solutions

30:49

leetcode 1980 | Find Unique Binary String | Recursion|BFS | Cantor's Diagonal Method | Leetcode POTD

Code With Vick

leetcode 1980 | Find Unique Binary String | Recursion|BFS | Cantor's Diagonal Method | Leetcode POTD

14:21

leetcode 1888 | Minimum Number of Flips to Make the Binary String Alternating | Sliding Window |POTD

Code With Vick

leetcode 1888 | Minimum Number of Flips to Make the Binary String Alternating | Sliding Window |POTD

20:27

Pattern 8 | KMP algorithm | Knuth-Morris-Pratt Algorithm | Explained with proper examples. | DSA

Code With Vick

Pattern 8 | KMP algorithm | Knuth-Morris-Pratt Algorithm | Explained with proper examples. | DSA

28:58

leetcode 1784 | Check if Binary String Has at Most One Segment of Ones | Leetcode POTD | String

Code With Vick

leetcode 1784 | Check if Binary String Has at Most One Segment of Ones | Leetcode POTD | String

4:57

leetcode 1758 | Minimum Changes To Make Alternating Binary String | Leetcode POTD | DSA

Code With Vick

leetcode 1758 | Minimum Changes To Make Alternating Binary String | Leetcode POTD | DSA

5:17

leetcode 1582 | Special Positions in a Binary Matrix | leetcode POTD | 2D matrix | DSA | Easy soln

Code With Vick

leetcode 1582 | Special Positions in a Binary Matrix | leetcode POTD | 2D matrix | DSA | Easy soln

9:17

leetcode 1545 | Find Kth Bit in Nth Binary String | Divide and Conquer | Leetcode POTD | DSA

Code With Vick

leetcode 1545 | Find Kth Bit in Nth Binary String | Divide and Conquer | Leetcode POTD | DSA

16:37

leetcode 1545 | Find Kth Bit in Nth Binary String | Divide and Conquer | Leetcode POTD | DSA

Code With Vick

leetcode 1545 | Find Kth Bit in Nth Binary String | Divide and Conquer | Leetcode POTD | DSA

16:37

leetcode 1536 | Minimum Swaps to Arrange a Binary Grid | Greedy | Leetcode POTD | Medium | DSA

Code With Vick

leetcode 1536 | Minimum Swaps to Arrange a Binary Grid | Greedy | Leetcode POTD | Medium | DSA

12:55

weekly contest 491 | leetcode 3856 | leetcode 3857 | leetcode 3858 | leetcode 3859 | DSA

Code With Vick

weekly contest 491 | leetcode 3856 | leetcode 3857 | leetcode 3858 | leetcode 3859 | DSA

38:53

leetcode 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Leetcode POTD | DSA

Code With Vick

leetcode 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Leetcode POTD | DSA

5:00

leetcode 1680 | Concatenation of Consecutive Binary Numbers | Leetcode POTD | DSA

Code With Vick

leetcode 1680 | Concatenation of Consecutive Binary Numbers | Leetcode POTD | DSA

10:39

leetcode 3666 | Minimum Operations to Equalize Binary String | BFS | Binary Search| Leetcode POTD

Code With Vick

leetcode 3666 | Minimum Operations to Equalize Binary String | BFS | Binary Search| Leetcode POTD

39:05

leetcode 1404 | Number of Steps to Reduce a Number in Binary Representation to One | Leetcode POTD

Code With Vick

leetcode 1404 | Number of Steps to Reduce a Number in Binary Representation to One | Leetcode POTD

16:49

leetcode 1356 | Sort Integers by The Number of 1 Bits | Leetcode POTD | Easy | Bit Manipulation

Code With Vick

leetcode 1356 | Sort Integers by The Number of 1 Bits | Leetcode POTD | Easy | Bit Manipulation

14:24

leetcode 1022 | Sum of Root To Leaf Binary Numbers | DFS | BFS | Recursion | Queue | Leetcode POTD

Code With Vick

leetcode 1022 | Sum of Root To Leaf Binary Numbers | DFS | BFS | Recursion | Queue | Leetcode POTD

14:07

leetcode 1461 | Check If a String Contains All Binary Codes of Size K | leetcode POTD | DSA | Medium

Code With Vick

leetcode 1461 | Check If a String Contains All Binary Codes of Size K | leetcode POTD | DSA | Medium

17:18

weekly contest 490 | leetcode 3847 | leetcode 3848 | leetcode 3849 | leetcode 3850 | DSA

Code With Vick

weekly contest 490 | leetcode 3847 | leetcode 3848 | leetcode 3849 | leetcode 3850 | DSA

36:24

leetcode 868 | Binary Gap | Leetcode POTD | Bit Manipulation | Easy | DSA | Begineer Freindly

Code With Vick

leetcode 868 | Binary Gap | Leetcode POTD | Bit Manipulation | Easy | DSA | Begineer Freindly

6:30

leetcode 762 | Prime Number of Set Bits in Binary Representation | Leetcode POTD | Brian Kernighan's

Code With Vick

leetcode 762 | Prime Number of Set Bits in Binary Representation | Leetcode POTD | Brian Kernighan's

12:58

leetcode 761 | Special Binary String | Divide and Conquer |Recursion | Sorting|String| Leetcode POTD

Code With Vick

leetcode 761 | Special Binary String | Divide and Conquer |Recursion | Sorting|String| Leetcode POTD

22:54

leetcode 696 | Count Binary Substrings | Binary | String | Leetcode POTD | Easy | Two Pointer | DSA

Code With Vick

leetcode 696 | Count Binary Substrings | Binary | String | Leetcode POTD | Easy | Two Pointer | DSA

12:05

leetcode 693 | Binary Number with Alternating Bits | Bit manipulation | leetcode POTD | DSA

Code With Vick

leetcode 693 | Binary Number with Alternating Bits | Bit manipulation | leetcode POTD | DSA

5:14

leetcode 401 | Binary Watch | Begineer Friendly | Bits | DSA | Leetcode | Bit Manipulation

Code With Vick

leetcode 401 | Binary Watch | Begineer Friendly | Bits | DSA | Leetcode | Bit Manipulation

11:22

leetcode 190 | Reverse Bits | Easy | Optimization from O(32) to O(5) | Leetcode POTD | DSA

Code With Vick

leetcode 190 | Reverse Bits | Easy | Optimization from O(32) to O(5) | Leetcode POTD | DSA

14:51

Weekly contest 489 | leetcode 3842 | leetcode 3843 | leetcode 3844 | leetcode 3845 | DSA

Code With Vick

Weekly contest 489 | leetcode 3842 | leetcode 3843 | leetcode 3844 | leetcode 3845 | DSA

43:04

leetcode 67 | Add Binary | Easy | Leetcode potd | DSA

Code With Vick

leetcode 67 | Add Binary | Easy | Leetcode potd | DSA

7:14

leetcode 799 | Champagne Tower | Dynamic Programming | DSA | Leetcode POTD

Code With Vick

leetcode 799 | Champagne Tower | Dynamic Programming | DSA | Leetcode POTD

12:15

Pattern 7 - Recursion and Backtracking | DSA patterns | Explained each and everything with diagrams

Code With Vick

Pattern 7 - Recursion and Backtracking | DSA patterns | Explained each and everything with diagrams

29:37

leetcode 3714 | Longest Balanced Substring II | Prefix sum | hash map | Leetcode daily

Code With Vick

leetcode 3714 | Longest Balanced Substring II | Prefix sum | hash map | Leetcode daily

25:21

Leetcode 3714 | Longest Balanced Substring II | Medium | Prefix Count and Hash Map | Leetcode

Code With Vick

Leetcode 3714 | Longest Balanced Substring II | Medium | Prefix Count and Hash Map | Leetcode

25:21

Leetcode 3713 | Longest Balanced Substring I | Brute Force discussed | Medium | DSA

Code With Vick

Leetcode 3713 | Longest Balanced Substring I | Brute Force discussed | Medium | DSA

10:52

Leetcode 3721 Example Walkthrough with proper tree diagrams

Code With Vick

Leetcode 3721 Example Walkthrough with proper tree diagrams

22:11

leetcode 3721 | Longest Balanced Subarray II | Hard | Segment tree |Prefix Count | Begineer Friendly

Code With Vick

leetcode 3721 | Longest Balanced Subarray II | Hard | Segment tree |Prefix Count | Begineer Friendly

30:32

Leetcode 3719 | Longest Balanced Subarray I | Hash Maps | Subarrays | Begineer friendly

Code With Vick

Leetcode 3719 | Longest Balanced Subarray I | Hash Maps | Subarrays | Begineer friendly

8:04

leetcode 1382 | Balance a Binary Search Tree | Explained in detail with proper tree diagrams

Code With Vick

leetcode 1382 | Balance a Binary Search Tree | Explained in detail with proper tree diagrams

16:55

Leetcode Daily 110 - Balanced Binary Tree

Code With Vick

Leetcode Daily 110 - Balanced Binary Tree

8:15

leetcode 1653 | Minimum Deletions to Make String Balanced |

Code With Vick

leetcode 1653 | Minimum Deletions to Make String Balanced |

11:12

leetcode 3634 | Minimum Removals to Balance Array | Medium | Begineer friendly

Code With Vick

leetcode 3634 | Minimum Removals to Balance Array | Medium | Begineer friendly

11:46

leetcode 3379 | Transformed Array | Using Mod Operation | Storing Array 3 times

Code With Vick

leetcode 3379 | Transformed Array | Using Mod Operation | Storing Array 3 times

10:22

leetcode 3640 | Trionic Array II | Range based solution | Prefix sum | Hard | Begineer friendly

Code With Vick

leetcode 3640 | Trionic Array II | Range based solution | Prefix sum | Hard | Begineer friendly

25:53

leetcode 3637 | Trionic Array I | explained the cases which leads to failing | Begineer friendly

Code With Vick

leetcode 3637 | Trionic Array I | explained the cases which leads to failing | Begineer friendly

9:31

leetcode 3013 | Divide an Array Into Subarrays With Minimum Cost II | Hard | Sliding window | heaps

Code With Vick

leetcode 3013 | Divide an Array Into Subarrays With Minimum Cost II | Hard | Sliding window | heaps

37:03

leetcode 3010 | Divide an Array Into Subarrays With Minimum Cost I | Using Sorting | Using Two min

Code With Vick

leetcode 3010 | Divide an Array Into Subarrays With Minimum Cost I | Using Sorting | Using Two min

7:12

leetcode 744 | Find Smallest Letter Greater Than Target | Linear Search | Binary Search | DSA | Easy

Code With Vick

leetcode 744 | Find Smallest Letter Greater Than Target | Linear Search | Binary Search | DSA | Easy

4:06

Leetcode 2977 | Minimum Cost to Convert String II | Hard | Graph | Dynamic Programming

Code With Vick

Leetcode 2977 | Minimum Cost to Convert String II | Hard | Graph | Dynamic Programming

29:05

Leetcode 2976 | Minimum Cost to Convert String I | Medium | Dijkstra's | Floyd Warshall | Graph

Code With Vick

Leetcode 2976 | Minimum Cost to Convert String I | Medium | Dijkstra's | Floyd Warshall | Graph

9:05

Leetcode 3651 | Minimum cost path with Teleportations | Begineer friendly | hard

Code With Vick

Leetcode 3651 | Minimum cost path with Teleportations | Begineer friendly | hard

13:37

leetcode 3651 | Minimum Cost Path with Teleportations | Hard | Beginner Friendly | Must Watch

Code With Vick

leetcode 3651 | Minimum Cost Path with Teleportations | Hard | Beginner Friendly | Must Watch

17:52

Minimum Cost Path with Edge Reversals | leetcode 3650 | DSA | Medium | Dijkstra's Algorithm

Code With Vick

Minimum Cost Path with Edge Reversals | leetcode 3650 | DSA | Medium | Dijkstra's Algorithm

9:12

Minimum Absolute Difference | Leetcode 1200 | Easy | Sorting | DSA | C++

Code With Vick

Minimum Absolute Difference | Leetcode 1200 | Easy | Sorting | DSA | C++

4:23

leetcode 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | Begineer Friendly

Code With Vick

leetcode 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | Begineer Friendly

4:18

leetcode 1877 | Minimize Maximum Pair Sum in Array | Medium | begineer friendly

Code With Vick

leetcode 1877 | Minimize Maximum Pair Sum in Array | Medium | begineer friendly

4:07

leetcode 3510 | Minimum Pair Removal to Sort Array II | Hard | Leetcode | DSA | begineer friendly

Code With Vick

leetcode 3510 | Minimum Pair Removal to Sort Array II | Hard | Leetcode | DSA | begineer friendly

27:34

leetcode 3507 | Brute force appraoch discussion

Code With Vick

leetcode 3507 | Brute force appraoch discussion

4:35

Pattern 6 - Kadanes algorithm | explained why, how with an example walkthrough and code.

Code With Vick

Pattern 6 - Kadanes algorithm | explained why, how with an example walkthrough and code.

6:20

leetcode 3315 | explained why brute force fails and how to use bitwise operation

Code With Vick

leetcode 3315 | explained why brute force fails and how to use bitwise operation

7:05

Pattern 5 - Sliding Window | explained what is SW , when to use, types and mistakes to avoid

Code With Vick

Pattern 5 - Sliding Window | explained what is SW , when to use, types and mistakes to avoid

9:26

2d prefix sum | dsa patterns

Code With Vick

2d prefix sum | dsa patterns

1:02

prefix sum | when to use, how to use and where to use

Code With Vick

prefix sum | when to use, how to use and where to use

1:44

leetcode 3314 | explained brute force and bitwise method

Code With Vick

leetcode 3314 | explained brute force and bitwise method

7:13

Pattern 4 -prefix sum | 1d and 2d prefix sum, when to use , why, everything explained in this video

Code With Vick

Pattern 4 -prefix sum | 1d and 2d prefix sum, when to use , why, everything explained in this video

5:40

Leetcode 1292 | using 2D prefix sum + Binary search | explained each and everything in detail

Code With Vick

Leetcode 1292 | using 2D prefix sum + Binary search | explained each and everything in detail

13:09

leetcode 1011 | explained how to think of binary search

Code With Vick

leetcode 1011 | explained how to think of binary search

2:38

example walkthrough of Binary search | explained how we reduce the search space

Code With Vick

example walkthrough of Binary search | explained how we reduce the search space

1:12

Binary search | dsa pattern | explained why , when to use

Code With Vick

Binary search | dsa pattern | explained why , when to use

1:00

Pattern 3 - binary search| leetcode 1011 |explained with example and how to thought of Binary Search

Code With Vick

Pattern 3 - binary search| leetcode 1011 |explained with example and how to thought of Binary Search

9:32

Leetcode 1895 | Largest magic square | explained with prefix sum

Code With Vick

Leetcode 1895 | Largest magic square | explained with prefix sum

9:27

Pattern 2 - Two pointer | everything in one video

Code With Vick

Pattern 2 - Two pointer | everything in one video

4:02

leetcode 3047 | explained properly with proper intuition

Code With Vick

leetcode 3047 | explained properly with proper intuition

7:27

Pattern 1 - Frequency counting

Code With Vick

Pattern 1 - Frequency counting

3:30

leetcode 2975 | explained intuition with an example

Code With Vick

leetcode 2975 | explained intuition with an example

6:05

Leetcode 2943 | Maximize area of square hole in grid | easy explanation with example

Code With Vick

Leetcode 2943 | Maximize area of square hole in grid | easy explanation with example

3:19

Leetcode 3454 | easy explanation in c++ | code is in comments.| #dsa #leetcode

Code With Vick

Leetcode 3454 | easy explanation in c++ | code is in comments.| #dsa #leetcode

9:19

次のページ