✅ |
1 |
Two Sum |
Solution.swift |
💚 Easy |
✅ |
2 |
Add Two Numbers |
Solution.swift |
💛 Medium |
✅ |
3 |
Longest Substring Without Repeating Characters |
Solution.swift |
💛 Medium |
|
4 |
Median of Two Sorted Arrays |
|
❤️ Hard |
✅ |
5 |
Longest Palindromic Substring |
Solution.swift |
💛 Medium |
✅ |
6 |
ZigZag Conversion |
Solution.swift |
💛 Medium |
✅ |
7 |
Reverse Integer |
Solution.swift |
💚 Easy |
|
8 |
String to Integer (atoi) |
|
💛 Medium |
✅ |
9 |
Palindrome Number |
Solution.swift |
💚 Easy |
|
10 |
Regular Expression Matching |
|
❤️ Hard |
✅ |
11 |
Container With Most Water |
Solution.swift |
💛 Medium |
✅ |
12 |
Integer to Roman |
Solution.swift |
💛 Medium |
✅ |
13 |
Roman to Integer |
Solution.swift |
💚 Easy |
✅ |
14 |
Longest Common Prefix |
Solution.swift |
💚 Easy |
✅ |
15 |
3Sum |
Solution.swift |
💛 Medium |
✅ |
16 |
3Sum Closest |
Solution.swift |
💛 Medium |
✅ |
17 |
Letter Combinations of a Phone Number |
Solution.swift |
💛 Medium |
|
18 |
4Sum |
|
💛 Medium |
✅ |
19 |
Remove Nth Node From End of List |
Solution.swift |
💛 Medium |
✅ |
20 |
Valid Parentheses |
Solution.swift |
💚 Easy |
✅ |
21 |
Merge Two Sorted Lists |
Solution.swift |
💚 Easy |
✅ |
22 |
Generate Parentheses |
Solution.swift |
💛 Medium |
✅ |
23 |
Merge k Sorted Lists |
Solution.swift |
❤️ Hard |
✅ |
24 |
Swap Nodes in Pairs |
Solution.swift |
💛 Medium |
|
25 |
Reverse Nodes in k-Group |
|
❤️ Hard |
✅ |
26 |
Remove Duplicates from Sorted Array |
Solution.swift |
💚 Easy |
✅ |
27 |
Remove Element |
Solution.swift |
💚 Easy |
|
28 |
Implement strStr() |
|
💚 Easy |
|
29 |
Divide Two Integers |
|
💛 Medium |
|
30 |
Substring with Concatenation of All Words |
|
❤️ Hard |
✅ |
31 |
Next Permutation |
Solution.swift |
💛 Medium |
|
32 |
Longest Valid Parentheses |
|
❤️ Hard |
✅ |
33 |
Search in Rotated Sorted Array |
Solution.swift |
💛 Medium |
|
34 |
Find First and Last Position of Element in Sorted Array |
|
💛 Medium |
✅ |
35 |
Search Insert Position |
Solution.swift |
💚 Easy |
|
36 |
Valid Sudoku |
|
💛 Medium |
✅ |
39 |
Combination Sum |
Solution.swift |
💛 Medium |
✅ |
41 |
First Missing Positive |
Solution.swift |
❤️ Hard |
✅ |
47 |
Permutations II |
Solution.swift |
💛 Medium |
✅ |
50 |
Pow(x, n) |
Solution.swift.swift) |
💛 Medium |
✅ |
55 |
Jump Game |
Solution.swift |
💛 Medium |
✅ |
56 |
Merge Intervals |
Solution.swift |
💛 Medium |
✅ |
57 |
Insert Interval |
Solution.swift |
❤️ Hard |
✅ |
58 |
Length of Last Word |
Solution.swift |
💚 Easy |
✅ |
59 |
Spiral Matrix II |
Solution.swift |
💛 Medium |
✅ |
61 |
Rotate List |
Solution.swift |
💛 Medium |
✅ |
62 |
Unique Paths |
Solution.swift |
💛 Medium |
✅ |
64 |
Minimum Path Sum |
Solution.swift |
💛 Medium |
✅ |
66 |
Plus One |
Solution.swift |
💚 Easy |
✅ |
67 |
Add Binary |
Solution.swift |
💚 Easy |
✅ |
70 |
Climbing Stairs |
Solution.swift |
💚 Easy |
✅ |
71 |
Simplify Path |
Solution.swift |
💛 Medium |
✅ |
74 |
Search a 2D Matrix |
Solution.swift |
💛 Medium |
✅ |
75 |
Sort Colors |
Solution.swift |
💛 Medium |
✅ |
79 |
Word Search |
Solution.swift |
💛 Medium |
✅ |
80 |
Remove Duplicates from Sorted Array II |
Solution.swift |
💛 Medium |
✅ |
81 |
Search in Rotated Sorted Array II |
Solution.swift |
💛 Medium |
✅ |
82 |
Remove Duplicates from Sorted List II |
Solution.swift |
💛 Medium |
✅ |
83 |
Remove Duplicates from Sorted List |
Solution.swift |
💚 Easy |
✅ |
84 |
Largest Rectangle in Histogram |
Solution.swift |
❤️ Hard |
✅ |
88 |
Merge Sorted Array |
Solution.swift |
💚 Easy |
✅ |
91 |
Decode Ways |
Solution.swift |
💛 Medium |
✅ |
94 |
Binary Tree Inorder Traversal |
Solution.swift |
💛 Medium |
✅ |
98 |
Validate Binary Search Tree |
Solution.swift |
💛 Medium |
✅ |
99 |
Recover Binary Search Tree |
Solution.swift |
❤️ Hard |
|
✅ |
100 |
Same Tree |
Solution.swift |
💚 Easy |
✅ |
101 |
Symmetric Tree |
Solution.swift |
💚 Easy |
✅ |
103 |
Binary Tree Zigzag Level Order Traversal |
Solution.swift |
💛 Medium |
✅ |
104 |
Maximum Depth of Binary Tree |
Solution.swift |
💚 Easy |
✅ |
107 |
Binary Tree Level Order Traversal II |
Solution.swift |
💚 Easy |
✅ |
108 |
Convert Sorted Array to Binary Search Tree |
Solution.swift |
💚 Easy |
✅ |
110 |
Balanced Binary Tree |
Solution.swift |
💚 Easy |
✅ |
111 |
Minimum Depth of Binary Tree |
Solution.swift |
💚 Easy |
✅ |
116 |
Populating Next Right Pointers in Each Node |
Solution.swift |
💛 Medium |
✅ |
117 |
Populating Next Right Pointers in Each Node II |
Solution.swift |
💛 Medium |
✅ |
118 |
Pascal’s Triangle |
Solution.swift |
💚 Easy |
✅ |
119 |
Pascal’s Triangle II |
Solution.swift |
💚 Easy |
✅ |
121 |
Best Time to Buy and Sell Stock |
Solution.swift |
💚 Easy |
✅ |
122 |
Best Time to Buy and Sell Stock II |
Solution.swift |
💚 Easy |
✅ |
123 |
Best Time to Buy and Sell Stock III |
Solution.swift |
❤️ Hard |
✅ |
124 |
Binary Tree Maximum Path Sum |
Solution.swift |
❤️ Hard |
✅ |
125 |
Valid Palindrome |
Solution.swift |
💚 Easy |
✅ |
129 |
Sum Root to Leaf Numbers |
Solution.swift |
💛 Medium |
✅ |
131 |
Palindrome Partitioning |
Solution.swift |
💛 Medium |
✅ |
133 |
Clone Graph |
Solution.swift |
💛 Medium |
✅ |
134 |
Gas Station |
Solution.swift |
💛 Medium |
✅ |
136 |
Single Number |
Solution.swift |
💚 Easy |
✅ |
138 |
Copy List with Random Pointer |
Solution.swift |
💛 Medium |
✅ |
139 |
Word Break |
Solution.swift |
💛 Medium |
✅ |
140 |
Word Break II |
Solution.swift |
❤️ Hard |
✅ |
141 |
Linked List Cycle |
Solution.swift |
💚 Easy |
✅ |
142 |
Linked List Cycle II |
Solution.swift |
💛 Medium |
✅ |
143 |
Reorder List |
Solution.swift |
💛 Medium |
✅ |
147 |
Insertion Sort List |
Solution.swift |
💛 Medium |
✅ |
148 |
Sort List |
Solution.swift |
💛 Medium |
✅ |
150 |
Evaluate Reverse Polish Notation |
Solution.swift |
💛 Medium |
✅ |
151 |
Reverse Words in a String |
Solution.swift |
💛 Medium |
✅ |
152 |
Maximum Product Subarray |
Solution.swift |
💛 Medium |
✅ |
154 |
Find Minimum in Rotated Sorted Array II |
Solution.swift |
❤️ Hard |
✅ |
155 |
Min Stack |
Solution.swift |
💚 Easy |
✅ |
156 |
Binary Tree Upside Down 🔐 |
Solution.swift |
💛 Medium |
✅ |
157 |
Read N Characters Given Read4 🔐 |
Solution.swift |
💚 Easy |
✅ |
159 |
Longest Substring with At Most Two Distinct Characters 🔐 |
Solution.swift |
💛 Medium |
✅ |
160 |
Intersection of Two Linked Lists |
Solution.swift |
💚 Easy |
✅ |
161 |
One Edit Distance 🔐 |
Solution.swift |
💛 Medium |
✅ |
163 |
Missing Ranges 🔐 |
Solution.swift |
💚 Easy |
✅ |
165 |
Compare Version Numbers |
Solution.swift |
💛 Medium |
✅ |
167 |
Two Sum II - Input array is sorted |
Solution.swift |
💚 Easy |
✅ |
169 |
Majority Element |
Solution.swift |
💚 Easy |
✅ |
170 |
Two Sum III - Data structure design 🔐 |
Solution.swift |
💚 Easy |
✅ |
171 |
Excel Sheet Column Number |
Solution.swift |
💚 Easy |
✅ |
173 |
Binary Search Tree Iterator |
Solution.swift |
💛 Medium |
✅ |
174 |
Dungeon Game |
Solution.swift |
❤️ Hard |
✅ |
179 |
Largest Number |
Solution.swift |
💛 Medium |
✅ |
186 |
Reverse Words in a String II 🔐 |
Solution.swift |
💛 Medium |
✅ |
187 |
Repeated DNA Sequences |
Solution.swift |
💛 Medium |
✅ |
188 |
Best Time to Buy and Sell Stock IV |
Solution.swift |
❤️ Hard |
✅ |
189 |
Rotate Array |
Solution.swift |
💛 Medium |
✅ |
191 |
Number of 1 Bits |
Solution.swift |
💚 Easy |
✅ |
198 |
House Robber |
Solution.swift |
💚 Easy |
✅ |
199 |
Binary Tree Right Side View |
Solution.swift |
💛 Medium |
|
✅ |
202 |
Happy Number |
Solution.swift |
💚 Easy |
✅ |
203 |
Remove Linked List Elements |
Solution.swift |
💚 Easy |
✅ |
208 |
Implement Trie (Prefix Tree) |
Solution.swift.swift) |
💛 Medium |
✅ |
209 |
Minimum Size Subarray Sum |
Solution.swift |
💛 Medium |
✅ |
210 |
Course Schedule II |
Solution.swift |
💛 Medium |
✅ |
211 |
Add and Search Word - Data structure design |
Solution.swift |
💛 Medium |
✅ |
213 |
House Robber II |
Solution.swift |
💛 Medium |
✅ |
215 |
Kth Largest Element in an Array |
Solution.swift |
💛 Medium |
✅ |
216 |
Combination Sum III |
Solution.swift |
💛 Medium |
✅ |
217 |
Contains Duplicate |
Solution.swift |
💚 Easy |
✅ |
219 |
Contains Duplicate II |
Solution.swift |
💚 Easy |
✅ |
220 |
Contains Duplicate III |
Solution.swift |
💛 Medium |
✅ |
222 |
Count Complete Tree Nodes |
Solution.swift |
💛 Medium |
✅ |
225 |
Implement Stack using Queues |
Solution.swift |
💚 Easy |
✅ |
226 |
Invert Binary Tree |
Solution.swift |
💚 Easy |
✅ |
227 |
Basic Calculator II |
Solution.swift |
💛 Medium |
✅ |
228 |
Summary Ranges |
Solution.swift |
💚 Easy |
✅ |
229 |
Majority Element II |
Solution.swift |
💛 Medium |
✅ |
231 |
Power of Two |
Solution.swift |
💚 Easy |
✅ |
232 |
Implement Queue using Stacks |
Solution.swift |
💚 Easy |
✅ |
237 |
Delete Node in a Linked List |
Solution.swift |
💚 Easy |
✅ |
239 |
Sliding Window Maximum |
Solution.swift |
❤️ Hard |
✅ |
242 |
Valid Anagram |
Solution.swift |
💚 Easy |
✅ |
243 |
Shortest Word Distance 🔐 |
Solution.swift |
💚 Easy |
✅ |
246 |
Strobogrammatic Number 🔐 |
Solution.swift |
💚 Easy |
✅ |
252 |
Meeting Rooms 🔐 |
Solution.swift |
💚 Easy |
✅ |
253 |
Meeting Rooms II 🔐 |
Solution.swift |
💛 Medium |
✅ |
257 |
Binary Tree Paths |
Solution.swift |
💚 Easy |
✅ |
258 |
Add Digits |
Solution.swift |
💚 Easy |
✅ |
260 |
Single Number III |
Solution.swift |
💛 Medium |
✅ |
264 |
Ugly Number II |
Solution.swift |
💛 Medium |
✅ |
266 |
Palindrome Permutation 🔐 |
Solution.swift |
💚 Easy |
✅ |
268 |
Missing Number |
Solution.swift |
💚 Easy |
✅ |
270 |
Closest Binary Search Tree Value 🔐 |
Solution.swift |
💚 Easy |
✅ |
274 |
H-Index |
Solution.swift |
💛 Medium |
✅ |
276 |
Paint Fence 🔐 |
Solution.swift |
💚 Easy |
✅ |
278 |
First Bad Version |
Solution.swift |
💚 Easy |
✅ |
283 |
Move Zeroes |
Solution.swift |
💚 Easy |
✅ |
284 |
Peeking Iterator |
Solution.swift |
💛 Medium |
✅ |
287 |
Find the Duplicate Number |
Solution.swift |
💛 Medium |
✅ |
289 |
Game of Life |
Solution.swift |
💛 Medium |
✅ |
290 |
Word Pattern |
Solution.swift |
💚 Easy |
✅ |
292 |
Nim Game |
Solution.swift |
💚 Easy |
✅ |
293 |
Flip Game 🔐 |
Solution.swift |
💚 Easy |
✅ |
299 |
Bulls and Cows |
Solution.swift |
💚 Easy |
|
✅ |
309 |
Best Time to Buy and Sell Stock with Cooldown |
Solution.swift |
💛 Medium |
✅ |
310 |
Minimum Height Trees |
Solution.swift |
💛 Medium |
✅ |
312 |
Burst Balloons |
Solution.swift |
❤️ Hard |
✅ |
316 |
Remove Duplicate Letters |
Solution.swift |
💛 Medium |
✅ |
322 |
Coin Change |
Solution.swift |
💛 Medium |
✅ |
334 |
Increasing Triplet Subsequence |
Solution.swift |
💛 Medium |
✅ |
337 |
House Robber III |
Solution.swift |
💛 Medium |
✅ |
339 |
Nested List Weight Sum 🔐 |
Solution.swift |
💚 Easy |
✅ |
340 |
Longest Substring with At Most K Distinct Characters 🔐 |
Solution.swift |
💛 Medium |
✅ |
342 |
Power of Four |
Solution.swift |
💚 Easy |
✅ |
344 |
Reverse String |
Solution.swift |
💚 Easy |
✅ |
346 |
Moving Average from Data Stream 🔐 |
Solution.swift |
💚 Easy |
✅ |
348 |
Design Tic-Tac-Toe 🔐 |
Solution.swift |
💛 Medium |
✅ |
349 |
Intersection of Two Arrays |
Solution.swift |
💚 Easy |
✅ |
350 |
Intersection of Two Arrays II |
Solution.swift |
💚 Easy |
✅ |
359 |
Logger Rate Limiter 🔐 |
Solution.swift |
💚 Easy |
✅ |
367 |
Valid Perfect Square |
Solution.swift |
💚 Easy |
✅ |
369 |
Plus One Linked List 🔐 |
Solution.swift |
💛 Medium |
✅ |
376 |
Wiggle Subsequence |
Solution.swift |
💛 Medium |
✅ |
380 |
Insert Delete GetRandom O(1) |
Solution.swift.swift) |
💛 Medium |
✅ |
382 |
Linked List Random Node |
Solution.swift |
💛 Medium |
✅ |
383 |
Ransom Note |
Solution.swift |
💚 Easy |
✅ |
387 |
First Unique Character in a String |
Solution.swift |
💚 Easy |
✅ |
389 |
Find the Difference |
Solution.swift |
💚 Easy |
✅ |
392 |
Is Subsequence |
Solution.swift |
💚 Easy |
✅ |
394 |
Decode String |
Solution.swift |
💛 Medium |
✅ |
395 |
Longest Substring with At Least K Repeating Characters |
Solution.swift |
💛 Medium |
✅ |
399 |
Evaluate Division |
Solution.swift |
💛 Medium |
|
✅ |
404 |
Sum of Left Leaves |
Solution.swift |
💚 Easy |
✅ |
408 |
Valid Word Abbreviation 🔐 |
Solution.swift |
💚 Easy |
✅ |
409 |
Longest Palindrome |
Solution.swift |
💚 Easy |
✅ |
412 |
Fizz Buzz |
Solution.swift |
💚 Easy |
✅ |
413 |
Arithmetic Slices |
Solution.swift |
💛 Medium |
✅ |
414 |
Third Maximum Number |
Solution.swift |
💚 Easy |
✅ |
416 |
Partition Equal Subset Sum |
Solution.swift |
💛 Medium |
✅ |
417 |
Pacific Atlantic Water Flow |
Solution.swift |
💛 Medium |
✅ |
421 |
Maximum XOR of Two Numbers in an Array |
Solution.swift |
💛 Medium |
✅ |
422 |
Valid Word Square 🔐 |
Solution.swift |
💚 Easy |
✅ |
430 |
Flatten a Multilevel Doubly Linked List |
Solution.swift |
💛 Medium |
✅ |
435 |
Non-overlapping Intervals |
Solution.swift |
💛 Medium |
✅ |
436 |
Find Right Interval |
Solution.swift |
💛 Medium |
✅ |
437 |
Path Sum III |
Solution.swift |
💛 Medium |
✅ |
441 |
Arranging Coins |
Solution.swift |
💚 Easy |
✅ |
442 |
Find All Duplicates in an Array |
Solution.swift |
💛 Medium |
✅ |
445 |
Add Two Numbers II |
Solution.swift |
💛 Medium |
✅ |
449 |
Serialize and Deserialize BST |
Solution.swift |
💛 Medium |
✅ |
450 |
Delete Node in a BST |
Solution.swift |
💛 Medium |
✅ |
452 |
Minimum Number of Arrows to Burst Balloons |
Solution.swift |
💛 Medium |
✅ |
454 |
4Sum II |
Solution.swift |
💛 Medium |
✅ |
456 |
132 Pattern |
Solution.swift |
💛 Medium |
✅ |
458 |
Poor Pigs |
Solution.swift |
❤️ Hard |
✅ |
459 |
Repeated Substring Pattern |
Solution.swift |
💚 Easy |
✅ |
461 |
Hamming Distance |
Solution.swift |
💚 Easy |
✅ |
463 |
Island Perimeter |
Solution.swift |
💚 Easy |
✅ |
470 |
Implement Rand10() Using Rand7() |
Solution.swift%20Using%20Rand7().swift) |
💛 Medium |
✅ |
476 |
Number Complement |
Solution.swift |
💚 Easy |
✅ |
478 |
Generate Random Point in a Circle |
Solution.swift |
💛 Medium |
✅ |
484 |
Find Permutation 🔐 |
Solution.swift |
💛 Medium |
✅ |
485 |
Max Consecutive Ones |
Solution.swift |
💚 Easy |
✅ |
487 |
Max Consecutive Ones II 🔐 |
Solution.swift |
💛 Medium |
✅ |
489 |
Robot Room Cleaner 🔐 |
Solution.swift |
❤️ Hard |
✅ |
490 |
The Maze 🔐 |
Solution.swift |
💛 Medium |
✅ |
495 |
Teemo Attacking |
Solution.swift |
💛 Medium |
✅ |
497 |
Random Point in Non-overlapping Rectangles |
Solution.swift |
💛 Medium |
✅ |
498 |
Diagonal Traverse |
Solution.swift |
💛 Medium |
|
✅ |
510 |
Inorder Successor in BST II 🔐 |
Solution.swift |
💛 Medium |
✅ |
518 |
Coin Change 2 |
Solution.swift |
💛 Medium |
✅ |
520 |
Detect Capital |
Solution.swift |
💚 Easy |
✅ |
526 |
Beautiful Arrangement |
Solution.swift |
💛 Medium |
✅ |
532 |
K-diff Pairs in an Array |
Solution.swift |
💛 Medium |
✅ |
535 |
Encode and Decode TinyURL |
Solution.swift |
💛 Medium |
✅ |
538 |
Convert BST to Greater Tree |
Solution.swift |
💛 Medium |
✅ |
551 |
Student Attendance Record I |
Solution.swift |
💚 Easy |
✅ |
556 |
Next Greater Element III |
Solution.swift |
💛 Medium |
✅ |
563 |
Binary Tree Tilt |
Solution.swift |
💚 Easy |
✅ |
573 |
Squirrel Simulation |
Solution.swift |
💛 Medium |
✅ |
582 |
Kill Process 🔐 |
Solution.swift |
💛 Medium |
✅ |
593 |
Valid Square |
Solution.swift |
💛 Medium |
✅ |
594 |
Longest Harmonious Subsequence |
Solution.swift |
💚 Easy |
|
✅ |
604 |
Design Compressed String Iterator 🔐 |
Solution.swift |
💚 Easy |
✅ |
605 |
Can Place Flowers |
Solution.swift |
💚 Easy |
✅ |
616 |
Add Bold Tag in String 🔐 |
Solution.swift |
💛 Medium |
✅ |
621 |
Task Scheduler |
Solution.swift |
💛 Medium |
✅ |
623 |
Add One Row to Tree |
Solution.swift |
💛 Medium |
✅ |
624 |
Maximum Distance in Arrays 🔐 |
Solution.swift |
💚 Easy |
✅ |
637 |
Average of Levels in Binary Tree |
Solution.swift |
💚 Easy |
✅ |
662 |
Maximum Width of Binary Tree |
Solution.swift |
💛 Medium |
✅ |
669 |
Trim a Binary Search Tree |
Solution.swift |
💛 Medium |
✅ |
673 |
Number of Longest Increasing Subsequence |
Solution.swift |
💛 Medium |
✅ |
678 |
Valid Parenthesis String |
Solution.swift |
💛 Medium |
✅ |
694 |
Number of Distinct Islands 🔐 |
Solution.swift |
💛 Medium |
|
✅ |
700 |
Search in a Binary Search Tree |
Solution.swift |
💚 Easy |
✅ |
701 |
Insert into a Binary Search Tree |
Solution.swift |
💛 Medium |
✅ |
702 |
Search in a Sorted Array of Unknown Size 🔐 |
Solution.swift |
💛 Medium |
✅ |
704 |
Binary Search |
Solution.swift |
💚 Easy |
✅ |
708 |
Insert into a Sorted Circular Linked List 🔐 |
Solution.swift |
💛 Medium |
✅ |
713 |
Subarray Product Less Than K |
Solution.swift |
💛 Medium |
✅ |
714 |
Best Time to Buy and Sell Stock with Transaction Fee |
Solution.swift |
💛 Medium |
✅ |
716 |
Max Stack 🔐 |
Solution.swift |
💚 Easy |
✅ |
733 |
Flood Fill |
Solution.swift |
💚 Easy |
✅ |
734 |
Sentence Similarity 🔐 |
Solution.swift |
💚 Easy |
✅ |
735 |
Asteroid Collision |
Solution.swift |
💛 Medium |
✅ |
744 |
Find Smallest Letter Greater Than Target |
Solution.swift |
💚 Easy |
✅ |
750 |
Number Of Corner Rectangles 🔐 |
Solution.swift |
💛 Medium |
✅ |
754 |
Reach a Number |
Solution.swift |
💛 Medium |
✅ |
758 |
Bold Words in String 🔐 |
Solution.swift |
💚 Easy |
✅ |
760 |
Find Anagram Mappings 🔐 |
Solution.swift |
💚 Easy |
✅ |
763 |
Partition Labels |
Solution.swift |
💛 Medium |
✅ |
771 |
Jewels and Stones |
Solution.swift |
💚 Easy |
✅ |
784 |
Letter Case Permutation |
Solution.swift |
💛 Medium |
✅ |
785 |
Is Graph Bipartite? |
Solution.swift |
💛 Medium |
✅ |
797 |
All Paths From Source to Target |
Solution.swift |
💛 Medium |
✅ |
799 |
Champagne Tower |
Solution.swift |
💛 Medium |
|
✅ |
800 |
Similar RGB Color 🔐 |
Solution.swift |
💚 Easy |
✅ |
804 |
Unique Morse Code Words |
Solution.swift |
💚 Easy |
✅ |
821 |
Shortest Distance to a Character |
Solution.swift |
💚 Easy |
✅ |
824 |
Goat Latin |
Solution.swift |
💚 Easy |
✅ |
832 |
Flipping an Image |
Solution.swift |
💚 Easy |
✅ |
845 |
Longest Mountain in Array |
Solution.swift |
💛 Medium |
✅ |
849 |
Maximize Distance to Closest Person |
Solution.swift |
💛 Medium |
✅ |
858 |
Mirror Reflection |
Solution.swift |
💛 Medium |
✅ |
859 |
Buddy Strings |
Solution.swift |
💚 Easy |
✅ |
865 |
Smallest Subtree with all the Deepest Nodes |
Solution.swift |
💛 Medium |
✅ |
869 |
Reordered Power of 2 |
Solution.swift |
💛 Medium |
✅ |
870 |
Advantage Shuffle |
Solution.swift |
💛 Medium |
✅ |
876 |
Middle of the Linked List |
Solution.swift |
💚 Easy |
✅ |
880 |
Decoded String at Index |
Solution.swift |
💛 Medium |
✅ |
881 |
Boats to Save People |
Solution.swift |
💛 Medium |
✅ |
897 |
Increasing Order Search Tree |
Solution.swift |
💚 Easy |
|
✅ |
901 |
Online Stock Span |
Solution.swift |
💛 Medium |
✅ |
902 |
Numbers At Most N Given Digit Set |
Solution.swift |
❤️ Hard |
✅ |
905 |
Sort Array By Parity |
Solution.swift |
💚 Easy |
✅ |
910 |
Smallest Range II |
Solution.swift |
💛 Medium |
✅ |
933 |
Number of Recent Calls |
Solution.swift |
💚 Easy |
✅ |
938 |
Range Sum of BST |
Solution.swift |
💚 Easy |
✅ |
941 |
Valid Mountain Array |
Solution.swift |
💚 Easy |
✅ |
948 |
Bag of Tokens |
Solution.swift |
💛 Medium |
✅ |
949 |
Largest Time for Given Digits |
Solution.swift |
💚 Easy |
✅ |
952 |
Largest Component Size by Common Factor |
Solution.swift |
❤️ Hard |
✅ |
957 |
Prison Cells After N Days |
Solution.swift |
💛 Medium |
✅ |
966 |
Vowel Spellchecker |
Solution.swift |
💛 Medium |
✅ |
967 |
Numbers With Same Consecutive Differences |
Solution.swift |
💛 Medium |
✅ |
969 |
Pancake Sorting |
Solution.swift |
💛 Medium |
✅ |
977 |
Squares of a Sorted Array |
Solution.swift |
💚 Easy |
✅ |
980 |
Unique Paths III |
Solution.swift |
❤️ Hard |
✅ |
983 |
Minimum Cost For Tickets |
Solution.swift |
💛 Medium |
✅ |
987 |
Vertical Order Traversal of a Binary Tree |
Solution.swift |
💛 Medium |
✅ |
994 |
Rotting Oranges |
Solution.swift |
💛 Medium |
✅ |
997 |
Find the Town Judge |
Solution.swift |
💚 Easy |
|
✅ |
1007 |
Minimum Domino Rotations For Equal Row |
Solution.swift |
💛 Medium |
✅ |
1009 |
Complement of Base 10 Integer |
Solution.swift |
💚 Easy |
✅ |
1010 |
Pairs of Songs With Total Durations Divisible by 60 |
Solution.swift |
💛 Medium |
✅ |
1015 |
Smallest Integer Divisible by K |
Solution.swift |
💛 Medium |
✅ |
1022 |
Sum of Root To Leaf Binary Numbers |
Solution.swift |
💚 Easy |
✅ |
1026 |
Maximum Difference Between Node and Ancestor |
Solution.swift |
💛 Medium |
✅ |
1032 |
Stream of Characters |
Solution.swift |
❤️ Hard |
✅ |
1035 |
Uncrossed Lines |
Solution.swift |
💛 Medium |
✅ |
1038 |
Binary Search Tree to Greater Sum Tree |
Solution.swift |
💛 Medium |
✅ |
1041 |
Robot Bounded In Circle |
Solution.swift |
💛 Medium |
✅ |
1056 |
Confusing Number 🔐 |
Solution.swift |
💚 Easy |
✅ |
1064 |
Fixed Point 🔐 |
Solution.swift |
💚 Easy |
✅ |
1065 |
Index Pairs of a String 🔐 |
Solution.swift |
💚 Easy |
✅ |
1081 |
Smallest Subsequence of Distinct Characters |
Solution.swift |
💛 Medium |
✅ |
1091 |
Shortest Path in Binary Matrix |
Solution.swift |
💛 Medium |
✅ |
1094 |
Car Pooling |
Solution.swift |
💛 Medium |
✅ |
1099 |
Two Sum Less Than K 🔐 |
Solution.swift |
💚 Easy |
|
✅ |
1103 |
Distribute Candies to People |
Solution.swift |
💚 Easy |
✅ |
1123 |
Lowest Common Ancestor of Deepest Leaves |
Solution.swift |
💛 Medium |
✅ |
1165 |
Single-Row Keyboard 🔐 |
Solution.swift |
💚 Easy |
|
✅ |
1213 |
Intersection of Three Sorted Arrays |
Solution.swift |
💚 Easy |
✅ |
1217 |
Minimum Cost to Move Chips to The Same Position |
Solution.swift |
💚 Easy |
✅ |
1249 |
Minimum Remove to Make Valid Parentheses |
Solution.swift |
💛 Medium |
✅ |
1272 |
Remove Interval 🔐 |
Solution.swift |
💛 Medium |
✅ |
1283 |
Find the Smallest Divisor Given a Threshold |
Solution.swift |
💛 Medium |
✅ |
1286 |
Iterator for Combination |
Solution.swift |
💛 Medium |
✅ |
1288 |
Remove Covered Intervals |
Solution.swift |
💛 Medium |
✅ |
1290 |
Convert Binary Number in a Linked List to Integer |
Solution.swift |
💚 Easy |
✅ |
1291 |
Sequential Digits |
Solution.swift |
💛 Medium |
✅ |
1295 |
Find Numbers with Even Number of Digits |
Solution.swift |
💚 Easy |
|
✅ |
1306 |
Jump Game III |
Solution.swift |
💛 Medium |
✅ |
1329 |
Sort the Matrix Diagonally |
Solution.swift |
💛 Medium |
✅ |
1332 |
Remove Palindromic Subsequences |
Solution.swift |
💚 Easy |
✅ |
1337 |
The K Weakest Rows in a Matrix |
Solution.swift |
💚 Easy |
✅ |
1342 |
Number of Steps to Reduce a Number to Zero |
Solution.swift |
💚 Easy |
✅ |
1344 |
Angle Between Hands of a Clock |
Solution.swift |
💛 Medium |
✅ |
1345 |
Jump Game IV |
Solution.swift |
❤️ Hard |
✅ |
1365 |
How Many Numbers Are Smaller Than the Current Number |
Solution.swift |
💚 Easy |
✅ |
1396 |
Design Underground System |
Solution.swift |
💛 Medium |
|
✅ |
1426 |
Counting Elements 🔐 |
Solution.swift |
💚 Easy |
✅ |
1437 |
Check If All 1’s Are at Least Length K Places Away |
Solution.swift |
💚 Easy |
✅ |
1446 |
Consecutive Characters |
Solution.swift |
💚 Easy |
✅ |
1457 |
Pseudo-Palindromic Paths in a Binary Tree |
Solution.swift |
💛 Medium |
✅ |
1463 |
Cherry Pickup II |
Solution.swift |
❤️ Hard |
✅ |
1492 |
The kth Factor of n |
Solution.swift |
💛 Medium |
|
✅ |
1506 |
Find Root of N-Ary Tree 🔐 |
Solution.swift |
💛 Medium |
✅ |
1510 |
Stone Game IV |
Solution.swift |
❤️ Hard |
✅ |
1539 |
Kth Missing Positive Number |
Solution.swift |
💚 Easy |
|
✅ |
1602 |
Find Nearest Right Node in Binary Tree |
Solution.swift |
💛 Medium |
✅ |
1631 |
Path With Minimum Effort |
Solution.swift |
💛 Medium |
✅ |
1640 |
Check Array Formation Through Concatenation |
Solution.swift |
💚 Easy |
✅ |
1641 |
Count Sorted Vowel Strings |
Solution.swift |
💛 Medium |
✅ |
1646 |
Get Maximum in Generated Array |
Solution.swift |
💚 Easy |
✅ |
1657 |
Determine if Two Strings Are Close |
Solution.swift |
💛 Medium |
✅ |
1658 |
Minimum Operations to Reduce X to Zero |
Solution.swift |
💛 Medium |
✅ |
1662 |
Check If Two String Arrays are Equivalent |
Solution.swift |
💚 Easy |
✅ |
1663 |
Smallest String With A Given Numeric Value |
Solution.swift |
💛 Medium |
✅ |
1673 |
Find the Most Competitive Subsequence |
Solution.swift |
💛 Medium |
✅ |
1679 |
Max Number of K-Sum Pairs |
Solution.swift |
💛 Medium |
✅ |
1680 |
Concatenation of Consecutive Binary Numbers |
Solution.swift |
💛 Medium |
|
✅ |
1721 |
Swapping Nodes in a Linked List |
Solution.swift |
💛 Medium |