funatcoding

LeetCode 1784 | Check if Binary String Has at Most One Segment of Ones | Day 65/365 | C++

funatcoding

LeetCode 1784 | Check if Binary String Has at Most One Segment of Ones | Day 65/365 | C++

2:43

LeetCode 1758 | Minimum Changes To Make Alternating Binary String | Daily LetCode | Day 64/365 | C++

funatcoding

LeetCode 1758 | Minimum Changes To Make Alternating Binary String | Daily LetCode | Day 64/365 | C++

6:33

LeetCode 1582 | Special Positions in a Binary Matrix | Daily LeetCode | Day 63/365 | C++

funatcoding

LeetCode 1582 | Special Positions in a Binary Matrix | Daily LeetCode | Day 63/365 | C++

8:08

LeetCode 1536 | Minimum Swaps to Arrange a Binary Grid | Daily LeetCode | Day 61/365 | C++ Solution

funatcoding

LeetCode 1536 | Minimum Swaps to Arrange a Binary Grid | Daily LeetCode | Day 61/365 | C++ Solution

9:40

LeetCode 1689 | Partitioning Into Minimum Number of Deci-Binary Numbers | Day 60/365 | C++

funatcoding

LeetCode 1689 | Partitioning Into Minimum Number of Deci-Binary Numbers | Day 60/365 | C++

5:29

LeetCode 1680 | Concatenation of Consecutive Binary Numbers | Daily LeetCode | Day 58/365 | C++

funatcoding

LeetCode 1680 | Concatenation of Consecutive Binary Numbers | Daily LeetCode | Day 58/365 | C++

5:31

LeetCode 1404 | Number of Steps to Reduce a Number in Binary Representation to 1 | Day 57/365 | C++

funatcoding

LeetCode 1404 | Number of Steps to Reduce a Number in Binary Representation to 1 | Day 57/365 | C++

15:13

LeetCode 1356 | Sort Integers by The Number of 1 Bits | Daily LeetCode | Day 56/365 | C++

funatcoding

LeetCode 1356 | Sort Integers by The Number of 1 Bits | Daily LeetCode | Day 56/365 | C++

5:58

LeetCode 1022 | Sum of Root To Leaf Binary Numbers | Daily LeetCode | Day 55/365 | DFS | C++

funatcoding

LeetCode 1022 | Sum of Root To Leaf Binary Numbers | Daily LeetCode | Day 55/365 | DFS | C++

5:06

LeetCode 1461 | Check If a String Contains All Binary Codes of Size K | Daily LeetCode | Day 54/365

funatcoding

LeetCode 1461 | Check If a String Contains All Binary Codes of Size K | Daily LeetCode | Day 54/365

7:11

LeetCode 868 | Binary Gap | Daily LeetCode | Day 53/365 | Bit Manipulation | C++ Solution

funatcoding

LeetCode 868 | Binary Gap | Daily LeetCode | Day 53/365 | Bit Manipulation | C++ Solution

4:00

LeetCode 762 | Prime Number of Set Bits in Binary Representation | Daily LeetCode | Day 52/365 | C++

funatcoding

LeetCode 762 | Prime Number of Set Bits in Binary Representation | Daily LeetCode | Day 52/365 | C++

5:35

LeetCode 761 | Special Binary String | Daily LeetCode | Day 51/365 | Greedy + Recursion | C++

funatcoding

LeetCode 761 | Special Binary String | Daily LeetCode | Day 51/365 | Greedy + Recursion | C++

12:46

LeetCode 696 | Count Binary Substrings | Daily LeetCode | Day 50/365 | Group Counting Trick | C++

funatcoding

LeetCode 696 | Count Binary Substrings | Daily LeetCode | Day 50/365 | Group Counting Trick | C++

4:21

LeetCode 693 | Binary Number with Alternating Bits | Daily LeetCode | Day 49/365 | C++

funatcoding

LeetCode 693 | Binary Number with Alternating Bits | Daily LeetCode | Day 49/365 | C++

5:06

LeetCode 401 | Binary Watch | Daily LeetCode | Day 48/365 | Backtracking / Bit Manipulation | C++

funatcoding

LeetCode 401 | Binary Watch | Daily LeetCode | Day 48/365 | Backtracking / Bit Manipulation | C++

8:46

LeetCode 190 | Reverse Bits | Daily LeetCode | Day 47/365 | Bit Manipulation | C++ Solution

funatcoding

LeetCode 190 | Reverse Bits | Daily LeetCode | Day 47/365 | Bit Manipulation | C++ Solution

4:54

LeetCode 67 | Add Binary | Daily LeetCode | Day 46/365 | String Simulation | C++ Solution

funatcoding

LeetCode 67 | Add Binary | Daily LeetCode | Day 46/365 | String Simulation | C++ Solution

6:44

LeetCode 799 | Champagne Tower | Daily LeetCode | Day 45/365 | Simulation + DP | C++ Solution

funatcoding

LeetCode 799 | Champagne Tower | Daily LeetCode | Day 45/365 | Simulation + DP | C++ Solution

8:26

funatcoding Live Stream

funatcoding

funatcoding Live Stream

LeetCode 3714 | Longest Balanced Substring II | Daily LeetCode | Day 44/365 | C++ Solution

funatcoding

LeetCode 3714 | Longest Balanced Substring II | Daily LeetCode | Day 44/365 | C++ Solution

12:24

LeetCode 3713 | Longest Balanced Substring I | Daily LeetCode | Day 43/365 | C++ Solution

funatcoding

LeetCode 3713 | Longest Balanced Substring I | Daily LeetCode | Day 43/365 | C++ Solution

9:30

LeetCode 3719 | Longest Balanced Subarray I | Daily LeetCode | Day 41/365 | C++ Solution

funatcoding

LeetCode 3719 | Longest Balanced Subarray I | Daily LeetCode | Day 41/365 | C++ Solution

4:55

LeetCode 1382 | Balance a Binary Search Tree | Daily LeetCode | Day 40/365 | Inorder + Rebuild | C++

funatcoding

LeetCode 1382 | Balance a Binary Search Tree | Daily LeetCode | Day 40/365 | Inorder + Rebuild | C++

8:46

LeetCode 110 | Balanced Binary Tree | Daily LeetCode | Day 39/365 | DFS + Height Optimization | C++

funatcoding

LeetCode 110 | Balanced Binary Tree | Daily LeetCode | Day 39/365 | DFS + Height Optimization | C++

4:59

LeetCode 1653 | Minimum Deletions to Make String Balanced | Daily LeetCode | Day 38/365

funatcoding

LeetCode 1653 | Minimum Deletions to Make String Balanced | Daily LeetCode | Day 38/365

7:15

LeetCode 3634 | Minimum Removals to Balance Array | Daily LeetCode | Day 37/365 | C++ Solution

funatcoding

LeetCode 3634 | Minimum Removals to Balance Array | Daily LeetCode | Day 37/365 | C++ Solution

5:44

LeetCode 3379 | Transformed Array | Daily LeetCode | Day 36/365 | Modular Arithmetic | C++ Solution

funatcoding

LeetCode 3379 | Transformed Array | Daily LeetCode | Day 36/365 | Modular Arithmetic | C++ Solution

4:00

LeetCode 3640 | Trionic Array II | Daily LeetCode | Day 35/365 | DP + Prefix Optimization

funatcoding

LeetCode 3640 | Trionic Array II | Daily LeetCode | Day 35/365 | DP + Prefix Optimization

9:57

LeetCode 3637 | Trionic Array I | Daily LeetCode | Day 34/365 | Arrays | C++ Solution

funatcoding

LeetCode 3637 | Trionic Array I | Daily LeetCode | Day 34/365 | Arrays | C++ Solution

6:12

LeetCode 3013 | Divide an Array Into Subarrays With Minimum Cost II | Daily LeetCode | Day 33/365

funatcoding

LeetCode 3013 | Divide an Array Into Subarrays With Minimum Cost II | Daily LeetCode | Day 33/365

19:32

LeetCode 3010 | Divide an Array Into Subarrays With Minimum Cost I | Daily LeetCode | Day 32/365

funatcoding

LeetCode 3010 | Divide an Array Into Subarrays With Minimum Cost I | Daily LeetCode | Day 32/365

5:00

LeetCode 744 | Find Smallest Letter Greater than Target | Daily LeetCode | Day 31/365 | C++ Solution

funatcoding

LeetCode 744 | Find Smallest Letter Greater than Target | Daily LeetCode | Day 31/365 | C++ Solution

2:54

LeetCode 2977 | Minimum Cost to Convert String II | Daily LeetCode | Day 30/365

funatcoding

LeetCode 2977 | Minimum Cost to Convert String II | Daily LeetCode | Day 30/365

19:56

LeetCode 2976 | Minimum Cost to Convert String I | Daily LeetCode | Day 29/365

funatcoding

LeetCode 2976 | Minimum Cost to Convert String I | Daily LeetCode | Day 29/365

13:39

LeetCode 3651 | Minimum Cost Path with Teleportations | Daily LeetCode | Day 28/365 |

funatcoding

LeetCode 3651 | Minimum Cost Path with Teleportations | Daily LeetCode | Day 28/365 |

17:59

LeetCode 3650 | Minimum Cost Path with Edge Reversals | Daily LeetCode | Day 27/365

funatcoding

LeetCode 3650 | Minimum Cost Path with Edge Reversals | Daily LeetCode | Day 27/365

5:08

LeetCode 1200 | Minimum Absolute Difference | Daily LeetCode | Day 26/365

funatcoding

LeetCode 1200 | Minimum Absolute Difference | Daily LeetCode | Day 26/365

3:59

LeetCode 1984 | Minimum Difference Between Highest and Lowest of K Scores | Day 25/365

funatcoding

LeetCode 1984 | Minimum Difference Between Highest and Lowest of K Scores | Day 25/365

4:56

LeetCode 1877 | Minimize Maximum Pair Sum in Array | Daily LeetCode | Day 24/365

funatcoding

LeetCode 1877 | Minimize Maximum Pair Sum in Array | Daily LeetCode | Day 24/365

3:40

LeetCode 3510 | Minimum Pair Removal to Sort Array II | Daily LeetCode | Day 23/365

funatcoding

LeetCode 3510 | Minimum Pair Removal to Sort Array II | Daily LeetCode | Day 23/365

27:17

LeetCode 3507 | Minimum Pair Removal to Sort Array I | Daily LeetCode | Day 22/365

funatcoding

LeetCode 3507 | Minimum Pair Removal to Sort Array I | Daily LeetCode | Day 22/365

7:22

LeetCode 3315 | Construct the Minimum Bitwise Array II | Daily LeetCode | Day 21/365

funatcoding

LeetCode 3315 | Construct the Minimum Bitwise Array II | Daily LeetCode | Day 21/365

5:39

Leetcode 3314| Construct the Minimum Bitwise Array I | Day 20/365

funatcoding

Leetcode 3314| Construct the Minimum Bitwise Array I | Day 20/365

4:51

Leetcode 1292 | Maximum Side length of a square with sum less than equal to threshold | Day 19/365

funatcoding

Leetcode 1292 | Maximum Side length of a square with sum less than equal to threshold | Day 19/365

13:22

Leetcode 1895 | Largest Magic Square | Day 18/365

funatcoding

Leetcode 1895 | Largest Magic Square | Day 18/365

19:10

Leetcode 3047 | Find the largest Area of Square Hole Inside Two Rectangles | Day 17/365

funatcoding

Leetcode 3047 | Find the largest Area of Square Hole Inside Two Rectangles | Day 17/365

8:22

Leetcode 2975 | Maximum Square Area by Removing Fence From a Field | Day 16/365

funatcoding

Leetcode 2975 | Maximum Square Area by Removing Fence From a Field | Day 16/365

7:28

Leetcode 2943 | Maximum Area of Square Hole in Grid | Day 15/365

funatcoding

Leetcode 2943 | Maximum Area of Square Hole in Grid | Day 15/365

7:04

Leetcode 3454 | Separate Squares II | Day 14/365

funatcoding

Leetcode 3454 | Separate Squares II | Day 14/365

8:09

Leetcode 3453 | Separate Squares 1 | Day 13/365

funatcoding

Leetcode 3453 | Separate Squares 1 | Day 13/365

8:05

Leetcode 1266 | Minimum Time Visiting All Points | Day 12/365

funatcoding

Leetcode 1266 | Minimum Time Visiting All Points | Day 12/365

3:33

Leetcode 85 | Maximal Rectangle | Day 11/365

funatcoding

Leetcode 85 | Maximal Rectangle | Day 11/365

8:47

Leetcode 712 | Minimum ASCII Delete sum for two Strings | Day 10/365

funatcoding

Leetcode 712 | Minimum ASCII Delete sum for two Strings | Day 10/365

7:06

Leetcode 865 | Smallest Subtree with all the deepest nodes | Day 9/365

funatcoding

Leetcode 865 | Smallest Subtree with all the deepest nodes | Day 9/365

10:28

Leetcode 1458 | Max Dot Product of Two Subsequences | Day 8/365

funatcoding

Leetcode 1458 | Max Dot Product of Two Subsequences | Day 8/365

8:30

Leetcode 1339 | Maximum Product of Splitted Binary Tree | Day 7/365

funatcoding

Leetcode 1339 | Maximum Product of Splitted Binary Tree | Day 7/365

6:48

Leetcode 1161 | Maximum level Sum of a binary tree | Daily leetcode problem

funatcoding

Leetcode 1161 | Maximum level Sum of a binary tree | Daily leetcode problem

12:02

Leetcode 1975 | Maximum Matrix Sum | Day 5/365

funatcoding

Leetcode 1975 | Maximum Matrix Sum | Day 5/365

6:53

Leetcode 1390 | Four Divisors | Simplest Approach | funatcoding

funatcoding

Leetcode 1390 | Four Divisors | Simplest Approach | funatcoding

5:48

Leetcode 1411 | Number of ways to Paint N x 3 Grid | DP solution | funatcoding

funatcoding

Leetcode 1411 | Number of ways to Paint N x 3 Grid | DP solution | funatcoding

10:27

Leetcode 961 | Problem N-Repeated Elements in Size 2N Array | Pigeonhole principle

funatcoding

Leetcode 961 | Problem N-Repeated Elements in Size 2N Array | Pigeonhole principle

5:03

Leetcode 66 | Plus One | C++

funatcoding

Leetcode 66 | Plus One | C++

7:08

Leetcode 840 Magic Squares In Grid | Simple mathematical approach | funatcoding

funatcoding

Leetcode 840 Magic Squares In Grid | Simple mathematical approach | funatcoding

21:29

次のページ