LeetCode 75 Study Plan #1679 Max Number of K-Sum Pairs - Time O(n log n), Space O(n) - Swift
Andrei Dobysh
LeetCode 75 Study Plan #1679 Max Number of K-Sum Pairs - Time O(n log n), Space O(n) - Swift
34:05
LeetCode 75 Study Plan - Easy #700 Search in a Binary Search Tree - Time O(n), Space O(n) - Swift
Andrei Dobysh
LeetCode 75 Study Plan - Easy #700 Search in a Binary Search Tree - Time O(n), Space O(n) - Swift
24:56
Time O(n), Space O(1) - #Easy 205 Isomorphic Strings - Swift
Andrei Dobysh
Time O(n), Space O(1) - #Easy 205 Isomorphic Strings - Swift
55:59
LeetCode Easy 242. Valid Anagram - Time O(n), Space O(n) - Swift
Andrei Dobysh
LeetCode Easy 242. Valid Anagram - Time O(n), Space O(n) - Swift
27:49
50 Day Accomplishment Badge - 2023 Annual Badge - My first LeetCode badge #leetcode
Andrei Dobysh
50 Day Accomplishment Badge - 2023 Annual Badge - My first LeetCode badge #leetcode
0:19
LeetCode Easy 1582. Special Positions in a Binary Matrix - Time O(m * n), Space O(m) - Swift
Andrei Dobysh
LeetCode Easy 1582. Special Positions in a Binary Matrix - Time O(m * n), Space O(m) - Swift
43:50
LeetCode Easy 1903. Largest Odd Number in String - Time O(n), Space O(1) - Swift
Andrei Dobysh
LeetCode Easy 1903. Largest Odd Number in String - Time O(n), Space O(1) - Swift
13:09
LeetCode 1688. Count of Matches in Tournament, Easy - Time O(1), Space O(1) - Swift
Andrei Dobysh
LeetCode 1688. Count of Matches in Tournament, Easy - Time O(1), Space O(1) - Swift
14:26
✅ Best complexity - LeetCode Easy 2264 Largest 3-Same-Digit Number in String - Time O(n), Space O(1)
Andrei Dobysh
✅ Best complexity - LeetCode Easy 2264 Largest 3-Same-Digit Number in String - Time O(n), Space O(1)
26:24
✅ Best complexity - LeetCode Easy 1266. Minimum Time Visiting All Points - Time O(n), Space O(1)
Andrei Dobysh
✅ Best complexity - LeetCode Easy 1266. Minimum Time Visiting All Points - Time O(n), Space O(1)
9:50
✅ Best time - LeetCode Easy 1160 Find Words That Can Be Formed by Characters - Time O(n), Space O(n)
Andrei Dobysh
✅ Best time - LeetCode Easy 1160 Find Words That Can Be Formed by Characters - Time O(n), Space O(n)
25:47
✅ The best - LeetCode Easy 1662. Check If Two String Arrays are Equivalent - Time O(n), Space O(1)
Andrei Dobysh
✅ The best - LeetCode Easy 1662. Check If Two String Arrays are Equivalent - Time O(n), Space O(1)
34:25
✅ Optimized - LeetCode Easy 191. Number of 1 Bits - Time O(log n), Space O(1) - Swift
Andrei Dobysh
✅ Optimized - LeetCode Easy 191. Number of 1 Bits - Time O(log n), Space O(1) - Swift
26:54
✅ The best - LeetCode Hard 2147. Number of Ways to Divide a Long Corridor - Time O(n), Space O(1)
Andrei Dobysh
✅ The best - LeetCode Hard 2147. Number of Ways to Divide a Long Corridor - Time O(n), Space O(1)
46:59
✅ Beats 100% - LeetCode Medium 935. Knight Dialer - Time O(n), Space O(1) - Swift
Andrei Dobysh
✅ Beats 100% - LeetCode Medium 935. Knight Dialer - Time O(n), Space O(1) - Swift
2:51:14
✅ 100% - LeetCode Medium 1727. Largest Submatrix With Rearrangements - Time O(nlogn), Space O(n)
Andrei Dobysh
✅ 100% - LeetCode Medium 1727. Largest Submatrix With Rearrangements - Time O(nlogn), Space O(n)
1:12:45
✅ 100% - LeetCode Medium 1685. Sum of Absolute Differences in a Sorted Array - Time O(n), Space O(1)
Andrei Dobysh
✅ 100% - LeetCode Medium 1685. Sum of Absolute Differences in a Sorted Array - Time O(n), Space O(1)
1:25:48
LeetCode 75 Study Plan #10 Easy 283. Move Zeroes - Time O(n), Space O(1) - Swift
Andrei Dobysh
LeetCode 75 Study Plan #10 Easy 283. Move Zeroes - Time O(n), Space O(1) - Swift
25:16
LeetCode 75 Study Plan #9 Medium 443. String Compression - Time O(n), Space O(1) - Swift
Andrei Dobysh
LeetCode 75 Study Plan #9 Medium 443. String Compression - Time O(n), Space O(1) - Swift
1:26:39
LeetCode 75 Study Plan #8 Medium 334. Increasing Triplet Subsequence - Time O(n), Space O(1) - Swift
Andrei Dobysh
LeetCode 75 Study Plan #8 Medium 334. Increasing Triplet Subsequence - Time O(n), Space O(1) - Swift
5:39:34
LeetCode Medium 1561. Maximum Number of Coins You Can Get - Time O(n log n), Space O(n) - Swift
Andrei Dobysh
LeetCode Medium 1561. Maximum Number of Coins You Can Get - Time O(n log n), Space O(n) - Swift
16:23
✅ Time: Beats 100% - LeetCode Medium 1630. Arithmetic Subarrays - Time O(n²), Space O(n) - Swift
Andrei Dobysh
✅ Time: Beats 100% - LeetCode Medium 1630. Arithmetic Subarrays - Time O(n²), Space O(n) - Swift
1:57:48
LeetCode Medium - 1424. Diagonal Traverse II - Time O(n²), Space O(1)
Andrei Dobysh
LeetCode Medium - 1424. Diagonal Traverse II - Time O(n²), Space O(1)
1:26:48
✅ Beats 100% - LeetCode Medium - 1814. Count Nice Pairs in an Array - Time O(n log n), Space O(n)
Andrei Dobysh
✅ Beats 100% - LeetCode Medium - 1814. Count Nice Pairs in an Array - Time O(n log n), Space O(n)
4:05:52
✅ 100% | LeetCode Medium | #2391. Minimum Amount of Time to Collect Garbage | Time O(n), Space O(1)
Andrei Dobysh
✅ 100% | LeetCode Medium | #2391. Minimum Amount of Time to Collect Garbage | Time O(n), Space O(1)
23:55
✅ 100% | LeetCode Medium | 1887. Reduction Operations to Make the Array Elements Equal O(nlogn)/O(n)
Andrei Dobysh
✅ 100% | LeetCode Medium | 1887. Reduction Operations to Make the Array Elements Equal O(nlogn)/O(n)
28:28
LeetCode Easy | #2932. Maximum Strong Pair XOR I | Time O(n²), Space O(1)
Andrei Dobysh
LeetCode Easy | #2932. Maximum Strong Pair XOR I | Time O(n²), Space O(1)
9:07
LeetCode Medium | #1838. Frequency of the Most Frequent Element | Time O(n²), Space O(n)
Andrei Dobysh
LeetCode Medium | #1838. Frequency of the Most Frequent Element | Time O(n²), Space O(n)
1:26:01
LeetCode Medium | #1877. Minimize Maximum Pair Sum in Array | Time O(n log n), Space O(n)
Andrei Dobysh
LeetCode Medium | #1877. Minimize Maximum Pair Sum in Array | Time O(n log n), Space O(n)
22:31
LeetCode Medium | #1980. Find Unique Binary String | Time O(n), Space O(n)
Andrei Dobysh
LeetCode Medium | #1980. Find Unique Binary String | Time O(n), Space O(n)
1:37:35
✅ 100% | LeetCode Medium | 1846 Maximum Element After Decreasing and Rearranging | tO(n log n) sO(n)
Andrei Dobysh
✅ 100% | LeetCode Medium | 1846 Maximum Element After Decreasing and Rearranging | tO(n log n) sO(n)
15:17
LeetCode Medium | #1930. Unique Length-3 Palindromic Subsequences | Time O(n), Space O(1)
Andrei Dobysh
LeetCode Medium | #1930. Unique Length-3 Palindromic Subsequences | Time O(n), Space O(1)
1:07:45
LeetCode Easy | #704. Binary Search | Time O(log n), Space O(1)
Andrei Dobysh
LeetCode Easy | #704. Binary Search | Time O(log n), Space O(1)
45:42
LeetCode Easy | #206. Reverse Linked List | Time O(n), Space O(1)
Andrei Dobysh
LeetCode Easy | #206. Reverse Linked List | Time O(n), Space O(1)
58:33
LeetCode Medium | #2. Add Two Numbers | Time O(n), Space O(n)
Andrei Dobysh
LeetCode Medium | #2. Add Two Numbers | Time O(n), Space O(n)
23:39
✅ Space: Beats 100% | LeetCode Easy | #141. Linked List Cycle | Time O(n), Space O(1)
Andrei Dobysh
✅ Space: Beats 100% | LeetCode Easy | #141. Linked List Cycle | Time O(n), Space O(1)
40:49
🥲 Time: Beats 5% | LeetCode Easy | #141. Linked List Cycle | Time O(n²), Space O(n)
Andrei Dobysh
🥲 Time: Beats 5% | LeetCode Easy | #141. Linked List Cycle | Time O(n²), Space O(n)
52:14
✅ Time: Beats 100% | LeetCode Medium | #2785. Sort Vowels in a String | Time O(n), Space O(n)
Andrei Dobysh
✅ Time: Beats 100% | LeetCode Medium | #2785. Sort Vowels in a String | Time O(n), Space O(n)
1:54:27
❓Beats 100% | LeetCode Medium | 1743. Restore the Array From Adjacent Pairs | Time O(n²), Space O(n)
Andrei Dobysh
❓Beats 100% | LeetCode Medium | 1743. Restore the Array From Adjacent Pairs | Time O(n²), Space O(n)
48:59
✅ Beats 100% | LeetCode Medium | #1759. Count Number of Homogenous Substrings | Time O(n), Space (1)
Andrei Dobysh
✅ Beats 100% | LeetCode Medium | #1759. Count Number of Homogenous Substrings | Time O(n), Space (1)
1:00:59
LeetCode Medium | #2849. Determine if a Cell Is Reachable at a Given Time | Time O(1), Space O(1)
Andrei Dobysh
LeetCode Medium | #2849. Determine if a Cell Is Reachable at a Given Time | Time O(1), Space O(1)
29:19
✅ Beats 100% | LeetCode Medium | 1921. Eliminate Maximum Number of Monsters | O(n log n), Space O(n)
Andrei Dobysh
✅ Beats 100% | LeetCode Medium | 1921. Eliminate Maximum Number of Monsters | O(n log n), Space O(n)
1:43:47
LeetCode Medium | #1845. Seat Reservation Manager | Time O(n), Space O(1)
Andrei Dobysh
LeetCode Medium | #1845. Seat Reservation Manager | Time O(n), Space O(1)
18:42
✅ Beats 100% | LeetCode Medium | #1535. Find the Winner of an Array Game
Andrei Dobysh
✅ Beats 100% | LeetCode Medium | #1535. Find the Winner of an Array Game
20:23
LeetCode 75 Plan #7 Medium | #238. Product of Array Except Self
Andrei Dobysh
LeetCode 75 Plan #7 Medium | #238. Product of Array Except Self
1:10:32
✅ Beats 100% | LeetCode Medium | #1503. Last Moment Before All Ants Fall Out of a Plank
Andrei Dobysh
✅ Beats 100% | LeetCode Medium | #1503. Last Moment Before All Ants Fall Out of a Plank
4:01:43
LeetCode Medium | #1441. Build an Array With Stack Operations
Andrei Dobysh
LeetCode Medium | #1441. Build an Array With Stack Operations
11:38
LeetCode Medium | #2265. Count Nodes Equal to Average of Subtree
Andrei Dobysh
LeetCode Medium | #2265. Count Nodes Equal to Average of Subtree
54:51
LeetCode 75 Plan #6 Medium | #151. Reverse Words in a String | Time O(n), Space O(n)
Andrei Dobysh
LeetCode 75 Plan #6 Medium | #151. Reverse Words in a String | Time O(n), Space O(n)
38:16
LeetCode Easy | #501. Find Mode in Binary Search Tree | Time O(n), Space O(1)
Andrei Dobysh
LeetCode Easy | #501. Find Mode in Binary Search Tree | Time O(n), Space O(1)
47:25
LeetCode Medium | #2433. Find The Original Array of Prefix Xor | Time O(n), Space O(1)
Andrei Dobysh
LeetCode Medium | #2433. Find The Original Array of Prefix Xor | Time O(n), Space O(1)
42:18
LeetCode Easy | #1356. Sort Integers by The Number of 1 Bits | Time O(n log n), Space O(1)
Andrei Dobysh
LeetCode Easy | #1356. Sort Integers by The Number of 1 Bits | Time O(n log n), Space O(1)
1:10:14
LeetCode 75 Plan #5 Easy | #345. Reverse Vowels of a String | Time O(n), Space O(1)
Andrei Dobysh
LeetCode 75 Plan #5 Easy | #345. Reverse Vowels of a String | Time O(n), Space O(1)
57:02
LeetCode 75 Plan #4 Easy | #605. Can Place Flowers | Time O(n), Space O(1)
Andrei Dobysh
LeetCode 75 Plan #4 Easy | #605. Can Place Flowers | Time O(n), Space O(1)
46:56
LeetCode 3/75 Easy | #1431. Kids With the Greatest Number of Candies | Time O(n), Space O(1)
Andrei Dobysh
LeetCode 3/75 Easy | #1431. Kids With the Greatest Number of Candies | Time O(n), Space O(1)
10:00
100% real challenge to get a job | Codility_
Andrei Dobysh
100% real challenge to get a job | Codility_
1:11:50
LeetCode Easy | #66. Plus One
Andrei Dobysh
LeetCode Easy | #66. Plus One
17:43
LeetCode 2/75 Easy | #1071. Greatest Common Divisor of Strings | Time O(n log n), Space O(n log n)
Andrei Dobysh
LeetCode 2/75 Easy | #1071. Greatest Common Divisor of Strings | Time O(n log n), Space O(n log n)
2:43:04
LeetCode 1/75 Easy | #1768. Merge Strings Alternately | Time O(n), Space O(n)
Andrei Dobysh
LeetCode 1/75 Easy | #1768. Merge Strings Alternately | Time O(n), Space O(n)
31:31
LeetCode Easy | 706. Design HashSet | Time O(log n) & O(n), Space O(1)
Andrei Dobysh
LeetCode Easy | 706. Design HashSet | Time O(log n) & O(n), Space O(1)
1:04:00
LeetCode Easy | 58. Length of Last Word 2/2
Andrei Dobysh
LeetCode Easy | 58. Length of Last Word 2/2
10:31
LeetCode Easy | 58. Length of Last Word 1/2
Andrei Dobysh
LeetCode Easy | 58. Length of Last Word 1/2
25:47
LeetCode Easy | 35. Search Insert Position
Andrei Dobysh
LeetCode Easy | 35. Search Insert Position
37:55
LeetCode Easy | 27. Remove Element
Andrei Dobysh
LeetCode Easy | 27. Remove Element
12:30
LeetCode Easy | 26. Remove Duplicates from Sorted Array
Andrei Dobysh
LeetCode Easy | 26. Remove Duplicates from Sorted Array
1:22:01
LeetCode Medium | 134. Gas Station | 2/2
Andrei Dobysh
LeetCode Medium | 134. Gas Station | 2/2
1:50:31
LeetCode Medium | 134. Gas Station | 1/2
Andrei Dobysh
LeetCode Medium | 134. Gas Station | 1/2
13:03