Все публикации

0:19:08

Leetcode 941 - Flip Equivalent Binary Trees || Recursion

0:19:02

Leetcode 921 || Minimum Add to Make Parenthesis Valid || Stack

0:12:15

Leetcode 1518 || Water Bottles

0:19:46

Leetcode 2582 || Pass the Pillow || Two Approaches

0:29:52

Leetcode || 1052 Grumpy Bookstore Owner

0:31:59

Leetcode 1482 || Minimum Number of Days to Make m Bouquets || Two Approaches || Binary Search

0:22:18

Leetcode 945 || Minimum Increment to make array unique

0:13:13

Leetcode 2037 || Minimum Number of Moves to Seat Everyone

0:18:56

Leetcode 75 || Sort Colors

0:11:48

Leetcode 2073 || Time Needed to Buy Tickets

0:16:42

Leetcode 143 || Reorder List || Two Pointer Approach || Reverse Linked List

0:15:28

Leetcode 1669 || Merge In Between Linked Lists || Simple Intuition

0:23:14

Leetcode 238 || Product of Array Except Self || Two Approaches || Interview Follow up

0:12:13

Leetcode 2485 || Find the Pivot Integer || Two Approaches || Bruteforce || Efficient

0:19:01

Leetcode 1171 || Remove Zero Sum Consecutive Nodes from Linked List

0:11:06

Leetcode 349 || Intersection of two arrays || HashSet || Two Pointers

0:13:19

Leetcode 2540 || Minimum Common Value || 3 Approaches

0:12:46

Leetcode 3005 || Count Elements With Maximum Frequency || Two Approaches || Interview Followup

0:15:35

Leetcode 141 || Linked List Cycle || Walker and Runner Intuition

0:28:51

Leetcode 948 || Bag of Tokens || Greedy || Sorting

0:18:27

Leetcode 19 || Remove Nth Node from End of the List || Two Approaches || Interview Follow up

0:17:38

Leetcode 977 || Squares of a sorted array || Interview Follow up question || Two Pointers

0:21:57

Leetcode 513 || Find Left Tree Value || Two Approaches

0:31:26

Leetcode 543 || Diameter of a Binary Tree