- E 13. Roman to Integer
- E 14. Longest Common Prefix
- E 58. Length of Last Word
- E 66. Plus One
- M 161. One Edit Distance
- E 163. Missing Ranges
- E 168. Excel Sheet Column Title
- E 246. Strobogrammatic Number
- E 258. Add Digits
- E 293. Flip Game
- E 345. Reverse Vowels of a String
- E 422. Valid Word Square
- M 423. Reconstruct Original Digits from English
- E 482. License Key Formatting
- E 492. Construct the Rectangle
- E 507. Perfect Number
- E 520. Detect Capital
- E 521. Longest Uncommon Subsequence I
- M 537. Complex Number Multiplication
- M 573. Squirrel Simulation
- E 657. Robot Return to Origin
- E 661. Image Smoother
- E 709. To Lower Case
- E 728. Self Dividing Numbers
- E 747. Largest Number At Least Twice of Others
- E 748. Shortest Completing Word
- E 830. Positions of Large Groups
- M 831. Masking Personal Information
- E 859. Buddy Strings
- E 860. Lemonade Change
- M 874. Walking Robot Simulation
- M 912. Sort an Array
- E 929. Unique Email Addresses
- E 937. Reorder Data in Log Files
- E 944. Delete Columns to Make Sorted
- E 953. Verifying an Alien Dictionary
- E 989. Add to Array-Form of Integer
- E 1051. Height Checker
- E 1189. Maximum Number of Balloons
- E 1281. Subtract the Product and Sum of Digits of an Integer
- E 1304. Find N Unique Integers Sum up to Zero
- E 1313. Decompress Run-Length Encoded List
- E 1323. Maximum 69 Number
- E 1332. Remove Palindromic Subsequences
- E 1356. Sort Integers by The Number of 1 Bits
- E 1431. Kids With the Greatest Number of Candies
- E 1441. Build an Array With Stack Operations
- E 1464. Maximum Product of Two Elements in an Array
- E 1491. Average Salary Excluding the Minimum and Maximum Salary
- E 1518. Water Bottle
- E 1523. Count Odd Numbers in an Interval Range
- E 1528. Shuffle String
- E 1550. Three Consecutive Odds
- E 1598. Crawler Log Folder
- E 1662. Check If Two String Arrays are Equivalent
- E 1688. Count of Matches in Tournament
- M 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
- E 1704. Determine if String Halves Are Alike
- E 1716. Calculate Money in Leetcode Bank
- E 1822. Sign of the Product of an Array
- E 2089. Find Target Indices After Sorting Array
- M 2125. Number of Laser Beams in a Bank
- M 2161. Partition Array According to Given Pivot
- M 2162. Minimum Cost to Set Cooking Time
- E 2176. Count Equal and Divisible Pairs in an Array
- E 2264. Largest 3-Same-Digit Number in String
- E 2269. Find the K-Beauty of a Number
- E 2273. Find Resultant Array After Removing Anagrams
- E 2278. Percentage of Letter in String
- E 2283. Check if Number Has Equal Digit Count and Digit Value
- E 2293. Min Max Game
- E 2299. Strong Password Checker II
- E 2303. Calculate Amount Paid in Taxes
- E 2309. Greatest English Letter in Upper and Lower Case
- E 2315. Count Asterisks
- E 2341. Maximum Number of Pairs in Array
- E 2347. Best Poker Hand
- M 2391. Minimum Amount of Time to Collect Garbage
- E 2395. Find Subarrays With Equal Sum
- E 2413. Smallest Even Multiple
- E 2418. Sort the People
- E 2423. Remove Letter To Equalize Frequency
- E 2427. Number of Common Factors
- E 2432. The Employee That Worked on the Longest Task
- E 2437. Number of Valid Clock Times
- E 2441. Largest Positive Integer That Exists With Its Negative
- M 2443. Sum of Number and Its Reverse
- E 2446. Determine if Two Events Have Conflict
- E 2451. Odd String Difference
- E 2460. Apply Operations to an Array
- E 2455. Average Value of Even Numbers That Are Divisible by Three
- E 2469. Convert the Temperature
- E 2475. Number of Unequal Triplets in Array
- E 2490. Circular Sentence
- M 2507. Smallest Value After Replacing With Sum of Prime Factors
- E 2520. Count the Digits That Divide a Number
- M 2521. Distinct Prime Factors of Product of Array
- E 2525. Categorize Box According to Criteria
- E 2529. Maximum Count of Positive Integer and Negative Integer
- E 2535. Difference Between Element Sum and Digit Sum of an Array
- E 2544. Alternating Digit Sum
- E 2549. Count Distinct Numbers on Board
- E 2553. Separate the Digits in an Array
- E 2562. Find the Array Concatenation Value
- M 2579. Count Total Number of Colored Cells
- E 2582. Pass the Pillow
- E 2586. Count the Number of Vowel Strings in Range
- E 2591. Distribute Money to Maximum Children
- E 2595. Number of Even and Odd Bits
- E 2605. Form Smallest Number From Two Digit Arrays
- E 2639. Find the Width of Columns of a Grid
- E 2643. Row With Maximum Ones
- E 2651. Calculate Delayed Arrival Time
- E 2652. Sum Multiples
- E 2656. Maximum Sum With Exactly K Elements
- E 2678. Number of Senior Citizens
- E 2682. Find the Losers of the Circular Game
- E 2706. Buy Two Chocolates
- E 2733. Neither Minimum nor Maximum
- E 3110. Score of a String
- E 3190. Find Minimum Operations to Make All Elements Divisible by Three
- M 38. Count and Say
- M 50. Pow(x, n)
- M 339. Nested List Weight Sum
- M 341. Flatten Nested List Iterator
- M 394. Decode String
- M 544. Output Contest Matches
- H 761. Special Binary String
- M 779. K-th Symbol in Grammar
- M 984. String Without AAA or BBB
- E 1071. Greatest Common Divisor of Strings
- M 1291. Sequential Digits
- H 1611. Minimum One Bit Operations to Make Integers Zero
- H 2014. Longest Subsequence Repeated k Times
- M 2550. Count Collisions of Monkeys on a Polygon
- M 6. Zigzag Conversion
- E 9. Palindrome Number
- M 12. Integer to Roman
- M 43. Multiply Strings
- H 60. Permutation Sequence
- H 65. Valid Number
- H 68. Text Justification
- M 71. Simplify Path
- M 151. Reverse Words in a String
- M 165. Compare Version Numbers
- M 179. Largest Number
- M 271. Encode and Decode Strings
- H 273. Integer to English Words
- M 385. Mini Parser
- E 408. Valid Word Abbreviation
- M 418. Sentence Screen Fitting
- E 434. Number of Segments in a String
- M 439. Ternary Expression Parser
- M 443. String Compression
- E 459. Repeated Substring Pattern
- H 466. Count The Repetitions
- M 468. Validate IP Address
- M 522. Longest Uncommon Subsequence II
- M 539. Minimum Time Difference
- M 553. Optimal Division
- M 555. Split Concatenated Strings
- E 557. Reverse Words in a String III
- H 564. Find the Closest Palindrome
- M 592. Fraction Addition and Subtraction
- M 640. Solve the Equation
- M 670. Maximum Swap
- M 681. Next Closest Time
- M 686. Repeated String Match
- M 722. Remove Comments
- H 726. Number of Atoms
- H 736. Parse Lisp Expression
- H 770. Basic Calculator IV
- M 791. Custom Sort String
- E 796. Rotate String
- E 800. Similar RGB Color
- E 806. Number of Lines To Write String
- M 809. Expressive Words
- M 811. Subdomain Visit Count
- M 816. Ambiguous Coordinates
- E 819. Most Common Word
- E 824. Goat Latin
- M 833. Find And Replace in String
- H 843. Guess the Word
- M 880. Decoded String at Index
- H 902. Numbers At Most N Given Digit Set
- E 1021. Remove Outermost Parentheses
- H 1106. Parsing A Boolean Expression
- M 1190. Reverse Substrings Between Each Pair of Parentheses
- M 1233. Remove Sub-Folders from the Filesystem
- M 1328. Break a Palindrome
- E 1331. Rank Transform of an Array
- E 1422. Maximum Score After Splitting a String
- M 1545. Find Kth Bit in Nth Binary String
- E 1614. Maximum Nesting Depth of the Parentheses
- E 1758. Minimum Changes To Make Alternating Binary String
- M 1759. Count Number of Homogenous Substrings
- E 1768. Merge Strings Alternately
- M 1813. Sentence Similarity III
- E 1897. Redistribute Characters to Make All Strings Equal
- E 1903. Largest Odd Number in String
- E 1945. Sum of Digits of String After Convert
- E 1957. Delete Characters to Make Fancy String
- M 1980. Find Unique Binary String
- E 2000. Reverse Prefix of Word
- E 2108. Find First Palindromic String in the Array
- E 2255. Count Prefixes of a Given String
- M 2284. Sender With Largest Word Count
- M 2288. Apply Discount to Prices
- M 2343. Query Kth Smallest Trimmed Number
- M 2384. Largest Palindromic Number
- E 2409. Count Days Spent Together
- M 2414. Length of the Longest Alphabetical Continuous Substring
- M 2452. Words Within Two Edits of Dictionary
- H 2468. Split Message Based on Limit
- E 2496. Maximum Value of a String in an Array
- M 2575. Find the Divisibility Array of a String
- E 2696. Minimum String Length After Removing Substrings
- E 2697. Lexicographically Smallest Palindrome
- E 2710. Remove Trailing Zeros From a String
- E 2729. Check if The Number is Fascinating
- M 2734. Lexicographically Smallest String After Substring Operation
- E 2864. Maximum Odd Binary Number
- M 3163. String Compression III
- M 187. Repeated DNA Sequences
- H 1044. Longest Duplicate Substring
- M 1554. Strings Differ by One Character
- M 28. Find the Index of the First Occurrence in a String
- H 214. Shortest Palindrome
- H 1392. Longest Happy Prefix
- M 1764. Form Array by Concatenating Subarrays of Another Array
- H 2430. Maximum Deletions on a String
- M 31. Next Permutation
- M 186. Reverse Words in a String II
- E 228. Summary Ranges
- M 324. Wiggle Sort II
- E 350. Intersection of Two Arrays II
- M 370. Range Addition
- M 442. Find All Duplicates in an Array
- E 448. Find All Numbers Disappeared in an Array
- M 453. Minimum Moves to Equal Array Elements
- M 462. Minimum Moves to Equal Array Elements II
- E 485. Max Consecutive Ones
- E 495. Teemo Attacking
- E 506. Relative Ranks
- E 561. Array Partition
- M 565. Array Nesting
- E 605. Can Place Flowers
- E 645. Set Mismatch
- M 755. Pour Water
- E 821. Shortest Distance to a Character
- M 849. Maximize Distance to Closest Person
- E 896. Monotonic Array
- E 908. Smallest Range I
- E 922. Sort Array By Parity II
- H 927. Three Equal Parts
- M 985. Sum of Even Numbers After Queries
- E 1122. Relative Sort Array
- E 1365. How Many Numbers Are Smaller Than the Current Number
- M 1395. Count Number of Teams
- M 1442. Count Triplets That Can Form Two Arrays of Equal XOR
- E 1460. Make Two Arrays Equal by Reversing Subarrays
- E 1470. Shuffle the Array
- E 1502. Can Make Arithmetic Progression From Sequence
- M 1535. Find the Winner of an Array Game
- M 1630. Arithmetic Subarrays
- E 1636. Sort Array by Increasing Frequency
- M 1685. Sum of Absolute Differences in a Sorted Array
- M 1701. Average Waiting Time
- E 1732. Find the Highest Altitude
- M 1814. Count Nice Pairs in an Array
- M 1887. Reduction Operations to Make the Array Elements Equal
- E 1913. Maximum Product Difference Between Two Pairs
- E 1920. Build Array from Permutation
- E 1929. Concatenation of Array
- M 2028. Find Missing Observations
- H 2147. Number of Ways to Divide a Long Corridor
- M 2191. Sort the Jumbled Numbers
- E 2259. Remove Digit From Number to Maximize Result
- M 2260. Minimum Consecutive Cards to Pick Up
- M 2274. Maximum Consecutive Floors Without Special Floors
- M 2342. Max Sum of a Pair With Equal Sum of Digits
- M 2348. Number of Zero-Filled Subarrays
- E 2389. Longest Subsequence With Limited Sum
- M 2419. Longest Subarray With Maximum Bitwise AND
- M 2447. Number of Subarrays With GCD Equal to K
- M 2470. Number of Subarrays With LCM Equal to K
- M 2501. Longest Square Streak in an Array
- E 2609. Find the Longest Balanced Substring of a Binary String
- M 2615. Sum of Distances
- M 2644. Find the Maximum Divisibility Score
- E 2660. Determine the Winner of a Bowling Game
- M 2731. Movement of Robots
- M 3011. Find if Array Can Be Sorted
- M 325. Maximum Size Subarray Sum Equals k
- M 848. Shifting Letters
- M 930. Binary Subarrays With Sum
- M 1310. XOR Queries of a Subarray
- E 1480. Running Sum of 1d Array
- M 1493. Longest Subarray of 1's After Deleting One Element
- M 1508. Range Sum of Sorted Subarray Sums]
- M 1653. Minimum Deletions to Make String Balanced
- M 1894. Find the Student that Will Replace the Chalk
- M 2031. Count Subarrays With More Ones Than Zeros
- M 2070. Most Beautiful Item for Each Query
- M 2090. K Radius Subarray Averages
- M 2256. Minimum Average Difference
- M 2270. Number of Ways to Split Array
- H 2448. Minimum Cost to Make Array Equal
- M 2483. Minimum Penalty for a Shop
- E 2485. Find the Pivot Integer
- H 2488. Count Subarrays With Median K
- M 2559. Count Vowel Strings in Ranges
- E 2574. Left and Right Sum Differences
- M 2602. Minimum Operations to Make All Array Elements Equal
- M 2640. Find the Score of All Prefixes of an Array
- H 2681. Power of Heroes
- M 2938. Separate Black and White Balls
- M 57. Insert Interval
- M 56. Merge Intervals
- H 759. Employee Free Time
- M 1272. Remove Interval
- H 2158. Amount of New Area Painted Each Day
- M 2580. Count Ways to Group Overlapping Ranges
- H 798. Smallest Rotation with Highest Score
- H 995. Minimum Number of K Consecutive Bit Flips
- M 2381. Shifting Letters II
- M 36. Valid Sudoku
- M 48. Rotate Image
- M 54. Spiral Matrix
- M 59. Spiral Matrix II
- M 240. Search a 2D Matrix II
- M 361. Bomb Enemy
- E 463. Island Perimeter
- M 498. Diagonal Traverse
- M 531. Lonely Pixel I
- M 533. Lonely Pixel II
- E 566. Reshape the Matrix
- M 723. Candy Crush
- M 750. Number Of Corner Rectangles
- H 782. Transform to Chessboard
- M 835. Image Overlap
- M 840. Magic Squares In Grid
- E 867. Transpose Matrix
- E 883. Projection Area of 3D Shapes
- M 885. Spiral Matrix III
- E 892. Surface Area of 3D Shapes
- M 1138. Alphabet Board Path
- M 1329. Sort the Matrix Diagonally
- E 1337. The K Weakest Rows in a Matrix
- E 1351. Count Negative Numbers in a Sorted Matrix
- E 1380. Lucky Numbers in a Matrix
- E 1572. Matrix Diagonal Sum
- E 1582. Special Positions in a Binary Matrix
- M 1605. Find Valid Matrix Given Row and Column Sums
- E 2022. Convert 1D Array Into 2D Array
- M 2257. Count Unguarded Cells in the Grid
- E 2319. Check if Matrix Is X-Matrix
- M 2326. Spiral Matrix IV
- E 2373. Largest Local Values in a Matrix
- M 2428. Maximum Sum of an Hourglass
- M 2482. Difference Between Ones and Zeros in Row and Column
- E 2500. Delete Greatest Value in Each Row
- M 2545. Sort the Students by Their Kth Score
- H 2556. Disconnect Path in a Binary Matrix by at Most One Flip
- M 2661. First Completely Painted Row or Column
- M 2679. Sum in a Matrix
- M 3044. Most Frequent Prime
- M 304. Range Sum Query 2D - Immutable
- H 1074. Number of Submatrices That Sum to Target
- H 2132. Stamping the Grid
- M 2711. Difference of Number of Distinct Values on Diagonals
- M 2. Add Two Numbers
- M 19. Remove Nth Node From End of List
- M 21. Merge Two Sorted Lists
- M 24. Swap Nodes in Pairs
- H 25. Reverse Nodes in k-Group
- M 86. Partition List
- M 92. Reverse Linked List II
- M 138. Copy List with Random Pointer
- E 141. Linked List Cycle
- M 142. Linked List Cycle II
- M 143. Reorder List
- E 160. Intersection of Two Linked Lists
- E 206. Reverse Linked List
- M 234. Palindrome Linked List
- E 237. Delete Node in a Linked List
- M 328. Odd Even Linked List
- M 369. Plus One Linked List
- M 430. Flatten a Multilevel Doubly Linked List
- M 445. Add Two Numbers II
- M 708. Insert into a Sorted Circular Linked List
- M 725. Split Linked List in Parts
- M 817. Linked List Components
- E 876. Middle of the Linked List
- M 1171. Remove Zero Sum Consecutive Nodes from Linked List
- M 1669. Merge In Between Linked Lists
- M 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points
- M 2095. Delete the Middle Node of a Linked List
- M 2181. Merge Nodes in Between Zeros
- H 2296. Design a Text Editor
- M 2807. Insert Greatest Common Divisors in Linked List
- M 2816. Double a Number Represented as a Linked List
- M 3217. Delete Nodes From Linked List Present in Array
- M 3. Longest Substring Without Repeating Characters
- M 5. Longest Palindromic Substring
- M 11. Container With Most Water
- M 15. 3Sum
- M 16. 3Sum Closest
- E 26. Remove Duplicates from Sorted Array
- H 76. Minimum Window Substring
- E 88. Merge Sorted Array
- M 159. Longest Substring with At Most Two Distinct Characters
- M 167. Two Sum II - Input Array Is Sorted
- M 209. Minimum Size Subarray Sum
- M 244. Shortest Word Distance II
- M 340. Longest Substring with At Most K Distinct Characters
- M 395. Longest Substring with At Least K Repeating Characters
- M 424. Longest Repeating Character Replacement
- E 455. Assign Cookies
- M 457. Circular Array Loop
- M 481. Magical String
- H 548. Split Array with Equal Sum
- M 611. Valid Triangle Number
- H 632. Smallest Range Covering Elements from K Lists
- E 643. Maximum Average Subarray I
- M 647. Palindromic Substrings
- H 683. K Empty Slots
- M 713. Subarray Product Less Than K
- M 825. Friends Of Appropriate Ages
- M 826. Most Profit Assigning Work
- M 904. Fruit Into Baskets
- E 905. Sort Array By Parity
- E 977. Squares of a Sorted Array
- H 992. Subarrays with K Different Integers
- M 1004. Max Consecutive Ones III
- M 1052. Grumpy Bookstore Owner
- E 1089. Duplicate Zeros
- E 1099. Two Sum Less Than K
- M 1151. Minimum Swaps to Group All 1's Together
- M 1208. Get Equal Substrings Within Budget
- M 1237. Find Positive Integer Solution for a Given Equation
- M 1423. Maximum Points You Can Obtain from Cards
- M 1456. Maximum Number of Vowels in a Substring of Given Length
- M 1498. Number of Subsequences That Satisfy the Given Sum Condition
- M 1570. Dot Product of Two Sparse Vectors
- M 1574. Shortest Subarray to be Removed to Make Array Sorted
- H 1610. Maximum Number of Visible Points
- M 1658. Minimum Operations to Reduce X to Zero
- M 1695. Maximum Erasure Value
- M 1750. Minimum Length of String After Deleting Similar Ends
- H 1793. Maximum Score of a Good Subarray
- M 1838. Frequency of the Most Frequent Element
- H 2009. Minimum Number of Operations to Make Array Continuous
- M 2024. Maximize the Confusion of an Exam
- M 2134. Minimum Swaps to Group All 1's Together II
- M 2149. Rearrange Array Elements by Sign
- M 2261. K Divisible Elements Subarrays
- H 2302. Count Subarrays With Score Less Than K
- M 2332. The Latest Time to Catch a Bus
- E 2379. Minimum Recolors to Get K Consecutive Black Blocks
- H 2398. Maximum Number of Robots Within Budget
- M 2401. Longest Nice Subarray
- M 2410. Maximum Matching of Players With Trainers
- M 2411. Smallest Subarrays With Maximum Bitwise OR
- H 2444. Count Subarrays With Fixed Bounds
- M 2461. Maximum Sum of Distinct Subarrays With Length K
- M 2486. Append Characters to String to Make Subsequence
- M 2516. Take K of Each Character From Left and Right
- M 2537. Count the Number of Good Subarrays
- E 2540. Minimum Common Value
- M 2555. Maximize Win From Two Segments
- H 2565. Subsequence With the Minimum Score
- M 2653. Sliding Subarray Beauty
- M 2730. Find the Longest Semi-Repetitive Substring
- M 2958. Length of Longest Subarray With at Most K Frequency
- M 2962. Count Subarrays Where Max Element Appears at Least K Times
- M 3097. Shortest Subarray With OR at Least K II
- M 17. Letter Combinations of a Phone Number
- M 22. Generate Parentheses
- M 39. Combination Sum
- M 40. Combination Sum II
- M 46. Permutations
- M 47. Permutations II
- H 51. N-Queens
- H 52. N-Queens II
- M 77. Combinations
- M 79. Word Search
- M 93. Restore IP Addresses
- M 95. Unique Binary Search Trees II
- M 131. Palindrome Partitioning
- H 140. Word Break II
- M 216. Combination Sum III
- M 241. Different Ways to Add Parentheses
- M 247. Strobogrammatic Number II
- M 254. Factor Combinations
- E 267. Palindrome Permutation II
- H 282. Expression Add Operators
- M 291. Word Pattern II
- H 301. Remove Invalid Parentheses
- M 306. Additive Number
- M 320. Generalized Abbreviation
- H 332. Reconstruct Itinerary
- M 351. Android Unlock Patterns
- H 425. Word Squares
- H 472. Concatenated Words
- H 488. Zuma Game
- M 491. Non-decreasing Subsequences
- H 679. 24 Game
- M 756. Pyramid Transition Matrix
- M 797. All Paths From Source to Target
- M 842. Split Array into Fibonacci Sequence
- M 949. Largest Time for Given Digits
- M 967. Numbers With Same Consecutive Differences
- H 980. Unique Paths III
- H 1088. Confusing Number II
- H 1255. Maximum Score Words Formed by Letters
- M 1593. Split a String Into the Max Number of Unique Substrings
- M 1774. Closest Dessert Cost
- M 2044. Count Number of Maximum Bitwise-OR Subsets
- M 2597. The Number of Beautiful Subsets
- M 2698. Find the Punishment Number of an Integer
- M 2708. Maximum Strength of a Group
- M 102. Binary Tree Level Order Traversal
- H 126. Word Ladder II
- H 127. Word Ladder
- H 317. Shortest Distance from All Buildings
- M 417. Pacific Atlantic Water Flow
- M 433. Minimum Genetic Mutation
- M 490. The Maze
- M 529. Minesweeper
- M 542. 01 Matrix
- M 582. Kill Process
- H 675. Cut Off Trees for Golf Event
- H 749. Contain Virus
- M 752. Open the Lock
- H 773. Sliding Puzzle
- H 815. Bus Routes
- M 841. Keys and Rooms
- H 847. Shortest Path Visiting All Nodes
- H 854. K-Similar Strings
- H 864. Shortest Path to Get All Keys
- M 909. Snakes and Ladders
- M 994. Rotting Oranges
- M 1020. Number of Enclaves
- M 1091. Shortest Path in Binary Matrix
- M 1129. Shortest Path with Alternating Colors
- M 1162. As Far from Land as Possible
- M 1197. Minimum Knight Moves
- M 1254. Number of Closed Islands
- H 1263. Minimum Moves to Move a Box to Their Target Location
- H 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
- H 1293. Shortest Path in a Grid with Obstacles Elimination
- H 1345. Jump Game IV
- M 1609. Even Odd Tree
- M 1905. Count Sub Islands
- M 1926. Nearest Exit from Entrance in Maze
- H 2045. Second Minimum Time to Reach Destination
- H 2258. Escape the Spreading Fire
- H 2290. Minimum Obstacle Removal to Reach Corner
- M 2471. Minimum Number of Operations to Sort a Binary Tree by Level
- H 2493. Divide Nodes Into the Maximum Number of Groups
- H 2608. Shortest Cycle in a Graph
- M 2658. Maximum Number of Fish in a Grid
- M 133. Clone Graph
- M 200. Number of Islands
- M 323. Number of Connected Components in an Undirected Graph
- M 364. Nested List Weight Sum II
- H 489. Robot Room Cleaner
- M 694. Number of Distinct Islands
- M 695. Max Area of Island
- M 947. Most Stones Removed with Same Row or Column
- M 988. Smallest String Starting From Leaf
- M 1059. All Paths from Source Lead to Destination
- M 1219. Path with Maximum Gold
- M 1376. Time Needed to Inform All Employees
- H 1568. Minimum Number of Days to Disconnect Island
- M 1706. Where Will the Ball Fall
- E 1971. Find if Path Exists in Graph
- M 1992. Find All Groups of Farmland
- M 2101. Detonate the Maximum Bombs
- H 2440. Create Components With Same Value
- M 2467. Most Profitable Path in a Tree
- M 2477. Minimum Fuel Cost to Report to the Capital
-
H 1579. Remove Max Number of Edges to Keep Graph Fully Traversable
-
M 2316. Count Unreachable Pairs of Nodes in an Undirected Graph
-
M 1282. Group the People Given the Group Size They Belong To
-
M 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
-
M 1509. Minimum Difference Between Largest and Smallest Value in Three Moves
-
M 1647. Minimum Deletions to Make Character Frequencies Unique
-
E 1984. Minimum Difference Between Highest and Lowest of K Scores
-
M 2038. Remove Colored Pieces if Both Neighbors are the Same Color
-
M 2522. Partition String Into Substrings With Values at Most K
-
M 2914. Minimum Number of Changes to Make Binary String Beautiful
-
M 3191. Minimum Operations to Make Binary Array Elements Equal to One I
-
M 3192. Minimum Operations to Make Binary Array Elements Equal to One II
- E 1. Two Sum
- H 30. Substring with Concatenation of All Words
- M 128. Longest Consecutive Sequence
- E 170. Two Sum III - Data structure design
- E 205. Isomorphic Strings
- E 242. Valid Anagram
- M 288. Unique Word Abbreviation
- E 290. Word Pattern
- M 299. Bulls and Cows
- H 336. Palindrome Pairs
- E 349. Intersection of Two Arrays
- E 359. Logger Rate Limiter
- E 383. Ransom Note
- E 387. First Unique Character in a String
- E 389. Find the Difference
- M 398. Random Pick Index
- M 438. Find All Anagrams in a String
- M 451. Sort Characters By Frequency
- E 500. Keyboard Row
- M 523. Continuous Subarray Sum
- M 525. Contiguous Array
- M 554. Brick Wall
- M 560. Subarray Sum Equals K
- M 567. Permutation in String
- E 575. Distribute Candies
- E 594. Longest Harmonious Subsequence
- E 599. Minimum Index Sum of Two Lists
- M 609. Find Duplicate File in System
- E 697. Degree of an Array
- H 710. Random Pick with Blacklist
- E 734. Sentence Similarity
- E 760. Find Anagram Mappings
- E 771. Jewels and Stones
- M 792. Number of Matching Subsequences
- E 804. Unique Morse Code Words
- M 822. Card Flipping Game
- M 869. Reordered Power of 2
- M 873. Length of Longest Fibonacci Subsequence
- E 884. Uncommon Words from Two Sentences
- E 888. Fair Candy Swap
- M 890. Find and Replace Pattern
- M 893. Groups of Special-Equivalent Strings
- M 916. Word Subsets
- M 939. Minimum Area Rectangle
- E 961. N-Repeated Element in Size 2N Array
- M 974. Subarray Sums Divisible by K
- M 1010. Pairs of Songs With Total Durations Divisible by 60
- M 1152. Analyze User Website Visit Pattern
- H 1153. String Transforms Into Another String
- E 1160. Find Words That Can Be Formed by Characters
- E 1165. Single-Row Keyboard
- M 1198. Find Smallest Common Element in All Rows
- E 1207. Unique Number of Occurrences
- M 1218. Longest Arithmetic Subsequence of Given Difference
- H 1224. Maximum Equal Frequency
- M 1248. Count Number of Nice Subarrays
- M 1297. Maximum Number of Occurrences of a Substring
- M 1338. Reduce Array Size to The Half
- M 1347. Minimum Number of Steps to Make Two Strings Anagram
- M 1371. Find the Longest Substring Containing Vowels in Even Counts
- M 1424. Diagonal Traverse II
- M 1461. Check If a String Contains All Binary Codes of Size K
- M 1481. Least Number of Unique Integers after K Removals
- E 1496. Path Crossing
- M 1497. Check If Array Pairs Are Divisible by k
- E 1512. Number of Good Pairs
- M 1615. Maximal Network Rank
- M 1637. Widest Vertical Area Between Two Points Containing No Points
- M 1657. Determine if Two Strings Are Close
- M 1679. Max Number of K-Sum Pairs
- E 1684. Count the Number of Consistent Strings
- E 1700. Number of Students Unable to Eat Lunch
- M 1743. Restore the Array From Adjacent Pairs
- E 1832. Check if the Sentence Is Pangram
- M 1915. Number of Wonderful Substrings
- M 1930. Unique Length-3 Palindromic Subsequences
- M 2007. Find Original Array From Doubled Array
- M 2013. Detect Squares
- M 2023. Number of Pairs of Strings With Concatenation Equal to Target
- E 2053. Kth Distinct String in an Array
- M 2131. Longest Palindrome by Concatenating Two Letter Words
- M 2135. Count Words Obtained After Adding a Letter
- E 2215. Find the Difference of Two Arrays
- M 2225. Find Players With Zero or One Losses
- M 2244. Minimum Rounds to Complete All Tasks
- E 2287. Rearrange Characters to Make Target String
- M 2294. Partition Array Such That Maximum Difference Is K
- M 2295. Replace Elements in an Array
- H 2301. Match Substring After Replacement
- H 2306. Naming a Company
- E 2325. Decode the Message
- M 2345. Finding the Number of Visible Mountains
- E 2351. First Letter to Appear Twice
- M 2352. Equal Row and Column Pairs
- E 2357. Make Array Zero by Subtracting Equal Amounts
- M 2364. Count Number of Bad Pairs
- E 2367. Number of Arithmetic Triplets
- M 2374. Node With Highest Edge Score
- E 2399. Check Distances Between Same Letters
- E 2404. Most Frequent Even Element
- M 2405. Optimal Partition of String
- M 2442. Count Number of Distinct Integers After Reverse Operations
- M 2453. Destroy Sequential Targets
- M 2456. Most Popular Video Creator
- E 2465. Number of Distinct Averages
- E 2506. Count Pairs Of Similar Strings
- M 2512. Reward Top K Students
- E 2515. Shortest Distance to Target String in a Circular Array
- M 2531. Make Number of Distinct Characters Equal
- E 2570. Merge Two 2D Arrays by Summing Values
- M 2584. Split the Array to Make Coprime Products
- M 2588. Count the Number of Beautiful Subarrays
- H 2589. Minimum Time to Complete All Tasks
- M 2596. Check Knight Tour Configuration
- H 2598. Smallest Missing Non-negative Integer After Operations
- M 2610. Convert an Array Into a 2D Array With Conditions
- M 2657. Find the Prefix Common Array of Two Arrays
- E 2670. Find the Distinct Difference Array
- M 2671. Frequency Tracker
- M 2672. Number of Adjacent Elements With the Same Color
- E 2716. Minimize String Length
- M 2718. Sum of Matrix After Queries
- M 2785. Sort Vowels in a String
- M 2870. Minimum Number of Operations to Make Array Empty
- E 3005. Count Elements With Maximum Frequency
- M 3039. Apply Operations to Make String Empty
- E 20. Valid Parentheses
- M 150. Evaluate Reverse Polish Notation
- E 155. Min Stack
- H 224. Basic Calculator
- E 232. Implement Queue using Stacks
- M 484. Find Permutation
- H 591. Tag Validator
- M 636. Exclusive Time of Functions
- M 678. Valid Parenthesis String
- E 844. Backspace String Compare
- M 946. Validate Stack Sequences
- E 1047. Remove All Adjacent Duplicates In String
- M 1209. Remove All Adjacent Duplicates in String II
- M 1249. Minimum Remove to Make Valid Parentheses
- M 1381. Design a Stack With Increment Operation
- M 1472. Design Browser History
- E 1544. Make The String Great
- M 1717. Maximum Score From Removing Substrings
- M 2434. Using a Robot to Print the Lexicographically Smallest String
- H 2751. Robot Collisions]
- H 42. Trapping Rain Water
- H 84. Largest Rectangle in Histogram
- H 85. Maximal Rectangle
- M 316. Remove Duplicate Letters
- M 402. Remove K Digits
- M 456. 132 Pattern
- E 496. Next Greater Element I
- M 581. Shortest Unsorted Continuous Subarray
- M 739. Daily Temperatures
- H 768. Max Chunks To Make Sorted II
- M 795. Number of Subarrays with Bounded Maximum
- M 901. Online Stock Span
- M 907. Sum of Subarray Minimums
- M 962. Maximum Width Ramp
- M 1130. Minimum Cost Tree From Leaf Values
- M 1504. Count Submatrices With All Ones
- M 1673. Find the Most Competitive Subsequence
- M 1762. Buildings With an Ocean View
- H 1776. Car Fleet II
- M 1856. Maximum Subarray Min-Product
- H 1944. Number of Visible People in a Queue
- H 2281. Sum of Total Strength of Wizards
- M 2289. Steps to Make Array Non-decreasing
- H 2334. Subarray With Elements Greater Than Varying Threshold
- H 2454. Next Greater Element IV
- M 2487. Remove Nodes From Linked List
- E 225. Implement Stack using Queues
- M 281. Zigzag Iterator
- E 346. Moving Average from Data Stream
- M 353. Design Snake Game
- M 362. Design Hit Counter
- M 379. Design Phone Directory
- M 622. Design Circular Queue
- E 933. Number of Recent Calls
- M 1823. Find the Winner of the Circular Game
- H 239. Sliding Window Maximum
- H 862. Shortest Subarray with Sum at Least K
- H 1425. Constrained Subsequence Sum
- M 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
- H 1499. Max Value of Equation
- M 1696. Jump Game VI
- E 94. Binary Tree Inorder Traversal
- M 98. Validate Binary Search Tree
- E 100. Same Tree
- E 101. Symmetric Tree
- M 103. Binary Tree Zigzag Level Order Traversal
- E 104. Maximum Depth of Binary Tree
- M 105. Construct Binary Tree from Preorder and Inorder Traversal
- E 108. Convert Sorted Array to Binary Search Tree
- M 109. Convert Sorted List to Binary Search Tree
- E 111. Minimum Depth of Binary Tree
- E 112. Path Sum
- M 113. Path Sum II
- M 114. Flatten Binary Tree to Linked List
- M 117. Populating Next Right Pointers in Each Node II
- H 124. Binary Tree Maximum Path Sum
- M 129. Sum Root to Leaf Numbers
- M 144. Binary Tree Preorder Traversal
- E 145. Binary Tree Postorder Traversal
- M 156. Binary Tree Upside Down
- M 199. Binary Tree Right Side View
- M 222. Count Complete Tree Nodes
- E 226. Invert Binary Tree
- E 235. Lowest Common Ancestor of a Binary Search Tree
- M 236. Lowest Common Ancestor of a Binary Tree
- M 250. Count Univalue Subtrees
- M 255. Verify Preorder Sequence in Binary Search Tree
- H 272. Closest Binary Search Tree Value II
- M 285. Inorder Successor in BST
- H 297. Serialize and Deserialize Binary Tree
- M 298. Binary Tree Longest Consecutive Sequence
- M 314. Binary Tree Vertical Order Traversal
- M 331. Verify Preorder Serialization of a Binary Tree
- M 333. Largest BST Subtree
- M 337. House Robber III
- M 366. Find Leaves of Binary Tree
- M 426. Convert Binary Search Tree to Sorted Doubly Linked List
- H 428. Serialize and Deserialize N-ary Tree
- M 429. N-ary Tree Level Order Traversal
- M 449. Serialize and Deserialize BST
- E 501. Find Mode in Binary Search Tree
- M 508. Most Frequent Subtree Sum
- M 510. Inorder Successor in BST II
- M 515. Find Largest Value in Each Tree Row
- E 530. Minimum Absolute Difference in BST
- M 536. Construct Binary Tree from String
- E 543. Diameter of Binary Tree
- M 545. Boundary of Binary Tree
- M 549. Binary Tree Longest Consecutive Sequence II
- E 559. Maximum Depth of N-ary Tree
- E 563. Binary Tree Tilt
- E 590. N-ary Tree Postorder Traversal
- E 606. Construct String from Binary Tree
- M 623. Add One Row to Tree
- E 637. Average of Levels in Binary Tree
- M 652. Find Duplicate Subtrees
- E 653. Two Sum IV - Input is a BST
- M 655. Print Binary Tree
- M 662. Maximum Width of Binary Tree
- M 663. Equal Tree Partition
- M 666. Path Sum IV
- E 671. Second Minimum Node In a Binary Tree
- M 687. Longest Univalue Path
- M 742. Closest Leaf in a Binary Tree
- M 776. Split BST
- E 783. Minimum Distance Between BST Nodes
- M 814. Binary Tree Pruning
- H 834. Sum of Distances in Tree
- M 863. All Nodes Distance K in Binary Tree
- M 865. Smallest Subtree with all the Deepest Nodes
- E 872. Leaf-Similar Trees
- M 889. Construct Binary Tree from Preorder and Postorder Traversal
- M 919. Complete Binary Tree Inserter
- E 938. Range Sum of BST
- M 951. Flip Equivalent Binary Trees
- M 958. Check Completeness of a Binary Tree
- M 979. Distribute Coins in Binary Tree
- E 993. Cousins in Binary Tree
- M 1008. Construct Binary Search Tree from Preorder Traversal
- E 1022. Sum of Root To Leaf Binary Numbers
- M 1026. Maximum Difference Between Node and Ancestor
- M 1038. Binary Search Tree to Greater Sum Tree
- M 1110. Delete Nodes And Return Forest
- M 1123. Lowest Common Ancestor of Deepest Leaves
- M 1161. Maximum Level Sum of a Binary Tree
- M 1273. Delete Tree Nodes
- M 1302. Deepest Leaves Sum
- M 1339. Maximum Product of Splitted Binary Tree
- M 1361. Validate Binary Tree Nodes
- M 1367. Linked List in Binary Tree
- M 1372. Longest ZigZag Path in a Binary Tree
- M 1382. Balance a Binary Search Tree
- M 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
- M 1443. Minimum Time to Collect All Apples in a Tree
- M 1448. Count Good Nodes in Binary Tree
- M 1457. Pseudo-Palindromic Paths in a Binary Tree
- M 1466. Reorder Routes to Make All Paths Lead to the City Zero
- M 1506. Find Root of N-Ary Tree
- M 1519. Number of Nodes in the Sub-Tree With the Same Label
- M 1530. Number of Good Leaf Nodes Pairs
- M 1650. Lowest Common Ancestor of a Binary Tree III
- M 2096. Step-By-Step Directions From a Binary Tree Node to Another
- M 2196. Create Binary Tree From Descriptions
- H 2246. Longest Path With Different Adjacent Characters
- M 2265. Count Nodes Equal to Average of Subtree
- H 2277. Closest Node to Path in Tree
- H 2322. Minimum Score After Removals on a Tree
- E 2331. Evaluate Boolean Binary Tree
- M 2368. Reachable Nodes With Restrictions
- M 2385. Amount of Time for Binary Tree to Be Infected
- M 2415. Reverse Odd Levels of Binary Tree
- H 2458. Height of Binary Tree After Subtree Removal Queries
- H 2509. Cycle Length Queries in a Tree
- H 2538. Difference Between Maximum and Minimum Price Sum
- H 2581. Count Number of Possible Root Nodes
- M 2583. Kth Largest Sum in a Binary Tree
- H 2603. Collect Coins in a Tree
- M 2641. Cousins in Binary Tree II
- H 352. Data Stream as Disjoint Intervals
- M 436. Find Right Interval
- M 635. Design Log Storage System
- H 699. Falling Squares
- H 715. Range Module
- M 729. My Calendar I
- M 731. My Calendar II
- H 732. My Calendar III
- M 855. Exam Room
- H 975. Odd Even Jump
- M 981. Time Based Key-Value Store
- H 987. Vertical Order Traversal of a Binary Tree
- M 1094. Car Pooling
- E 1854. Maximum Population Year
- M 2015. Average Height of Buildings in Each Segment
- H 2276. Count Integers in Intervals
- M 2336. Smallest Number in Infinite Set
- M 2349. Design a Number Container System
- E 2363. Merge Similar Items
- H 2382. Maximum Segment Sum After Removals
- M 2406. Divide Intervals Into Minimum Number of Groups
- H 218. The Skyline Problem
- M 220. Contains Duplicate III
- H 480. Sliding Window Median
- M 1244. Design A Leaderboard
- H 1825. Finding MK Average
- M 2034. Stock Price Fluctuation
- H 23. Merge k Sorted Lists
- M 215. Kth Largest Element in an Array
- M 253. Meeting Rooms II
- H 295. Find Median from Data Stream
- M 313. Super Ugly Number
- M 347. Top K Frequent Elements
- M 355. Design Twitter
- H 358. Rearrange String k Distance Apart
- M 373. Find K Pairs with Smallest Sums
- H 407. Trapping Rain Water II
- H 502. IPO
- M 621. Task Scheduler
- M 692. Top K Frequent Words
- E 703. Kth Largest Element in a Stream
- M 767. Reorganize String
- M 973. K Closest Points to Origin
- E 1046. Last Stone Weight
- M 1167. Minimum Cost to Connect Sticks
- M 1229. Meeting Scheduler
- M 1353. Maximum Number of Events That Can Be Attended
- H 1383. Maximum Performance of a Team
- M 1405. Longest Happy String
- H 1606. Find Servers That Handled Most Number of Requests
- M 1642. Furthest Building You Can Reach
- M 1834. Single-Threaded CPU
- M 1845. Seat Reservation Manager
- H 1851. Minimum Interval to Include Each Query
- M 1942. The Number of the Smallest Unoccupied Chair
- M 1962. Remove Stones to Minimize the Total
- M 1985. Find the Kth Largest Integer in the Array
- H 2163. Minimum Difference in Sums After Removal of Elements
- H 2386. Find the K-Sum of an Array
- H 2402. Meeting Rooms III
- M 2462. Total Cost to Hire K Workers
- H 2503. Maximum Number of Points From Grid Queries
- M 2530. Maximal Score After Applying K Operations
- H 2532. Time to Cross a Bridge
- E 2558. Take Gifts From the Richest Pile
- M 2593. Find Score of an Array After Marking All Elements
- M 3075. Maximize Happiness of Selected Children
- M 3080. Mark Elements on Array by Performing Queries
- M 399. Evaluate Division
- M 886. Possible Bipartition
- M 934. Shortest Bridge
- E 997. Find the Town Judge
- E 1436. Destination City
- E 1791. Find Center of Star Graph
- M 2497. Maximum Star Sum of a Graph
- M 2359. Find Closest Node to Given Two Nodes
- H 2360. Longest Cycle in a Graph
- H 2508. Add Edges to Make Degrees of All Nodes Even
- H 499. The Maze III
- M 505. The Maze II
- M 743. Network Delay Time
- H 778. Swim in Rising Water
- H 882. Reachable Nodes In Subdivided Graph
- H 2617. Minimum Number of Visited Cells in a Grid
- H 2642. Design Graph With Shortest Path Calculator
- H 2699. Modify Graph Edge Weights
- M 2812. Find the Safest Path in a Grid
- M 207. Course Schedule
- M 210. Course Schedule II
- H 269. Alien Dictionary
- M 310. Minimum Height Trees
- H 329. Longest Increasing Path in a Matrix
- M 444. Sequence Reconstruction
- M 802. Find Eventual Safe States
- M 851. Loud and Rich
- M 1136. Parallel Courses
- H 1203. Sort Items by Groups Respecting Dependencies
- M 1557. Minimum Number of Vertices to Reach All Nodes
- H 1857. Largest Color Value in a Directed Graph
- H 2050. Parallel Courses III
- H 2115. Find All Possible Recipes from Given Supplies
- H 2127. Maximum Employees to Be Invited to a Meeting
- M 2192. All Ancestors of a Node in a Directed Acyclic Graph
- H 2392. Build a Matrix With Conditions
- M 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
- M 2976. Minimum Cost to Convert String I
- H 4. Median of Two Sorted Arrays
- M 33. Search in Rotated Sorted Array
- M 34. Find First and Last Position of Element in Sorted Array
- E 35. Search Insert Position
- M 275. H-Index II
- E 278. First Bad Version
- E 326. Power of Three
- H 354. Russian Doll Envelopes
- H 363. Max Sum of Rectangle No Larger Than K
- E 367. Valid Perfect Square
- E 374. Guess Number Higher or Lower
- M 378. Kth Smallest Element in a Sorted Matrix
- E 441. Arranging Coins
- M 475. Heaters
- H 483. Smallest Good Base
- M 497. Random Point in Non-overlapping Rectangles
- M 528. Random Pick with Weight
- M 540. Single Element in a Sorted Array
- H 644. Maximum Average Subarray II
- M 658. Find K Closest Elements
- M 702. Search in a Sorted Array of Unknown Size
- E 704. Binary Search
- H 719. Find K-th Smallest Pair Distance
- E 744. Find Smallest Letter Greater Than Target
- H 774. Minimize Max Distance to Gas Station
- M 786. K-th Smallest Prime Fraction
- H 793. Preimage Size of Factorial Zeroes Function
- E 852. Peak Index in a Mountain Array
- M 875. Koko Eating Bananas
- H 878. Nth Magical Number
- M 1011. Capacity To Ship Packages Within D Days
- M 1062. Longest Repeating Substring
- M 1060. Missing Element in Sorted Array
- H 1095. Find in Mountain Array
- H 1231. Divide Chocolate
- E 1287. Element Appearing More Than 25% In Sorted Array
- M 1428. Leftmost Column with at Least a One
- M 1482. Minimum Number of Days to Make m Bouquets
- E 1539. Kth Missing Positive Number
- M 1552. Magnetic Force Between Two Balls
- E 1608. Special Array With X Elements Greater Than or Equal X
- H 1755. Closest Subsequence Sum
- M 1802. Maximum Value at a Given Index in a Bounded Array
- H 1847. Closest Room
- M 1870. Minimum Speed to Arrive on Time
- M 1885. Count Pairs in Two Arrays
- M 1918. Kth Smallest Subarray Sum
- H 1970. Last Day Where You Can Still Cross
- H 2035. Partition Array Into Two Arrays to Minimize Sum Difference
- M 2064. Minimized Maximum of Products Distributed to Any Store
- H 2141. Maximum Running Time of N Computers
- M 2187. Minimum Time to Complete Trips
- M 2271. Maximum White Tiles Covered by a Carpet
- M 2300. Successful Pairs of Spells and Potions
- M 2305. Fair Distribution of Cookies
- M 2333. Minimum Sum of Squared Difference
- H 2354. Number of Excellent Pairs
- M 2476. Closest Nodes Queries in a Binary Search Tree
- M 2513. Minimize the Maximum of Two Arrays
- M 2517. Maximum Tastiness of Candy Basket
- H 2528. Maximize the Minimum Powered City
- M 2560. House Robber IV
- M 2563. Count the Number of Fair Pairs
- M 2594. Minimum Time to Repair Cars
- M 2616. Minimize the Maximum Difference of Pairs
- M 300. Longest Increasing Subsequence Its variance (e.g., 673) should be solved by DP.
- H 1671. Minimum Number of Removals to Make Mountain Array
- H 1964. Find the Longest Valid Obstacle Course at Each Position
- H 10. Regular Expression Matching
- H 44. Wildcard Matching
- M 62. Unique Paths
- M 63. Unique Paths II
- M 64. Minimum Path Sum
- E 70. Climbing Stairs
- H 72. Edit Distance
- H 87. Scramble String
- M 91. Decode Ways
- M 96. Unique Binary Search Trees
- M 97. Interleaving String
- H 115. Distinct Subsequences
- E 118. Pascal's Triangle
- M 120. Triangle
- H 123. Best Time to Buy and Sell Stock III
- M 139. Word Break
- M 152. Maximum Product Subarray
- H 174. Dungeon Game
- H 188. Best Time to Buy and Sell Stock IV
- M 198. House Robber
- M 213. House Robber II
- M 238. Product of Array Except Self
- M 256. Paint House
- M 264. Ugly Number II
- H 265. Paint House II
- M 276. Paint Fence
- M 279. Perfect Squares
- M 294. Flip Game II
- M 309. Best Time to Buy and Sell Stock with Cooldown
- H 312. Burst Balloons
- M 322. Coin Change
- M 343. Integer Break
- M 368. Largest Divisible Subset
- M 375. Guess Number Higher or Lower II
- M 376. Wiggle Subsequence
- M 377. Combination Sum IV
- M 396. Rotate Function
- M 397. Integer Replacement
- H 403. Frog Jump
- M 416. Partition Equal Subset Sum
- H 446. Arithmetic Slices II - Subsequence
- M 464. Can I Win
- M 467. Unique Substrings in Wraparound String
- H 471. Encode String with Shortest Length
- M 473. Matchsticks to Square
- M 474. Ones and Zeroes
- M 486. Predict the Winner
- M 487. Max Consecutive Ones II
- M 494. Target Sum
- E 509. Fibonacci Number
- H 514. Freedom Trail
- M 516. Longest Palindromic Subsequence
- M 518. Coin Change 2
- M 526. Beautiful Arrangement
- H 546. Remove Boxes
- H 552. Student Attendance Record II
- M 562. Longest Line of Consecutive One in Matrix
- H 568. Maximum Vacation Days
- M 576. Out of Boundary Paths
- M 583. Delete Operation for Two Strings
- H 600. Non-negative Integers without Consecutive Ones
- H 629. K Inverse Pairs Array
- M 634. Find the Derangement of An Array
- M 638. Shopping Offers
- H 639. Decode Ways II
- M 650. 2 Keys Keyboard
- M 651. 4 Keys Keyboard
- H 656. Coin Path
- H 664. Strange Printer
- M 673. Number of Longest Increasing Subsequence
- M 688. Knight Probability in Chessboard
- H 689. Maximum Sum of 3 Non-Overlapping Subarrays
- H 691. Stickers to Spell Word
- M 698. Partition to K Equal Sum Subsets
- M 712. Minimum ASCII Delete Sum for Two Strings
- M 714. Best Time to Buy and Sell Stock with Transaction Fee
- M 718. Maximum Length of Repeated Subarray
- H 727. Minimum Window Subsequence
- H 730. Count Different Palindromic Subsequences
- H 741. Cherry Pickup
- E 746. Min Cost Climbing Stairs
- M 764. Largest Plus Sign
- M 788. Rotated Digits
- M 790. Domino and Tromino Tiling
- M 799. Champagne Tower
- H 801. Minimum Swaps To Make Sequences Increasing
- H 805. Split Array With Same Average
- M 808. Soup Servings
- M 813. Largest Sum of Averages
- H 818. Race Car
- M 823. Binary Trees With Factors
- M 837. New 21 Game
- M 838. Push Dominoes
- M 845. Longest Mountain in Array
- H 879. Profitable Schemes
- H 887. Super Egg Drop
- M 894. All Possible Full Binary Trees
- M 898. Bitwise ORs of Subarrays
- H 903. Valid Permutations for DI Sequence
- H 913. Cat and Mouse
- M 915. Partition Array into Disjoint Intervals
- M 931. Minimum Falling Path Sum
- M 935. Knight Dialer
- H 940. Distinct Subsequences II
- H 943. Find the Shortest Superstring
- H 956. Tallest Billboard
- M 978. Longest Turbulent Subarray
- M 983. Minimum Cost For Tickets
- H 1000. Minimum Cost to Merge Stones
- M 1027. Longest Arithmetic Subsequence
- M 1035. Uncrossed Lines
- M 1043. Partition Array for Maximum Sum
- M 1048. Longest String Chain
- M 1049. Last Stone Weight II
- M 1066. Campus Bikes II
- H 1067. Digit Count in Range
- H 1092. Shortest Common Supersequence
- M 1105. Filling Bookcase Shelves
- H 1125. Smallest Sufficient Team
- E 1137. N-th Tribonacci Number
- M 1140. Stone Game II
- M 1143. Longest Common Subsequence
- M 1155. Number of Dice Rolls With Target Sum
- M 1182. Shortest Distance to Target Color
- M 1186. Maximum Subarray Sum with One Deletion
- H 1187. Make Array Strictly Increasing
- H 1216. Valid Palindrome III
- H 1220. Count Vowels Permutation
- M 1230. Toss Strange Coins
- H 1235. Maximum Profit in Job Scheduling
- H 1240. Tiling a Rectangle with the Fewest Squares
- H 1246. Palindrome Removal
- H 1259. Handshakes That Don't Cross
- H 1269. Number of Ways to Stay in the Same Place After Some Steps
- M 1277. Count Square Submatrices with All Ones
- H 1278. Palindrome Partitioning III
- H 1289. Minimum Falling Path Sum II
- H 1312. Minimum Insertion Steps to Make a String Palindrome
- H 1335. Minimum Difficulty of a Job Schedule
- H 1349. Maximum Students Taking Exam
- M 1387. Sort Integers by The Power Value
- H 1406. Stone Game III
- H 1411. Number of Ways to Paint N × 3 Grid
- H 1416. Restore The Array
- H 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons
- H 1434. Number of Ways to Wear Different Hats to Each Other
- H 1444. Number of Ways of Cutting a Pizza
- H 1458. Max Dot Product of Two Subsequences
- H 1463. Cherry Pickup II
- H 1473. Paint House III
- H 1478. Allocate Mailboxes
- H 1494. Parallel Courses II
- H 1510. Stone Game IV
- H 1531. String Compression II
- H 1547. Minimum Cost to Cut a Stick
- H 1575. Count All Possible Routes
- M 1626. Best Team With No Conflicts
- H 1639. Number of Ways to Form a Target String Given a Dictionary
- M 1641. Count Sorted Vowel Strings
- H 1655. Distribute Repeating Integers
- M 1682. Longest Palindromic Subsequence II
- H 1687. Delivering Boxes from Storage to Ports
- H 1691. Maximum Height by Stacking Cuboids
- H 1692. Count Ways to Distribute Candies
- M 1746. Maximum Subarray Sum After One Operation
- H 1751. Maximum Number of Events That Can Be Attended II
- M 1770. Maximum Score from Performing Multiplication Operations
- H 1799. Maximize Score After N Operations
- H 1815. Maximum Number of Groups Getting Fresh Donuts
- H 1879. Minimum XOR Sum of Two Arrays
- H 1866. Number of Ways to Rearrange Sticks With K Sticks Visible
- M 1884. Egg Drop With 2 Eggs and N Floors
- M 1937. Maximum Number of Points with Cost
- M 1986. Minimum Number of Work Sessions to Finish the Tasks
- H 2088. Count Fertile Pyramids in a Land
- M 2140. Solving Questions With Brainpower
- H 2172. Maximum AND Sum of Array
- M 2174. Remove All Ones With Row and Column Flips II
- M 2266. Count Number of Texts
- H 2267. Check if There Is a Valid Parentheses String Path
- M 2304. Minimum Path Cost in a Grid
- H 2312. Selling Pieces of Wood
- H 2318. Number of Distinct Roll Sequences
- M 2320. Count Number of Ways to Place Houses
- M 2327. Number of People Aware of a Secret
- H 2328. Number of Increasing Paths in a Grid
- H 2338. Count the Number of Ideal Arrays
- H 2355. Maximum Number of Books You Can Take
- M 2369. Check if There is a Valid Partition For The Array
- M 2370. Longest Ideal Subsequence
- H 2376. Count Special Integers
- M 2420. Find All Good Indices
- H 2435. Paths in Matrix Whose Sum Is Divisible by K
- H 2463. Minimum Total Distance Traveled
- M 2466. Count Ways To Build Good Strings
- H 2472. Maximum Number of Non-overlapping Palindrome Substrings
- H 2478. Number of Beautiful Partitions
- H 2484. Count Palindromic Subsequences
- E 2511. Maximum Enemy Forts That Can Be Captured
- H 2518. Number of Great Partitions
- H 2547. Minimum Cost to Split an Array
- H 2585. Number of Ways to Earn Points
- M 2684. Maximum Number of Moves in a Grid
- M 2707. Extra Characters in a String
- H 2713. Maximum Strictly Increasing Cells in a Matrix
- H 2742. Painting the Walls
- H 3193. Count the Number of Inversions
- H 828. Count Unique Characters of All Substrings of a Given String
- H 2262. Total Appeal of A String
- H 2719. Count of Integers
- H 327. Count of Range Sum
- M 372. Super Pow
- M 932. Beautiful Array
- H 1569. Number of Ways to Reorder Array to Get Same BST
- M 29. Divide Two Integers
- E 67. Add Binary
- M 78. Subsets
- M 137. Single Number II
- E 190. Reverse Bits
- E 191. Number of 1 Bits
- M 201. Bitwise AND of Numbers Range
- E 231. Power of Two
- M 260. Single Number III
- E 268. Missing Number
- M 318. Maximum Product of Word Lengths
- E 338. Counting Bits
- E 342. Power of Four
- M 371. Sum of Two Integers
- M 393. UTF-8 Validation
- E 401. Binary Watch
- E 405. Convert a Number to Hexadecimal
- H 411. Minimum Unique Word Abbreviation
- E 461. Hamming Distance
- E 476. Number Complement
- M 477. Total Hamming Distance
- E 693. Binary Number with Alternating Bits
- M 751. IP to CIDR
- E 762. Prime Number of Set Bits in Binary Representation
- E 868. Binary Gap
- E 1009. Complement of Base 10 Integer
- M 1239. Maximum Length of a Concatenated String with Unique Characters
- E 1290. Convert Binary Number in a Linked List to Integer
- M 1318. Minimum Flips to Make a OR b Equal to c
- E 1342. Number of Steps to Reduce a Number to Zero
- M 1386. Cinema Seat Allocation
- M 1404. Number of Steps to Reduce a Number in Binary Representation to One
- H 1601. Maximum Number of Achievable Transfer Requests
- M 1680. Concatenation of Consecutive Binary Numbers
- M 1829. Maximum XOR for Each Query
- E 1863. Sum of All Subset XOR Totals
- E 2220. Minimum Bit Flips to Convert Number
- M 2275. Largest Combination With Bitwise AND Greater Than Zero
- E 2317. Maximum XOR After Operations
- M 2397. Maximum Rows Covered by Columns
- M 2425. Bitwise XOR of All Pairings
- M 2429. Minimize XOR
- M 2433. Find The Original Array of Prefix Xor
- M 2438. Range Product Queries of Powers
- M 2527. Find Xor-Beauty of Array
- M 2546. Apply Bitwise Operations to Make Strings Equal
- M 2564. Substring XOR Queries
- M 2568. Minimum Impossible OR
- M 2680. Maximum OR
- M 2683. Neighboring Bitwise XOR
- M 2997. Minimum Number of Operations to Make Array XOR Equal to K
- M 3133. Minimum Array End
- M 208. Implement Trie (Prefix Tree)
- M 211. Design Add and Search Words Data Structure
- H 212. Word Search II
- H 527. Word Abbreviation
- M 616. Add Bold Tag in String
- H 642. Design Search Autocomplete System
- M 648. Replace Words
- H 745. Prefix and Suffix Search
- M 758. Bold Words in String
- M 820. Short Encoding of Words
- H 2416. Sum of Prefix Scores of Strings
- M 3043. Find the Length of the Longest Common Prefix
- M 307. Range Sum Query - Mutable
- H 308. Range Sum Query 2D - Mutable
- H 315. Count of Smaller Numbers After Self
- H 493. Reverse Pairs
- H 1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits
- H 2179. Count Good Triplets in an Array
- H 2426. Number of Pairs Satisfying Inequality
- H 2552. Count Increasing Quadruplets
- H 149. Max Points on a Line
- M 223. Rectangle Area
- H 335. Self Crossing
- M 356. Line Reflection
- H 391. Perfect Rectangle
- M 469. Convex Polygon
- M 478. Generate Random Point in a Circle
- H 711. Number of Distinct Islands II
- M 789. Escape The Ghosts
- E 812. Largest Triangle Area
- E 836. Rectangle Overlap
- M 858. Mirror Reflection
- E 1232. Check If It Is a Straight Line
- E 1266. Minimum Time Visiting All Points
- M 2280. Minimum Lines to Represent a Line Chart
- M 3047. Find the Largest Area of Square Inside Two Rectangles
- M 146. LRU Cache
- H 158. Read N Characters Given read4 II - Call Multiple Times
- M 251. Flatten 2D Vector
- M 380. Insert Delete GetRandom O(1)
- H 381. Insert Delete GetRandom O(1) - Duplicates allowed
- H 432. All O`one Data Structure
- H 460. LFU Cache
- M 519. Random Flip Matrix
- E 604. Design Compressed String Iterator
- M 641. Design Circular Deque
- H 716. Max Stack
- M 911. Online Election
- M 1146. Snapshot Array
- M 1352. Product of the Last K Numbers
- M 2353. Design a Food Rating System
- M 2502. Design Memory Allocator
- H 2272. Substring With Largest Variance
- H 2321. Maximum Score Of Spliced Array
- M 2606. Find the Substring With Maximum Cost
- M 7. Reverse Integer
- M 89. Gray Code
- M 166. Fraction to Recurring Decimal
- M 172. Factorial Trailing Zeroes
- H 233. Number of Digit One
- E 263. Ugly Number
- E 292. Nim Game
- M 319. Bulb Switcher
- M 357. Count Numbers with Unique Digits
- M 360. Sort Transformed Array
- M 386. Lexicographical Numbers
- M 390. Elimination Game
- M 400. Nth Digit
- H 440. K-th Smallest in Lexicographical Order
- M 470. Implement Rand10() Using Rand7()
- H 479. Largest Palindrome Product
- E 504. Base 7
- E 628. Maximum Product of Three Numbers
- M 633. Sum of Square Numbers
- H 660. Remove 9
- M 667. Beautiful Arrangement II
- M 672. Bulb Switcher II
- M 754. Reach a Number
- M 775. Global and Local Inversions
- H 780. Reaching Points
- H 810. Chalkboard XOR Game
- H 829. Consecutive Numbers Sum
- M 866. Prime Palindrome
- H 891. Sum of Subsequence Widths
- H 899. Orderly Queue
- H 906. Super Palindromes
- E 914. X of a Kind in a Deck of Cards
- H 964. Least Operators to Express Number
- H 1012. Numbers With Repeated Digits
- H 1359. Count All Valid Pickup and Delivery Options
- H 1363. Largest Multiple of Three
- M 1551. Minimum Operations to Make Array Equal
- H 1643. Kth Smallest Instructions
- M 2128. Remove All Ones With Row and Column Flips
- M 2178. Maximum Split of Positive Even Integers
- M 2310. Sum of Numbers With Units Digit K
- E 2335. Minimum Amount of Time to Fill Cups
- H 2344. Minimum Deletions to Make Array Divisible
- M 2396. Strictly Palindromic Number
- M 2400. Number of Ways to Reach a Position After Exactly k Steps
- E 2481. Minimum Cuts to Divide a Circle
- H 2514. Count Anagrams
- M 2523. Closest Prime Numbers in Range
- H 2543. Check if Point Is Reachable
- M 2645. Minimum Additions to Make Valid String
- M 2654. Minimum Number of Operations to Make All Array Elements Equal to 1
- M 2849. Determine if a Cell Is Reachable at a Given Time
- OI Wiki
- Competitive programming
- Binary search
- Monotonic stack
- Collision issues in unordered_map
- Algorithms for Competitive Programming
// to iterate subset
for (int subset = state; subset; subset = (subset - 1) & state) {}
// to get difference set
int differentSet = state ^ subset;
// A is B's subset?
bool isSubset = (A & B) == A;
// to remove the rightest 1 (e.g., 0100100 & 0111011 -> 0100000)
x = x & (x - 1)long long mod = 1e9 + 7;
long long inv(long long a) {
if (a == 1) return 1;
return (mod - mod / a) * inv(mod % a) % mod;
}
int comb(int n, int k) {
long long res = 1L;
for (int i = 0; i < k; ++i) {
res = res * (n - i) % mod;
res = res * inv(i + 1) % mod;
}
return (int)(res % mod);
}