Skip to content

Latest commit

 

History

History

list-06

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
Question Free? Status Difficulty Topics Similar Questions
501. Find Mode in Binary Search Tree  🔗  📝
🆓 ⭐️
Tree  🔗
Depth-First Search  🔗
Binary Search Tree  🔗
Binary Tree  🔗
98. Validate Binary Search Tree  🔗  📝
502. IPO  🔗  📝
🆓 ⭐️⭐️⭐️
Array  🔗
Greedy  🔗
Sorting  🔗
Heap (Priority Queue)  🔗
503. Next Greater Element II  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Stack  🔗
Monotonic Stack  🔗
496. Next Greater Element I  🔗  📝
556. Next Greater Element III  🔗  📝
504. Base 7  🔗  📝
🆓 ⭐️
Math  🔗
505. The Maze II  🔗  📝
💰 ⭐️⭐️
Depth-First Search  🔗
Breadth-First Search  🔗
Graph  🔗
Heap (Priority Queue)  🔗
Shortest Path  🔗
490. The Maze  🔗  📝
499. The Maze III  🔗  📝
506. Relative Ranks  🔗  📝
🆓 ⭐️
Array  🔗
Sorting  🔗
Heap (Priority Queue)  🔗
507. Perfect Number  🔗  📝
🆓 ⭐️
Math  🔗
728. Self Dividing Numbers  🔗  📝
508. Most Frequent Subtree Sum  🔗  📝
🆓 ⭐️⭐️
Hash Table  🔗
Tree  🔗
Depth-First Search  🔗
Binary Tree  🔗
572. Subtree of Another Tree  🔗  📝
1973. Count Nodes Equal to Sum of Descendants  🔗  📝
509. Fibonacci Number  🔗  📝
🆓 ⭐️
Math  🔗
Dynamic Programming  🔗
Recursion  🔗
Memoization  🔗
70. Climbing Stairs  🔗  📝
842. Split Array into Fibonacci Sequence  🔗  📝
873. Length of Longest Fibonacci Subsequence  🔗  📝
1137. N-th Tribonacci Number  🔗  📝
510. Inorder Successor in BST II  🔗  📝
💰 ⭐️⭐️
Tree  🔗
Binary Search Tree  🔗
Binary Tree  🔗
285. Inorder Successor in BST  🔗  📝
511. Game Play Analysis I  🔗  📝
🆓 ⭐️
Database  🔗
512. Game Play Analysis II  🔗  📝
512. Game Play Analysis II  🔗  📝
💰 ⭐️
Database  🔗
511. Game Play Analysis I  🔗  📝
534. Game Play Analysis III  🔗  📝
513. Find Bottom Left Tree Value  🔗  📝
🆓 ⭐️⭐️
Tree  🔗
Depth-First Search  🔗
Breadth-First Search  🔗
Binary Tree  🔗
514. Freedom Trail  🔗  📝
🆓 ⭐️⭐️⭐️
String  🔗
Dynamic Programming  🔗
Depth-First Search  🔗
Breadth-First Search  🔗
515. Find Largest Value in Each Tree Row  🔗  📝
🆓 ⭐️⭐️
Tree  🔗
Depth-First Search  🔗
Breadth-First Search  🔗
Binary Tree  🔗
516. Longest Palindromic Subsequence  🔗  📝
🆓 ⭐️⭐️
String  🔗
Dynamic Programming  🔗
5. Longest Palindromic Substring  🔗  📝
647. Palindromic Substrings  🔗  📝
730. Count Different Palindromic Subsequences  🔗  📝
1143. Longest Common Subsequence  🔗  📝
1682. Longest Palindromic Subsequence II  🔗  📝
1771. Maximize Palindrome Length From Subsequences  🔗  📝
2002. Maximum Product of the Length of Two Palindromic Subsequences  🔗  📝
517. Super Washing Machines  🔗  📝
🆓 ⭐️⭐️⭐️
Array  🔗
Greedy  🔗
518. Coin Change 2  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Dynamic Programming  🔗
2218. Maximum Value of K Coins From Piles  🔗  📝
519. Random Flip Matrix  🔗  📝
🆓 ⭐️⭐️
Hash Table  🔗
Math  🔗
Reservoir Sampling  🔗
Randomized  🔗
520. Detect Capital  🔗  📝
🆓 ⭐️
String  🔗
2129. Capitalize the Title  🔗  📝
521. Longest Uncommon Subsequence I  🔗  📝
🆓 ⭐️
String  🔗
522. Longest Uncommon Subsequence II  🔗  📝
522. Longest Uncommon Subsequence II  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Hash Table  🔗
Two Pointers  🔗
String  🔗
Sorting  🔗
521. Longest Uncommon Subsequence I  🔗  📝
523. Continuous Subarray Sum  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Hash Table  🔗
Math  🔗
Prefix Sum  🔗
560. Subarray Sum Equals K  🔗  📝
2009. Minimum Number of Operations to Make Array Continuous  🔗  📝
2121. Intervals Between Identical Elements  🔗  📝
524. Longest Word in Dictionary through Deleting  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Two Pointers  🔗
String  🔗
Sorting  🔗
720. Longest Word in Dictionary  🔗  📝
525. Contiguous Array  🔗  📝
🆓 👀 ⭐️⭐️
Array  🔗
Hash Table  🔗
Prefix Sum  🔗
325. Maximum Size Subarray Sum Equals k  🔗  📝
526. Beautiful Arrangement  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Dynamic Programming  🔗
Backtracking  🔗
Bit Manipulation  🔗
Bitmask  🔗
667. Beautiful Arrangement II  🔗  📝
527. Word Abbreviation  🔗  📝
💰 ⭐️⭐️⭐️
Array  🔗
String  🔗
Greedy  🔗
Trie  🔗
Sorting  🔗
408. Valid Word Abbreviation  🔗  📝
411. Minimum Unique Word Abbreviation  🔗  📝
528. Random Pick with Weight  🔗  📝
🆓 ⭐️⭐️
Math  🔗
Binary Search  🔗
Prefix Sum  🔗
Randomized  🔗
398. Random Pick Index  🔗  📝
497. Random Point in Non-overlapping Rectangles  🔗  📝
710. Random Pick with Blacklist  🔗  📝
529. Minesweeper  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Depth-First Search  🔗
Breadth-First Search  🔗
Matrix  🔗
2101. Detonate the Maximum Bombs  🔗  📝
530. Minimum Absolute Difference in BST  🔗  📝
🆓 ⭐️
Tree  🔗
Depth-First Search  🔗
Breadth-First Search  🔗
Binary Search Tree  🔗
Binary Tree  🔗
532. K-diff Pairs in an Array  🔗  📝
531. Lonely Pixel I  🔗  📝
💰 ⭐️⭐️
Array  🔗
Hash Table  🔗
Matrix  🔗
533. Lonely Pixel II  🔗  📝
532. K-diff Pairs in an Array  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Hash Table  🔗
Two Pointers  🔗
Binary Search  🔗
Sorting  🔗
530. Minimum Absolute Difference in BST  🔗  📝
2006. Count Number of Pairs With Absolute Difference K  🔗  📝
2040. Kth Smallest Product of Two Sorted Arrays  🔗  📝
2364. Count Number of Bad Pairs  🔗  📝
533. Lonely Pixel II  🔗  📝
💰 ⭐️⭐️
Array  🔗
Hash Table  🔗
Matrix  🔗
531. Lonely Pixel I  🔗  📝
534. Game Play Analysis III  🔗  📝
💰 ⭐️⭐️
Database  🔗
512. Game Play Analysis II  🔗  📝
550. Game Play Analysis IV  🔗  📝
535. Encode and Decode TinyURL  🔗  📝
🆓 ⭐️⭐️
Hash Table  🔗
String  🔗
Design  🔗
Hash Function  🔗
536. Construct Binary Tree from String  🔗  📝
💰 ⭐️⭐️
String  🔗
Tree  🔗
Depth-First Search  🔗
Binary Tree  🔗
606. Construct String from Binary Tree  🔗  📝
537. Complex Number Multiplication  🔗  📝
🆓 ⭐️⭐️
Math  🔗
String  🔗
Simulation  🔗
538. Convert BST to Greater Tree  🔗  📝
🆓 ⭐️⭐️
Tree  🔗
Depth-First Search  🔗
Binary Search Tree  🔗
Binary Tree  🔗
539. Minimum Time Difference  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Math  🔗
String  🔗
Sorting  🔗
2162. Minimum Cost to Set Cooking Time  🔗  📝
540. Single Element in a Sorted Array  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Binary Search  🔗
541. Reverse String II  🔗  📝
🆓 ⭐️
Two Pointers  🔗
String  🔗
344. Reverse String  🔗  📝
557. Reverse Words in a String III  🔗  📝
542. 01 Matrix  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Dynamic Programming  🔗
Breadth-First Search  🔗
Matrix  🔗
1730. Shortest Path to Get Food  🔗  📝
2123. Minimum Operations to Remove Adjacent Ones in Matrix  🔗  📝
543. Diameter of Binary Tree  🔗  📝
🆓 ⭐️
Tree  🔗
Depth-First Search  🔗
Binary Tree  🔗
1522. Diameter of N-Ary Tree  🔗  📝
2246. Longest Path With Different Adjacent Characters  🔗  📝
544. Output Contest Matches  🔗  📝
💰 ⭐️⭐️
String  🔗
Recursion  🔗
Simulation  🔗
545. Boundary of Binary Tree  🔗  📝
💰 ⭐️⭐️
Tree  🔗
Depth-First Search  🔗
Binary Tree  🔗
199. Binary Tree Right Side View  🔗  📝
546. Remove Boxes  🔗  📝
🆓 ⭐️⭐️⭐️
Array  🔗
Dynamic Programming  🔗
Memoization  🔗
664. Strange Printer  🔗  📝
2107. Number of Unique Flavors After Sharing K Candies  🔗  📝
547. Number of Provinces  🔗  📝
🆓 ⭐️⭐️
Depth-First Search  🔗
Breadth-First Search  🔗
Union Find  🔗
Graph  🔗
323. Number of Connected Components in an Undirected Graph  🔗  📝
657. Robot Return to Origin  🔗  📝
734. Sentence Similarity  🔗  📝
737. Sentence Similarity II  🔗  📝
1101. The Earliest Moment When Everyone Become Friends  🔗  📝
2101. Detonate the Maximum Bombs  🔗  📝
548. Split Array with Equal Sum  🔗  📝
💰 ⭐️⭐️⭐️
Array  🔗
Prefix Sum  🔗
1573. Number of Ways to Split a String  🔗  📝
2305. Fair Distribution of Cookies  🔗  📝
549. Binary Tree Longest Consecutive Sequence II  🔗  📝
💰 ⭐️⭐️
Tree  🔗
Depth-First Search  🔗
Binary Tree  🔗
298. Binary Tree Longest Consecutive Sequence  🔗  📝
2229. Check if an Array Is Consecutive  🔗  📝
550. Game Play Analysis IV  🔗  📝
💰 ⭐️⭐️
Database  🔗
534. Game Play Analysis III  🔗  📝
1097. Game Play Analysis V  🔗  📝
551. Student Attendance Record I  🔗  📝
🆓 ⭐️
String  🔗
552. Student Attendance Record II  🔗  📝
552. Student Attendance Record II  🔗  📝
🆓 ⭐️⭐️⭐️
Dynamic Programming  🔗
551. Student Attendance Record I  🔗  📝
553. Optimal Division  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Math  🔗
Dynamic Programming  🔗
554. Brick Wall  🔗  📝
🆓 👀 ⭐️⭐️
Array  🔗
Hash Table  🔗
2184. Number of Ways to Build Sturdy Brick Wall  🔗  📝
555. Split Concatenated Strings  🔗  📝
💰 ⭐️⭐️
Array  🔗
String  🔗
Greedy  🔗
556. Next Greater Element III  🔗  📝
🆓 ⭐️⭐️
Math  🔗
Two Pointers  🔗
String  🔗
496. Next Greater Element I  🔗  📝
503. Next Greater Element II  🔗  📝
1842. Next Palindrome Using Same Digits  🔗  📝
557. Reverse Words in a String III  🔗  📝
🆓 ⭐️
Two Pointers  🔗
String  🔗
541. Reverse String II  🔗  📝
558. Logical OR of Two Binary Grids Represented as Quad-Trees  🔗  📝
🆓 ⭐️⭐️
Divide and Conquer  🔗
Tree  🔗
559. Maximum Depth of N-ary Tree  🔗  📝
🆓 ⭐️
Tree  🔗
Depth-First Search  🔗
Breadth-First Search  🔗
104. Maximum Depth of Binary Tree  🔗  📝
2039. The Time When the Network Becomes Idle  🔗  📝
560. Subarray Sum Equals K  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Hash Table  🔗
Prefix Sum  🔗
1. Two Sum  🔗  📝
523. Continuous Subarray Sum  🔗  📝
713. Subarray Product Less Than K  🔗  📝
724. Find Pivot Index  🔗  📝
974. Subarray Sums Divisible by K  🔗  📝
1658. Minimum Operations to Reduce X to Zero  🔗  📝
2090. K Radius Subarray Averages  🔗  📝
2219. Maximum Sum Score of Array  🔗  📝
561. Array Partition  🔗  📝
🆓 ⭐️
Array  🔗
Greedy  🔗
Sorting  🔗
Counting Sort  🔗
1984. Minimum Difference Between Highest and Lowest of K Scores  🔗  📝
2144. Minimum Cost of Buying Candies With Discount  🔗  📝
2155. All Divisions With the Highest Score of a Binary Array  🔗  📝
562. Longest Line of Consecutive One in Matrix  🔗  📝
💰 ⭐️⭐️
Array  🔗
Dynamic Programming  🔗
Matrix  🔗
563. Binary Tree Tilt  🔗  📝
🆓 ⭐️
Tree  🔗
Depth-First Search  🔗
Binary Tree  🔗
1469. Find All The Lonely Nodes  🔗  📝
564. Find the Closest Palindrome  🔗  📝
🆓 ⭐️⭐️⭐️
Math  🔗
String  🔗
1842. Next Palindrome Using Same Digits  🔗  📝
2217. Find Palindrome With Fixed Length  🔗  📝
565. Array Nesting  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Depth-First Search  🔗
339. Nested List Weight Sum  🔗  📝
341. Flatten Nested List Iterator  🔗  📝
364. Nested List Weight Sum II  🔗  📝
566. Reshape the Matrix  🔗  📝
🆓 ⭐️
Array  🔗
Matrix  🔗
Simulation  🔗
2022. Convert 1D Array Into 2D Array  🔗  📝
567. Permutation in String  🔗  📝
🆓 ⭐️⭐️
Hash Table  🔗
Two Pointers  🔗
String  🔗
Sliding Window  🔗
76. Minimum Window Substring  🔗  📝
438. Find All Anagrams in a String  🔗  📝
568. Maximum Vacation Days  🔗  📝
💰 ⭐️⭐️⭐️
Array  🔗
Dynamic Programming  🔗
Matrix  🔗
787. Cheapest Flights Within K Stops  🔗  📝
569. Median Employee Salary  🔗  📝
💰 ⭐️⭐️⭐️
Database  🔗
571. Find Median Given Frequency of Numbers  🔗  📝
570. Managers with at Least 5 Direct Reports  🔗  📝
💰 ⭐️⭐️
Database  🔗
571. Find Median Given Frequency of Numbers  🔗  📝
💰 ⭐️⭐️⭐️
Database  🔗
569. Median Employee Salary  🔗  📝
572. Subtree of Another Tree  🔗  📝
🆓 ⭐️
Tree  🔗
Depth-First Search  🔗
String Matching  🔗
Binary Tree  🔗
Hash Function  🔗
250. Count Univalue Subtrees  🔗  📝
508. Most Frequent Subtree Sum  🔗  📝
573. Squirrel Simulation  🔗  📝
💰 ⭐️⭐️
Array  🔗
Math  🔗
574. Winning Candidate  🔗  📝
💰 ⭐️⭐️
Database  🔗
575. Distribute Candies  🔗  📝
🆓 ⭐️
Array  🔗
Hash Table  🔗
576. Out of Boundary Paths  🔗  📝
🆓 ⭐️⭐️
Dynamic Programming  🔗
688. Knight Probability in Chessboard  🔗  📝
2120. Execution of All Suffix Instructions Staying in a Grid  🔗  📝
577. Employee Bonus  🔗  📝
💰 ⭐️
Database  🔗
175. Combine Two Tables  🔗  📝
578. Get Highest Answer Rate Question  🔗  📝
💰 ⭐️⭐️
Database  🔗
579. Find Cumulative Salary of an Employee  🔗  📝
💰 ⭐️⭐️⭐️
Database  🔗
580. Count Student Number in Departments  🔗  📝
💰 ⭐️⭐️
Database  🔗
581. Shortest Unsorted Continuous Subarray  🔗  📝
🆓 ⭐️⭐️
Array  🔗
Two Pointers  🔗
Stack  🔗
Greedy  🔗
Sorting  🔗
Monotonic Stack  🔗
582. Kill Process  🔗  📝
💰 ⭐️⭐️
Array  🔗
Hash Table  🔗
Tree  🔗
Depth-First Search  🔗
Breadth-First Search  🔗
583. Delete Operation for Two Strings  🔗  📝
🆓 ⭐️⭐️
String  🔗
Dynamic Programming  🔗
72. Edit Distance  🔗  📝
712. Minimum ASCII Delete Sum for Two Strings  🔗  📝
1143. Longest Common Subsequence  🔗  📝
584. Find Customer Referee  🔗  📝
🆓 ⭐️
Database  🔗
585. Investments in 2016  🔗  📝
💰 ⭐️⭐️
Database  🔗
586. Customer Placing the Largest Number of Orders  🔗  📝
🆓 ⭐️
Database  🔗
587. Erect the Fence  🔗  📝
🆓 ⭐️⭐️⭐️
Array  🔗
Math  🔗
Geometry  🔗
1924. Erect the Fence II  🔗  📝
588. Design In-Memory File System  🔗  📝
💰 ⭐️⭐️⭐️
Hash Table  🔗
String  🔗
Design  🔗
Trie  🔗
146. LRU Cache  🔗  📝
460. LFU Cache  🔗  📝
635. Design Log Storage System  🔗  📝
589. N-ary Tree Preorder Traversal  🔗  📝
🆓 ⭐️
Stack  🔗
Tree  🔗
Depth-First Search  🔗
144. Binary Tree Preorder Traversal  🔗  📝
429. N-ary Tree Level Order Traversal  🔗  📝
590. N-ary Tree Postorder Traversal  🔗  📝
590. N-ary Tree Postorder Traversal  🔗  📝
🆓 ⭐️
Stack  🔗
Tree  🔗
Depth-First Search  🔗
145. Binary Tree Postorder Traversal  🔗  📝
429. N-ary Tree Level Order Traversal  🔗  📝
589. N-ary Tree Preorder Traversal  🔗  📝
591. Tag Validator  🔗  📝
🆓 ⭐️⭐️⭐️
String  🔗
Stack  🔗
616. Add Bold Tag in String  🔗  📝
592. Fraction Addition and Subtraction  🔗  📝
🆓 ⭐️⭐️
Math  🔗
String  🔗
Simulation  🔗
640. Solve the Equation  🔗  📝
593. Valid Square  🔗  📝
🆓 ⭐️⭐️
Math  🔗
Geometry  🔗
594. Longest Harmonious Subsequence  🔗  📝
🆓 ⭐️
Array  🔗
Hash Table  🔗
Sorting  🔗
595. Big Countries  🔗  📝
🆓 ⭐️
Database  🔗
596. Classes More Than 5 Students  🔗  📝
🆓 ⭐️
Database  🔗
597. Friend Requests I: Overall Acceptance Rate  🔗  📝
💰 ⭐️
Database  🔗
598. Range Addition II  🔗  📝
🆓 ⭐️
Array  🔗
Math  🔗
370. Range Addition  🔗  📝
599. Minimum Index Sum of Two Lists  🔗  📝
🆓 ⭐️
Array  🔗
Hash Table  🔗
String  🔗
160. Intersection of Two Linked Lists  🔗  📝
600. Non-negative Integers without Consecutive Ones  🔗  📝
🆓 👀 ⭐️⭐️⭐️
Dynamic Programming  🔗
198. House Robber  🔗  📝
213. House Robber II  🔗  📝
474. Ones and Zeroes  🔗  📝