Канал: The TryIt Project

Median of Two Sorted Arrays | LeetCode 4 | Java

Median of Two Sorted Arrays | LeetCode 4 | Java

Find the Duplicate Number | Leetcode 287 | Java

Find the Duplicate Number | Leetcode 287 | Java

The K Weakest Rows in a Matrix | Leetcode 1337 | Java

The K Weakest Rows in a Matrix | Leetcode 1337 | Java

Shortest Path Visiting All Nodes | LeetCode 847 | Java

Shortest Path Visiting All Nodes | LeetCode 847 | Java

Reconstruct Itinerary | LeetCode 332 | Java

Reconstruct Itinerary | LeetCode 332 | Java

Group the People Given the Group Size They Belong To | LeetCode 1282 | Java

Group the People Given the Group Size They Belong To | LeetCode 1282 | Java

Leetcode Mock Assessment #5

Leetcode Mock Assessment #5

Leetcode Mock Assessment #4

Leetcode Mock Assessment #4

Leetcode Mock Assessment #3

Leetcode Mock Assessment #3

Buddy Strings | LeetCode 859 | Java

Buddy Strings | LeetCode 859 | Java

Maximum Number of Achievable Transfer Requests | LeetCode 1601 | Java

Maximum Number of Achievable Transfer Requests | LeetCode 1601 | Java

Fair Distribution of Cookies | LeetCode 2305 | Java

Fair Distribution of Cookies | LeetCode 2305 | Java

Number of 1 Bits | GFG | Java

Number of 1 Bits | GFG | Java

Last Day Where You Can Still Cross | | LeetCode 1970 | Union Find Approach | Java

Last Day Where You Can Still Cross | | LeetCode 1970 | Union Find Approach | Java

Last Day Where You Can Still Cross | | LeetCode 1970 | Java

Last Day Where You Can Still Cross | | LeetCode 1970 | Java

Minimum Path Sum | | LeetCode 64 | Java

Minimum Path Sum | | LeetCode 64 | Java

Longest Cycle in a Graph | | LeetCode 2360 | Java

Longest Cycle in a Graph | | LeetCode 2360 | Java

Frogs and Jumps | GFG | Java

Frogs and Jumps | GFG | Java

Count Unreachable Pairs of Nodes in an Undirected Graph | LeetCode 2316 | Java

Count Unreachable Pairs of Nodes in an Undirected Graph | LeetCode 2316 | Java

Longest Common Subsequence | LeetCode 1143 | Java

Longest Common Subsequence | LeetCode 1143 | Java

Palindromic Substrings | LeetCode 647

Palindromic Substrings | LeetCode 647

Subtree of Another Tree | LeetCode 572 | Java

Subtree of Another Tree | LeetCode 572 | Java

Serialize and Deserialize BST | LeetCode 449 | Java

Serialize and Deserialize BST | LeetCode 449 | Java

Non overlapping Intervals | LeetCode 435 | Java

Non overlapping Intervals | LeetCode 435 | Java

Longest Repeating Character Replacement | LeetCode 424 | Java

Longest Repeating Character Replacement | LeetCode 424 | Java

Pacific Atlantic Water Flow | LeetCode 417 | Slow coding live

Pacific Atlantic Water Flow | LeetCode 417 | Slow coding live

Sum of Two Integers | LeetCode 371 | Java

Sum of Two Integers | LeetCode 371 | Java

Top K Frequent Elements | LeetCode 347 | Java

Top K Frequent Elements | LeetCode 347 | Java

Coin Change | LeetCode 322 | Java

Coin Change | LeetCode 322 | Java

Find Median from Data Stream | LeetCode 295 | Java

Find Median from Data Stream | LeetCode 295 | Java

Missing Number | LeetCode 268 | Java

Missing Number | LeetCode 268 | Java

Valid Anagram | LeetCode 242 | Java

Valid Anagram | LeetCode 242 | Java

Product of Array Except Self | LeetCode 238 | Java

Product of Array Except Self | LeetCode 238 | Java

Lowest Common Ancestor of a Binary Tree | LeetCode 236 | Java

Lowest Common Ancestor of a Binary Tree | LeetCode 236 | Java

Lowest Common Ancestor of a Binary Search Tree | LeetCode 235 | Java

Lowest Common Ancestor of a Binary Search Tree | LeetCode 235 | Java

Kth Smallest Element in a BST | LeetCode 230 | Java

Kth Smallest Element in a BST | LeetCode 230 | Java

Invert Binary Tree | LeetCode 226 | Java

Invert Binary Tree | LeetCode 226 | Java

Contains Duplicate | LeetCode 217 | Java

Contains Duplicate | LeetCode 217 | Java

House Robber II | LeetCode 213

House Robber II | LeetCode 213

Word Search II | LeetCode 212 | Java

Word Search II | LeetCode 212 | Java

Design Add and Search Words Data Structure | LeetCode 211 | Java

Design Add and Search Words Data Structure | LeetCode 211 | Java

Implement Trie Prefix Tree | LeetCode 208 | Java

Implement Trie Prefix Tree | LeetCode 208 | Java

Course Schedule | LeetCode 207 | Java

Course Schedule | LeetCode 207 | Java

Reverse Linked List | LeetCode 206 | Java

Reverse Linked List | LeetCode 206 | Java

Number of Islands | LeetCode 200 | Java

Number of Islands | LeetCode 200 | Java

House Robber | LeetCode 198 | Java

House Robber | LeetCode 198 | Java

Number of 1 Bits | LeetCode 191 | Java

Number of 1 Bits | LeetCode 191 | Java

Reverse Bits | LeetCode 190 | Java

Reverse Bits | LeetCode 190 | Java

Find Minimum in Rotated Sorted Array | LeetCode 153 | Java

Find Minimum in Rotated Sorted Array | LeetCode 153 | Java

Maximum Product Subarray | LeetCode 152 | Java

Maximum Product Subarray | LeetCode 152 | Java

Reorder List | LeetCode 143 | Java

Reorder List | LeetCode 143 | Java

Longest Increasing Subsequence | LeetCode 300

Longest Increasing Subsequence | LeetCode 300

Time Needed to Inform All Employees | LeetCode 1376 | Java

Time Needed to Inform All Employees | LeetCode 1376 | Java

Online Stock Span | LeetCode 901 | Java

Online Stock Span | LeetCode 901 | Java

Daily Temperatures | LeetCode 739 | Java

Daily Temperatures | LeetCode 739 | Java

Majority Element | Boyer Moore | LeetCode 169, 229 | Java

Majority Element | Boyer Moore | LeetCode 169, 229 | Java

Maximum Number of Weeks for Which You Can Work | LeetCode 1953 | Java

Maximum Number of Weeks for Which You Can Work | LeetCode 1953 | Java

Word Search | LeetCode 79 | Java

Word Search | LeetCode 79 | Java

Word Break | LeetCode 139 | Java

Word Break | LeetCode 139 | Java

Clone Graph | LeetCode 133 | Java

Clone Graph | LeetCode 133 | Java

Longest Consecutive Sequence | LeetCode 128 | Java

Longest Consecutive Sequence | LeetCode 128 | Java

Valid Palindrome | LeetCode 125 | Java

Valid Palindrome | LeetCode 125 | Java

Binary Tree Maximum Path Sum | LeetCode 124 | Java

Binary Tree Maximum Path Sum | LeetCode 124 | Java

Best Time to Buy and Sell Stock | LeetCode 121 | Java

Best Time to Buy and Sell Stock | LeetCode 121 | Java

Maximum Sum Circular Subarray | LeetCode 918 | Java

Maximum Sum Circular Subarray | LeetCode 918 | Java

Construct Binary Tree from Preorder and Inorder Traversal | LeetCode 105 | Java

Construct Binary Tree from Preorder and Inorder Traversal | LeetCode 105 | Java

Find the first node of loop in linked list | GFG | Java

Find the first node of loop in linked list | GFG | Java

Find the maximum GCD of the siblings of a Binary Tree | GFG | Java

Find the maximum GCD of the siblings of a Binary Tree | GFG | Java

Flip String to Monotone Increasing | LeetCode 926

Flip String to Monotone Increasing | LeetCode 926

Binary Tree Level Order Traversal | LeetCode 102 | Java

Binary Tree Level Order Traversal | LeetCode 102 | Java

Next Greater Element | GFG | Java

Next Greater Element | GFG | Java

Validate Binary Search Tree | LeetCode 98 | Java

Validate Binary Search Tree | LeetCode 98 | Java

Number of Good Paths | LeetCode 2421 | Java

Number of Good Paths | LeetCode 2421 | Java

Maximum Number of Toys | GFG | Java | Fenwick Tree

Maximum Number of Toys | GFG | Java | Fenwick Tree

Random Flip Matrix | LeetCode 519 | Java

Random Flip Matrix | LeetCode 519 | Java

Binary Indexed Tree | Fenwick Tree

Binary Indexed Tree | Fenwick Tree

Lexicographically Smallest Equivalent String | LeetCode 1061 | Java

Lexicographically Smallest Equivalent String | LeetCode 1061 | Java

Minimum Window Substring | LeetCode 76 | Java

Minimum Window Substring | LeetCode 76 | Java

Count Lucky Permutations | GFG | Java

Count Lucky Permutations | GFG | Java

Longest Path With Different Adjacent Characters | LeetCode 2246 | Java

Longest Path With Different Adjacent Characters | LeetCode 2246 | Java

Leetcode Mock Assessment #2

Leetcode Mock Assessment #2

Set Matrix Zeroes | LeetCode 73

Set Matrix Zeroes | LeetCode 73

Leetcode Mock Assessment #1

Leetcode Mock Assessment #1

Minimize the sum | GFG | Java

Minimize the sum | GFG | Java

Number of Nodes in the Sub-Tree With the Same Label | LeetCode 1519 | Java

Number of Nodes in the Sub-Tree With the Same Label | LeetCode 1519 | Java

Climbing Stairs | LeetCode 70 | Java

Climbing Stairs | LeetCode 70 | Java

Minimum Time to Collect All Apples in a Tree | LeetCode 1443 | Java

Minimum Time to Collect All Apples in a Tree | LeetCode 1443 | Java

Make array elements unique | Java

Make array elements unique | Java

Transform to Sum Tree

Transform to Sum Tree

Same Tree | LeetCode 100 | Java

Same Tree | LeetCode 100 | Java

Unique Paths | LeetCode 62

Unique Paths | LeetCode 62

Insert Interval | LeetCode 57 | Java

Insert Interval | LeetCode 57 | Java

Last modified ball

Last modified ball

Binary Tree Preorder Traversal | LeetCode 144 | Iterative Approach

Binary Tree Preorder Traversal | LeetCode 144 | Iterative Approach

Merge Intervals | LeetCode 56

Merge Intervals | LeetCode 56

Absolute difference divisible by K

Absolute difference divisible by K

Max Points on a Line | LeetCode 149 | Java

Max Points on a Line | LeetCode 149 | Java

Counting Bits | LeetCode 338 | Java

Counting Bits | LeetCode 338 | Java

Spiral Matrix | LeetCode 54 | Java

Spiral Matrix | LeetCode 54 | Java

Gas Station | LeetCode 134

Gas Station | LeetCode 134

Maximum Icecream Bars | LeetCode 1833 | Java

Maximum Icecream Bars | LeetCode 1833 | Java

Maximum Subarray | LeetCode 53

Maximum Subarray | LeetCode 53

Minimum Number of Arrows to Burst Balloons | LeetCode 452 | Java | Slow Coding Live

Minimum Number of Arrows to Burst Balloons | LeetCode 452 | Java | Slow Coding Live

Combination Sum | LeetCode 39

Combination Sum | LeetCode 39

Minimum Rounds to Complete All Tasks | LeetCode 2244

Minimum Rounds to Complete All Tasks | LeetCode 2244

Search in Rotated Sorted Array | LeetCode 33

Search in Rotated Sorted Array | LeetCode 33

Delete Columns to Make Sorted | LeetCode 944

Delete Columns to Make Sorted | LeetCode 944

Merge k Sorted Lists | LeetCode 23 | Java

Merge k Sorted Lists | LeetCode 23 | Java

Detect Capital | LeetCode 520

Detect Capital | LeetCode 520

Merge Two Sorted Lists | LeetCode 21

Merge Two Sorted Lists | LeetCode 21

Word Pattern | LeetCode 290 | Java

Word Pattern | LeetCode 290 | Java

Valid Parentheses | LeetCode 20

Valid Parentheses | LeetCode 20

Unique Paths III | LeetCode 980 | Java

Unique Paths III | LeetCode 980 | Java

Remove Nth Node From End of List | LeetCode 19

Remove Nth Node From End of List | LeetCode 19

All Paths From Source to Target | LeetCode 797

All Paths From Source to Target | LeetCode 797

3Sum | LeetCode 15

3Sum | LeetCode 15

Single-Threaded CPU | LeetCode 1834

Single-Threaded CPU | LeetCode 1834

Container With Most Water | LeetCode 11

Container With Most Water | LeetCode 11

Maximum Depth of Binary Tree | LeetCode 104

Maximum Depth of Binary Tree | LeetCode 104

Rotate Image | LeetCode 48

Rotate Image | LeetCode 48

Linked List Cycle | LeetCode 141

Linked List Cycle | LeetCode 141

Longest Palindromic Substring | LeetCode 5

Longest Palindromic Substring | LeetCode 5

Remove Stones to Minimize the Total | LeetCode 1962

Remove Stones to Minimize the Total | LeetCode 1962

Longest Substring Without Repeating Characters | LeetCode 3

Longest Substring Without Repeating Characters | LeetCode 3

Two Sum | LeetCode 1

Two Sum | LeetCode 1

Maximum Bags With Full Capacity of Rocks | LeetCode 2279

Maximum Bags With Full Capacity of Rocks | LeetCode 2279

Jump Game | LeetCode 55

Jump Game | LeetCode 55

Number of Closed Islands (Better than last time :)) | LeetCode 1254

Number of Closed Islands (Better than last time :)) | LeetCode 1254

Number of Closed Islands | LeetCode 1254 | Slow Coding Live

Number of Closed Islands | LeetCode 1254 | Slow Coding Live

Longest Subsequence With Limited Sum | LeetCode 2389

Longest Subsequence With Limited Sum | LeetCode 2389

Count Number of Homogenous Substrings | LeetCode 1759

Count Number of Homogenous Substrings | LeetCode 1759

Domino and Tromino Tiling | LeetCode 790

Domino and Tromino Tiling | LeetCode 790

Best Time to Buy and Sell Stock - All Variants

Best Time to Buy and Sell Stock - All Variants

Best Time to Buy and Sell Stock with Cooldown | LeetCode 309

Best Time to Buy and Sell Stock with Cooldown | LeetCode 309

Sum of Distances in Tree | LeetCode 834

Sum of Distances in Tree | LeetCode 834

Possible Bipartition | LeetCode 886

Possible Bipartition | LeetCode 886

Keys and Rooms | LeetCode 841

Keys and Rooms | LeetCode 841

Add Two Numbers II | LeetCode 445

Add Two Numbers II | LeetCode 445

Minimum Swaps to Make Strings Equal | LeetCode 1247

Minimum Swaps to Make Strings Equal | LeetCode 1247

Remove Covered Intervals | LeetCode 1288

Remove Covered Intervals | LeetCode 1288

Odd Even Linked List | LeetCode 328

Odd Even Linked List | LeetCode 328

Check if Every Row and Column Contains All Numbers | LeetCode 2133

Check if Every Row and Column Contains All Numbers | LeetCode 2133

Two City Scheduling | LeetCode 1029

Two City Scheduling | LeetCode 1029

The Time When the Network Becomes Idle | LeetCode 2039 | Slow Coding Live

The Time When the Network Becomes Idle | LeetCode 2039 | Slow Coding Live

Network Delay Time | LeetCode 743 | Slow Coding Live | Dijkstra’s Algorithm

Network Delay Time | LeetCode 743 | Slow Coding Live | Dijkstra’s Algorithm

Live Coding Assessment (Leetcode)

Live Coding Assessment (Leetcode)

Live Coding Assessment

Live Coding Assessment

Live Coding Assessment

Live Coding Assessment

Live Coding Assessment

Live Coding Assessment

Evaluate Reverse Polish Notation | LeetCode 150 | Slow Coding Live | Postfix Notation

Evaluate Reverse Polish Notation | LeetCode 150 | Slow Coding Live | Postfix Notation

Sort List | LeetCode 148 | Slow Coding Live

Sort List | LeetCode 148 | Slow Coding Live

Word Break | LeetCode 139 | Slow Coding Live | Trie

Word Break | LeetCode 139 | Slow Coding Live | Trie

Surrounded Regions | LeetCode 130 | Slow Coding Live

Surrounded Regions | LeetCode 130 | Slow Coding Live

Longest Consecutive Sequence | LeetCode 128 | Slow Coding Live

Longest Consecutive Sequence | LeetCode 128 | Slow Coding Live

Populating Next Right Pointers in Each Node | LeetCode 116 | Iterative Approach

Populating Next Right Pointers in Each Node | LeetCode 116 | Iterative Approach

Populating Next Right Pointers in Each Node | LeetCode 116 | Slow Coding Live

Populating Next Right Pointers in Each Node | LeetCode 116 | Slow Coding Live

Construct Binary Tree from Preorder and Inorder Traversal | Slow Coding Live

Construct Binary Tree from Preorder and Inorder Traversal | Slow Coding Live

Decode Ways | LeetCode 91 | Slow Coding Live | Bottom-Up Approach

Decode Ways | LeetCode 91 | Slow Coding Live | Bottom-Up Approach

Decode Ways | LeetCode 91 | Slow Coding Live

Decode Ways | LeetCode 91 | Slow Coding Live

Word Search | LeetCode 79

Word Search | LeetCode 79

Implement strStr() | Needle In HayStack | LeetCode 28

Implement strStr() | Needle In HayStack | LeetCode 28

Spiral Matrix | LeetCode 54 | Slow Coding Live

Spiral Matrix | LeetCode 54 | Slow Coding Live

Pow(x, n) | LeetCode 50

Pow(x, n) | LeetCode 50

Group Anagrams | LeetCode 49 | Another Approach

Group Anagrams | LeetCode 49 | Another Approach

Group Anagrams | LeetCode 49 | Live Coding

Group Anagrams | LeetCode 49 | Live Coding

Rotate Image | LeetCode 48 | Live Coding

Rotate Image | LeetCode 48 | Live Coding

Divide Two Integers | LeetCode 29

Divide Two Integers | LeetCode 29

Search Insert Position | LeetCode 35 | Slow Coding Live

Search Insert Position | LeetCode 35 | Slow Coding Live

Merge two sorted lists | LeetCode 21 | Slow Coding Live

Merge two sorted lists | LeetCode 21 | Slow Coding Live

Trying out some chess puzzles

Trying out some chess puzzles

Determine if two trees are mirror images

Determine if two trees are mirror images

Print the longest Palindromic subsequence

Print the longest Palindromic subsequence

Find the length of longest palindromic subsequence

Find the length of longest palindromic subsequence

Longest common subsequence of 3 strings

Longest common subsequence of 3 strings

Longest common subsequence - space efficient

Longest common subsequence - space efficient

Find the length of longest common subsequence - bottom up

Find the length of longest common subsequence - bottom up

Find length of longest common subsequence

Find length of longest common subsequence

Find index of 0 to replaced to get maximum length sequence of continuous ones

Find index of 0 to replaced to get maximum length sequence of continuous ones

Find maximum length sub-array having equal number of 0’s and 1’s

Find maximum length sub-array having equal number of 0’s and 1’s

Find longest sub array formed by consecutive integers

Find longest sub array formed by consecutive integers

Max difference between 2 elements in an array with constraints

Max difference between 2 elements in an array with constraints

Find largest bitonic subarray in time complexity O(n) and space complexity O(1)

Find largest bitonic subarray in time complexity O(n) and space complexity O(1)

Reverse a linked list using recursion

Reverse a linked list using recursion