Combinatorics Problems
49 Combinatorics LeetCode problems · Solve with AI-powered hints & step-by-step explanations.
Learn the coding interview patterns behind these problems.
Start with these
All Combinatorics problems
62 Unique Paths Medium458 Poor Pigs Hard920 Number of Music Playlists Hard1201 Ugly Number III Medium1359 Count All Valid Pickup and Delivery Options Hard1467 Probability of a Two Boxes Having The Same Number of Distinct Balls Hard1569 Number of Ways to Reorder Array to Get Same BST Hard1621 Number of Sets of K Non-Overlapping Line Segments Medium1641 Count Sorted Vowel Strings Medium1643 Kth Smallest Instructions Hard1735 Count Ways to Make Array With Product Hard1830 Minimum Number of Operations to Make String Sorted Hard1863 Sum of All Subset XOR Totals Easy1866 Number of Ways to Rearrange Sticks With K Sticks Visible Hard1916 Count Ways to Build Rooms in an Ant Colony Hard2063 Vowels of All Substrings Medium2221 Find Triangular Sum of an Array Medium2338 Count the Number of Ideal Arrays Hard2400 Number of Ways to Reach a Position After Exactly k Steps Medium2514 Count Anagrams Hard2597 The Number of Beautiful Subsets Medium2842 Count K-Subsequences of a String With Maximum Beauty Hard2928 Distribute Candies Among Children I Easy2929 Distribute Candies Among Children II Medium2930 Number of Strings Which Can Be Rearranged to Contain Substring Medium2954 Count the Number of Infection Sequences Hard2963 Count the Number of Good Partitions Hard3116 Kth Smallest Amount With Single Denomination Combination Hard3128 Right Triangles Medium3154 Find Number of Ways to Reach the K-th Stair Hard3179 Find the N-th Value After K Seconds Medium3250 Find the Count of Monotonic Pairs I Hard3251 Find the Count of Monotonic Pairs II Hard3272 Find the Count of Good Integers Hard3312 Sorted GCD Pair Queries Hard3317 Find the Number of Possible Ways for an Event Hard3343 Count Number of Balanced Permutations Hard3352 Count K-Reducible Numbers Less Than N Hard3395 Subsequences with a Unique Middle Mode I Hard3405 Count the Number of Arrays with K Matching Adjacent Elements Hard3426 Manhattan Distances of All Arrangements of Pieces Hard3428 Maximum and Minimum Sums of at Most Size K Subsequences Medium3461 Check If Digits Are Equal in String After Operations I Easy3463 Check If Digits Are Equal in String After Operations II Hard3470 Permutations IV Hard3518 Smallest Palindromic Rearrangement II Hard3539 Find Sum of Array Product of Magical Sequences Hard3577 Count the Number of Computer Unlocking Permutations Medium3621 Number of Integers With Popcount-Depth Equal to K I Hard