Adobe coding interview questions

447 DSA problems tagged as asked at Adobe, with statements, examples and constraints — practise free on CampusCode.

• 15. Single Number (XOR Trick) Easy Array
• 25. Squares of a Sorted Array Easy Array
• 61. Two Sum Easy Array
• 62. Three Sum Medium Array
• 65. Longest Subarray with Sum K Medium Array
• 67. Spiral Matrix Traversal Medium Array
• 68. Jump Game Medium Array
• 70. Merge Intervals Medium Array
• 81. Maximum Product Subarray Medium Array
• 83. Next Permutation Medium Array
• 90. Game of Life Medium Array
• 95. Minimum Difference Between Largest and Smallest in Three Moves Medium Array
• 105. Trapping Rain Water Medium Array
• 110. Median of Two Sorted Arrays Hard Array
• 123. Count Inversions in Array Hard Array
• 125. Candy Distribution Hard Array
• 135. Allocate Books (Binary Search + Greedy) Hard Array
• 136. Aggressive Cows Hard Array
• 137. Number of Subarrays with Bounded Maximum Hard Array
• 143. Range Sum Query 2D Hard Array
• 144. Count Rectangles with All Ones Hard Array
• 145. Maximum Rectangle in Binary Matrix Hard Array
• 146. Shortest Common Supersequence via Array DP Hard Array
• 148. K-th Largest Element in a Stream (Array Variant) Hard Array
• 149. Minimum Window Subarray with All Distinct Elements Hard Array
• 190. Longest Substring Without Repeating Characters (Brute) Easy String
• 202. Integer to Roman Easy String
• 207. Largest Number (Array to String Sort) Easy String
• 210. Longest Substring Without Repeating Characters Medium String
• 212. Group Anagrams Medium String
• 213. Longest Palindrome by Rearranging Characters Medium String
• 214. Minimum Window Substring Medium String
• 215. String to Integer (atoi) Medium String
• 218. Decode Ways Medium String
• 220. Generate Parentheses (Count) Medium String
• 222. Restore IP Addresses (Count) Medium String
• 223. Count Palindromic Substrings Medium String
• 229. Permutation in String Medium String
• 233. Basic Calculator II Medium String
• 237. Count Distinct Subsequences (Modulo 10^9+7) Medium String
• 239. Remove K Digits Medium String
• 243. Find the Index of the First Occurrence Medium String
• 247. Largest Number Medium String
• 248. Number of Distinct Substrings (Count) Medium String
• 252. Find Longest Word by Deleting Characters Medium String
• 276. Minimum Insertions to Make a Palindrome Hard String
• 277. Minimum Insertions to Balance Parentheses Hard String
• 279. Basic Calculator Hard String
• 283. Number of Ways to Form Target String (Modulo 10^9+7) Hard String
• 284. Stamping The Sequence (Stamp Count) Hard String
• 290. Partition into Substrings with Unique Characters Hard String
• 291. Shortest Superstring (Length) Hard String
• 295. Count Generalized Abbreviations (Modulo 10^9+7) Hard String
• 296. Special Binary String Hard String
• 297. Reverse a Linked List Easy Linked List
• 355. Merge K Sorted Linked Lists Medium Linked List
• 356. Reverse Linked List in Groups of K Medium Linked List
• 357. Add Two Numbers (Linked List Addition) Medium Linked List
• 359. Sort Linked List (Merge Sort) Medium Linked List
• 362. Rotate List by K Places Medium Linked List
• 363. Partition List Around a Value X Medium Linked List
• 364. Remove Linked List Elements by Value Medium Linked List
• 367. Delete Nodes Having Greater Value on Right Medium Linked List
• 368. Segregate 0s, 1s, and 2s in a Linked List Medium Linked List
• 369. Swap Nodes (Not Data) at Two Given Positions Medium Linked List
• 370. Reverse a Sub-list from Position M to N Medium Linked List
• 371. Pairwise Swap of Nodes Medium Linked List
• 372. Rearrange Linked List — Negatives Before Positives Medium Linked List
• 373. Delete N Nodes After M Nodes Medium Linked List
• 374. Check if Linked List is Sorted Medium Linked List
• 375. Skip M Delete N Nodes Medium Linked List
• 376. Find Length of Loop in Linked List Medium Linked List
• 377. Remove Zero-Sum Consecutive Nodes Medium Linked List
• 378. Sort a Linked List of 0s, 1s and 2s by Changing Links Medium Linked List
• 382. Rearrange Linked List to Alternating Low-High Medium Linked List
• 383. Count Nodes Deleted (Greater Value on Right) Medium Linked List
• 388. Palindrome Linked List (O(1) Space) Medium Linked List
• 390. Minimum Nodes to Remove for K Groups Medium Linked List
• 391. Merge Two Sorted Lists — Recursive Approach Medium Linked List
• 392. Reverse Alternate K Nodes Medium Linked List
• 396. Sort List in O(n log n) Time and O(1) Space Hard Linked List
• 397. Serialize and Deserialize Linked List Hard Linked List
• 398. Reverse Linked List in K-Groups (Reverse Remaining Too) Hard Linked List
• 399. Remove Duplicates from an Unsorted Linked List in O(n) Hard Linked List
• 400. Construct a Linked List from a 2D Matrix in Spiral Order Hard Linked List
• 401. Count Inversions via Merge Sort Hard Linked List
• 403. Josephus Problem Using Circular Linked List Hard Linked List
• 404. Merge M Sorted Lists of Variable Size Hard Linked List
• 405. Rearrange Linked List for In-Place Quicksort (Partition) Hard Linked List
• 406. Reverse a Linked List in Alternate Groups Hard Linked List
• 407. Sum of Two Numbers in Linked List Without Reverse Hard Linked List
• 408. Longest Palindrome in a Linked List Hard Linked List
• 409. Detect and Remove Loop — All Edge Cases Hard Linked List
• 410. Reorder List to Min-Max Interleaving Hard Linked List
• 411. Remove K Digits to Get Smallest Number (LL + Stack) Hard Linked List
• 412. Find All Anagrams via Sliding Window Hard Linked List
• 413. Find Kth Largest Using a Linked List Min-Heap Hard Linked List
• 414. Partition Linked List into K Consecutive Groups Hard Linked List
• 415. Reverse Every Alternate Group of K Nodes Hard Linked List
• 416. Maximum Sum Path in Two Sorted Linked Lists Hard Linked List
• 453. Two Sum in Sorted Array (Binary Search Variant) Easy Binary Search
• 482. Koko Eating Bananas Medium Binary Search
• 483. Minimum Number of Days to Make M Bouquets Medium Binary Search
• 485. Aggressive Cows (Maximum Minimum Distance) Medium Binary Search
• 486. Allocate Books (Minimize Maximum Pages) Medium Binary Search
• 489. Gas Station — Minimum Stations to Add Medium Binary Search
• 490. Minimize Maximum Distance to Gas Station (Scaled) Medium Binary Search
• 491. Painter's Partition Problem Medium Binary Search
• 492. Matrix Median Medium Binary Search
• 493. Kth Element of Two Sorted Arrays Medium Binary Search
• 494. Find Nth Root of M (Binary Search on Answer) Medium Binary Search
• 495. EKO — Cutting Logs (Maximum Sawblade Height) Medium Binary Search
• 499. Maximize the Minimum After K Increments Medium Binary Search
• 500. Count of Pairs with Sum in a Range Medium Binary Search
• 504. Random Pick with Weight (Deterministic Queries) Medium Binary Search
• 506. Longest Increasing Subsequence Length (Patience Sort + BS) Medium Binary Search
• 511. Check If a Number Is a Majority Element in a Sorted Array Medium Binary Search
• 512. Heaters — Find the Minimum Radius Medium Binary Search
• 513. Maximum Side Length of a Square with Sum <= Threshold Medium Binary Search
• 516. Sqrt(x) with Precision (Binary Search on Float) Medium Binary Search
• 517. Count Pairs in Two Sorted Arrays Whose Sum is K Medium Binary Search
• 518. Weighted Job Scheduling (Binary Search + DP) Medium Binary Search
• 522. Minimum Eating Speed for All Piles Medium Binary Search
• 524. Search a 2D Matrix Medium Binary Search
• 525. Find First and Last Position of Element Medium Binary Search
• 526. Median of Two Sorted Arrays Hard Binary Search
• 529. K-th Smallest Number in Multiplication Table Hard Binary Search
• 538. Minimize Max Distance Between Gas Stations (Exact) Hard Binary Search
• 539. Minimum Window Containing All Required Elements Hard Binary Search
• 546. Allocate Minimum Number of Pages (Multi-Constraint) Hard Binary Search
• 547. Koko Eating Bananas — Generalized K Piles Hard Binary Search
• 549. Special Array With X Elements Greater Than or Equal to X Hard Binary Search
• 555. Minimum Operations to Make Median of Array Equal to Target Hard Binary Search
• 557. Longest Substring with At Most K Replacements Hard Binary Search
• 558. Smallest Sufficient Team (Bitmask DP) Hard Binary Search
• 563. K-th Lexicographically Smallest Integer in Range Hard Binary Search
• 611. Maximal Rectangle in Binary Matrix Medium Stack
• 616. Online Stock Span Medium Stack
• 617. Max Width Ramp Medium Stack
• 620. Sum of Subarray Maximums Medium Stack
• 624. Maximum of Minimum for Every Window Size Medium Stack
• 636. Minimum Insertions to Balance Parentheses Medium Stack
• 649. Count of Students Unable to Eat Lunch Medium Stack
• 650. Minimum Number of Flips to Convert Binary Matrix to Zero Medium Stack
• 651. Check If Word Is Valid After Substitutions Medium Stack
• 652. Implement a Basic Calculator II Medium Stack
• 653. Trapping Rain Water Hard Stack
• 656. Basic Calculator I Hard Stack
• 658. Longest Valid Parentheses (O(1) Space) Hard Stack
• 660. Max Width Ramp (Optimal) Hard Stack
• 663. Number of Visible Pairs in a Queue Hard Stack
• 664. Maximum Score From Multiplication Operations Hard Stack
• 665. Minimum Swaps to Make String Balanced Hard Stack
• 668. Sliding Window Minimum and Maximum Together Hard Stack
• 670. Minimum Cost Jump Game (Monotonic Queue DP) Hard Stack
• 672. Shortest Path in a Grid with Obstacles Elimination Hard Stack
• 673. Sliding Puzzle — Minimum Moves Hard Stack
• 676. Word Ladder — Shortest Transformation Hard Stack
• 679. Maximum Robots Within Budget Hard Stack
• 682. Maximum Points in an Archery Competition Hard Stack
• 749. Generate All Subsets (Power Set) Medium Recursion
• 750. Generate All Unique Permutations of a String Medium Recursion
• 751. Generate All Unique Permutations of an Array Medium Recursion
• 753. Combination Sum I (Unlimited Use) Medium Recursion
• 754. Combination Sum II (Each Element Used Once) Medium Recursion
• 759. Word Search in 2D Grid Medium Recursion
• 760. N-Queens with Fixed First-Queen Column (Count Solutions) Medium Recursion
• 761. Rat in a Maze — Path Exists Medium Recursion
• 762. Sudoku Solver — Solvable? Medium Recursion
• 763. Count Balanced Parentheses (Catalan, Modulo 10^9+7) Medium Recursion
• 764. Decode Ways (Recursive + Memoization, Modulo 10^9+7) Medium Recursion
• 767. Merge Sort Medium Recursion
• 768. Quick Sort Medium Recursion
• 769. Climb Stairs with K Steps (Modulo 10^9+7) Medium Recursion
• 770. House Robber (Recursive + Memoization) Medium Recursion
• 771. Coin Change — Minimum Coins (Recursive) Medium Recursion
• 772. Coin Change II — Count Ways (Modulo 10^9+7) Medium Recursion
• 773. Unique Paths in Grid (Recursive, Modulo 10^9+7) Medium Recursion
• 774. Count Paths from Top-Left to Bottom-Right (Modulo 10^9+7) Medium Recursion
• 775. Knapsack 0/1 (Recursive + Memoization) Medium Recursion
• 779. Count All Paths in Directed Graph (0 to N-1) Medium Recursion
• 780. Count Binary Strings Without Consecutive 1s (Modulo 10^9+7) Medium Recursion
• 781. Tower of Hanoi — General N Disks (Modulo 10^9+7) Medium Recursion
• 782. Count Distinct Subsequences of a String (Modulo 10^9+7) Medium Recursion
• 783. Count All Subsequences with Given Sum (Modulo 10^9+7) Medium Recursion
• 784. Check if Any Subsequence Equals Target Sum Medium Recursion
• 785. Kth Symbol in Grammar Medium Recursion
• 786. Gray Code — i-th Element Using Recursion Medium Recursion
• 788. Beautiful Arrangement — Count with First Value Fixed Medium Recursion
• 789. Wildcard Pattern Matching (? and *) Medium Recursion
• 790. Restore IP Addresses — Count Valid Decompositions Medium Recursion
• 792. Target Sum — Assign +/- to Each Number (Modulo 10^9+7) Medium Recursion
• 793. Count All Paths with Obstacles in Grid (Modulo 10^9+7) Medium Recursion
• 794. Count Islands Using DFS Recursion Medium Recursion
• 795. All Possible Full Binary Trees — Count Medium Recursion
• 796. Expression Add Operators — Count Expressions Reaching Target Medium Recursion
• 797. Minimum Path Sum in Grid (Recursive + Memoization) Medium Recursion
• 798. Josephus Problem Medium Recursion
• 799. N-Queens II — Count All Solutions (Optimized) Hard Recursion
• 803. Word Break II — Count All Sentences (Modulo 10^9+7) Hard Recursion
• 804. Remove Invalid Parentheses — Count Minimum-Removal Solutions Hard Recursion
• 805. K-th Permutation Sequence Hard Recursion
• 807. Count All Valid Pickup/Delivery Options (Modulo 10^9+7) Hard Recursion
• 808. Knight Dialer — Count Distinct Sequences (Modulo 10^9+7) Hard Recursion
• 810. Reconstruct Itinerary — Euler Path Exists from JFK Hard Recursion
• 813. Count Arrangements of N Bishops on M×M Board Hard Recursion
• 814. Beautiful Arrangement II — Constructible? Hard Recursion
• 815. Minimum Cost to Fill Given Weight in Bag Hard Recursion
• 819. Tiling Problem — Count Ways to Tile 2×N Floor (Modulo 10^9+7) Hard Recursion
• 820. Egg Drop Problem (Recursive + Memo) Hard Recursion
• 821. Optimal Strategy for a Game (Coin Row) Hard Recursion
• 823. Maximum Sum Increasing Subsequence (Recursive) Hard Recursion
• 824. Count Strings Without 3 Consecutive Same Characters (Modulo 10^9+7) Hard Recursion
• 825. Find All Paths in DAG (Count, u to v) Hard Recursion
• 826. Minimum XOR Sum of Two Arrays (Bitmask Recursion) Hard Recursion
• 827. Allocate Mailboxes — DP on Sorted Array Hard Recursion
• 828. All Paths for a Sum in Binary Tree Hard Recursion
• 829. Minimum Moves to Spread Stones Over 3×3 Grid Hard Recursion
• 831. Print All K-Partitions of a String — Count (Mod 10^9+7) Hard Recursion
• 895. Binary Tree Maximum Path Sum Medium Trees
• 896. Construct Binary Tree from Preorder and Inorder Medium Trees
• 897. Construct Binary Tree from Postorder and Inorder Medium Trees
• 902. Path Sum II — All Root-to-Leaf Paths Medium Trees
• 903. Path Sum III — Any Downward Path Medium Trees
• 908. Time to Burn Binary Tree from a Node Medium Trees
• 909. Morris Inorder Traversal (O(1) Space) Medium Trees
• 910. Morris Preorder Traversal (O(1) Space) Medium Trees
• 911. Iterative Postorder Using One Stack Medium Trees
• 912. Vertical Order Traversal (Coordinate Sort) Medium Trees
• 913. Check if Two Trees are Isomorphic Medium Trees
• 914. Minimum Time to Collect All Apples Medium Trees
• 916. House Robber III — Tree DP Medium Trees
• 918. Delete Node and Return Forest Medium Trees
• 919. Recover BST — Two Swapped Nodes Medium Trees
• 920. Convert Sorted List to BST Medium Trees
• 923. Merge Two BSTs Medium Trees
• 926. Closest BST Values II — K Closest Medium Trees
• 927. BST Iterator (In-Order Lazy Evaluation) Medium Trees
• 928. Count Words with Given Prefix in Trie Medium Trees
• 930. Replace Words Using Trie (Sentence Shortening) Medium Trees
• 931. Range Sum Query — Segment Tree Build Medium Trees
• 932. Binary Indexed Tree — Prefix Sum Medium Trees
• 936. Binary Tree Maximum Path Sum (Any to Any) Hard Trees
• 937. Recover BST — O(1) Space Morris Hard Trees
• 939. Vertical Order Traversal (Full Coordinate Sort) Hard Trees
• 940. Time to Burn Tree — Multi-Source BFS Hard Trees
• 944. Number of Ways to Reorder Array as BST Hard Trees
• 946. Kth Smallest in Lexicographic Order Hard Trees
• 947. Convert BST to Sorted Doubly Linked List Hard Trees
• 950. Maximum XOR of Two Numbers (Trie Bitwise) Hard Trees
• 952. Range Minimum Query (Segment Tree) Hard Trees
• 954. Number of Longest Increasing Subsequences Hard Trees
• 955. Rectangle Area II — Coordinate Compression Hard Trees
• 956. Count Inversions Using BIT Hard Trees
• 958. 2D Range Sum Queries (2D BIT / Prefix) Hard Trees
• 959. Lowest Common Ancestor Using Binary Lifting Hard Trees
• 960. LCA + Distance Queries on a Tree Hard Trees
• 961. Maximum Weight Independent Set on a Tree Hard Trees
• 962. Tree Diameter with Weighted Edges Hard Trees
• 963. Minimum Vertex Cover on a Tree Hard Trees
• 964. Minimum Dominating Set on a Tree Hard Trees
• 989. Number of Islands (DFS) Easy Graphs
• 991. Max Area of Island Easy Graphs
• 994. Pacific Atlantic Water Flow Easy Graphs
• 1026. Dijkstra's Shortest Path Algorithm Medium Graphs
• 1027. Bellman-Ford Shortest Path Medium Graphs
• 1028. Shortest Path in DAG (Topo + Relax) Medium Graphs
• 1029. Floyd-Warshall All-Pairs Shortest Path Medium Graphs
• 1030. Dijkstra on Grid — Minimum Cost Path Medium Graphs
• 1035. Find the City with Smallest Reachable Neighbours Medium Graphs
• 1036. Minimum Spanning Tree — Kruskal's Algorithm Medium Graphs
• 1037. Minimum Spanning Tree — Prim's Algorithm Medium Graphs
• 1038. Minimum Cost to Connect All Points Medium Graphs
• 1039. Critical Connections — Bridges in Graph Medium Graphs
• 1040. Minimum Spanning Tree — Number of Edges Medium Graphs
• 1041. Course Schedule II — Return Order Medium Graphs
• 1042. Alien Dictionary — Find Letter Order Medium Graphs
• 1043. Find All Ancestors of a Node in DAG Medium Graphs
• 1044. Parallel Courses — Minimum Semesters Medium Graphs
• 1045. Sequence Reconstruction Using Topo Sort Medium Graphs
• 1046. Kosaraju's Algorithm — Strongly Connected Components Medium Graphs
• 1047. Tarjan's Algorithm — SCC Medium Graphs
• 1048. Count Strongly Connected Components Medium Graphs
• 1054. Word Ladder II — All Shortest Paths Medium Graphs
• 1055. Open the Lock — Minimum Turns Medium Graphs
• 1056. Minimum Jumps to Reach End (Jump Game BFS) Medium Graphs
• 1058. Bus Routes — Minimum Buses to Destination Medium Graphs
• 1060. Number of Provinces — Connected Components Medium Graphs
• 1063. Reconstruct Itinerary (Eulerian Path) Medium Graphs
• 1067. Minimum Obstacles to Reach Corner (0-1 BFS) Medium Graphs
• 1069. Minimum Cost to Make at Least One Valid Path Medium Graphs
• 1071. Graph Coloring — M-Coloring Problem Medium Graphs
• 1072. Check if Graph is Bipartite (BFS) Medium Graphs
• 1074. Minimum Weighted Sum to All Reachable Nodes Medium Graphs
• 1075. Check Connectivity After Node Removal Medium Graphs
• 1076. Dijkstra with State — Minimum Cost with K Stops Hard Graphs
• 1077. Bellman-Ford — Detect Negative Weight Cycle Hard Graphs
• 1078. Johnson's Algorithm — All-Pairs on Sparse Graph Hard Graphs
• 1079. Minimum Cost Path with At Most K Edges (DP+Graph) Hard Graphs
• 1080. Max Flow — Ford-Fulkerson Algorithm Hard Graphs
• 1081. Max Flow — Edmonds-Karp (BFS-based) Hard Graphs
• 1082. Minimum Cut in a Flow Network Hard Graphs
• 1083. Bipartite Matching — Maximum Matching Hard Graphs
• 1084. Minimum Path Cover in DAG Hard Graphs
• 1085. Minimum Edges to Make Graph Strongly Connected Hard Graphs
• 1086. Count Critical Nodes Whose Removal Disconnects Graph Hard Graphs
• 1087. 2-SAT Problem Using Implication Graph Hard Graphs
• 1088. Minimum Height Trees — Topological Trim Hard Graphs
• 1089. Parallel Courses III — Maximum Time with Dependencies Hard Graphs
• 1090. Second Best Minimum Spanning Tree Hard Graphs
• 1091. Maximum Spanning Tree Hard Graphs
• 1093. DSU with Rollback — Online Connectivity Hard Graphs
• 1094. Connected Components After Edge Removals (Offline) Hard Graphs
• 1095. Genetic Mutation — Minimum Mutations (BFS) Hard Graphs
• 1097. Number of Restricted Paths Hard Graphs
• 1098. Jump Game IV — BFS with Value Groups Hard Graphs
• 1099. Shortest Path with Obstacle Elimination Hard Graphs
• 1100. Cherry Pickup II — Two Robots Hard Graphs
• 1101. Minimum Days to Disconnect Island Hard Graphs
• 1102. Number of Increasing Paths in Grid Hard Graphs
• 1103. Course Schedule IV — Reachability Queries Hard Graphs
• 1104. Find All Bridges Using Tarjan's Algorithm Hard Graphs
• 1105. Articulation Points Using Tarjan's Algorithm Hard Graphs
• 1106. Eulerian Circuit Using Hierholzer's Algorithm Hard Graphs
• 1107. Hamiltonian Path Existence (Bitmask DP) Hard Graphs
• 1108. Travelling Salesman Problem (Bitmask DP) Hard Graphs
• 1109. Count Hamiltonian Paths in DAG (Bitmask DP) Hard Graphs
• 1111. General Graph Maximum Matching Hard Graphs
• 1112. Max Stones Removed with Same Row or Column Hard Graphs
• 1113. Couples Holding Hands — Minimum Swaps Hard Graphs
• 1114. Minimum Equivalent Graph via Transitive Reduction Hard Graphs
• 1115. Climbing Stairs Easy Dynamic Programming
• 1175. Best Time to Buy and Sell Stock I Medium Dynamic Programming
• 1176. Best Time to Buy and Sell Stock II — Unlimited Medium Dynamic Programming
• 1177. Best Time to Buy and Sell Stock III — At Most 2 Medium Dynamic Programming
• 1178. Best Time to Buy and Sell Stock IV — At Most K Medium Dynamic Programming
• 1179. Buy and Sell with Cooldown Medium Dynamic Programming
• 1180. Buy and Sell with Transaction Fee Medium Dynamic Programming
• 1181. Longest Increasing Subsequence — O(n log n) Medium Dynamic Programming
• 1182. Longest Decreasing Subsequence Medium Dynamic Programming
• 1183. Longest Bitonic Subsequence Medium Dynamic Programming
• 1184. Number of Longest Increasing Subsequences Medium Dynamic Programming
• 1189. Matrix Chain Multiplication Medium Dynamic Programming
• 1192. Palindrome Partitioning II — Min Cuts Medium Dynamic Programming
• 1198. Stone Game I Medium Dynamic Programming
• 1199. House Robber III — Tree DP Medium Dynamic Programming
• 1201. Maximum Independent Set on Tree Medium Dynamic Programming
• 1203. Minimum Time to Collect All Apples Medium Dynamic Programming
• 1204. Count Paths in DAG with Constraints Medium Dynamic Programming
• 1205. Longest Path in a DAG Medium Dynamic Programming
• 1206. Minimum Jumps to Reach End (Graph DP) Medium Dynamic Programming
• 1207. Weighted Job Scheduling (DP + Binary Search) Medium Dynamic Programming
• 1211. Maximum Subarray Sum (Kadane's — DP View) Medium Dynamic Programming
• 1213. Maximum Product Subarray Medium Dynamic Programming
• 1217. Dungeon Game — Minimum Health Medium Dynamic Programming
• 1218. Cherry Pickup I — Two-Pass DP Medium Dynamic Programming
• 1220. Count Vowels Permutations Medium Dynamic Programming
• 1222. Maximal Square of Ones in Matrix Medium Dynamic Programming
• 1225. Travelling Salesman Problem (TSP) Hard Dynamic Programming
• 1226. Minimum Cost to Visit Every Node Hard Dynamic Programming
• 1228. Partition Into Two Arrays to Minimize Sum Difference Hard Dynamic Programming
• 1229. Count Ways to Assign Tasks to Workers Hard Dynamic Programming
• 1231. Beautiful Arrangement — Count Permutations Hard Dynamic Programming
• 1232. Number of Ways to Paint N x 3 Grid Hard Dynamic Programming
• 1234. Count Digit One — Numbers from 1 to N Hard Dynamic Programming
• 1238. K-th Smallest in Lexicographic Order Hard Dynamic Programming
• 1239. Word Break II — All Sentence Splits Hard Dynamic Programming
• 1244. Shortest Common Supersequence — Print Hard Dynamic Programming
• 1245. Longest Common Subsequence of Three Strings Hard Dynamic Programming
• 1251. Nim Game Generalization Hard Dynamic Programming
• 1252. Grundy Number and Sprague-Grundy Theorem Hard Dynamic Programming
• 1253. Cherry Pickup II — Two Robots Hard Dynamic Programming
• 1257. Paint House III — K Colours Hard Dynamic Programming
• 1259. 3D Knapsack — Two Constraints Hard Dynamic Programming
• 1260. Minimum Number of Work Sessions Hard Dynamic Programming
• 1325. Subsets Generation Using Bitmask Medium Bit Manipulation
• 1326. Check if a Set is a Subset of Another Medium Bit Manipulation
• 1327. Count Subsets with Given XOR Medium Bit Manipulation
• 1328. Count Subsets with Given AND Value Medium Bit Manipulation
• 1329. Power Set Using Bitmask Medium Bit Manipulation
• 1330. Beautiful Arrangement — Bitmask Backtracking Medium Bit Manipulation
• 1331. Partition Array into Two Subsets with Min Diff Medium Bit Manipulation
• 1332. Count of Pairs with AND Equal to Zero Medium Bit Manipulation
• 1333. Maximum AND Value of a Pair in Array Medium Bit Manipulation
• 1335. Maximum XOR of Element with Array (Query) Medium Bit Manipulation
• 1336. Single Number II — Element Appears Three Times Medium Bit Manipulation
• 1337. Single Number III — Two Elements Appear Once Medium Bit Manipulation
• 1338. Decode XOR Encoded Array Medium Bit Manipulation
• 1339. Find XOR of All Permutations Medium Bit Manipulation
• 1341. Minimum Number of Flips to Make OR of Array K Medium Bit Manipulation
• 1344. Partition Into Two Arrays to Minimize Sum Diff Medium Bit Manipulation
• 1345. Stickers to Spell Word — Bitmask DP Medium Bit Manipulation
• 1347. Count Strings Without Consecutive 1s Medium Bit Manipulation
• 1349. Minimum Cost to Visit Every Node (Bitmask TSP) Medium Bit Manipulation
• 1352. Add Two Numbers Without Arithmetic Operators Medium Bit Manipulation
• 1353. Subtract Using Bitwise Operators Only Medium Bit Manipulation
• 1354. Multiply Two Numbers Using Bit Shifts Medium Bit Manipulation
• 1355. Divide Two Integers Without / Operator Medium Bit Manipulation
• 1356. Compute Power x^n Using Bits (Fast Exponent) Medium Bit Manipulation
• 1357. Multiply 64-bit Integers Without Overflow Medium Bit Manipulation
• 1358. Generate Gray Code Sequence Medium Bit Manipulation
• 1359. Find Nth Gray Code Number Medium Bit Manipulation
• 1360. Circular Permutation in Binary Representation Medium Bit Manipulation
• 1362. Count Bit Changes to Sort Array Medium Bit Manipulation
• 1363. Minimum Number of Operations to Make XOR Zero Medium Bit Manipulation
• 1364. Largest Combination with Bitwise AND Greater Zero Medium Bit Manipulation
• 1365. Count Integers in Range with Popcount Condition Medium Bit Manipulation
• 1366. Find Two Numbers with Odd Occurrences Medium Bit Manipulation
• 1367. Bit Reversal of 32-bit Integer Medium Bit Manipulation
• 1368. UTF-8 Validation Using Bit Masking Medium Bit Manipulation
• 1369. Integer Replacement — Min Steps Using Bits Medium Bit Manipulation
• 1370. Decode XOR Encoded Permutation Medium Bit Manipulation
• 1372. Travelling Salesman — Classic Bitmask DP Hard Bit Manipulation
• 1373. Assignment Problem — Min Cost Bitmask DP Hard Bit Manipulation
• 1374. Cover All Nodes with Minimum Edges (Bitmask) Hard Bit Manipulation
• 1375. Minimum XOR Sum of Two Arrays Hard Bit Manipulation
• 1376. Minimum Number of Work Sessions (Bitmask) Hard Bit Manipulation
• 1379. Zuma Game — Bitmask Interval DP Hard Bit Manipulation
• 1380. Matching with Weighted Bipartite Graph Hard Bit Manipulation
• 1381. Count All Valid Pickup Delivery Orders Hard Bit Manipulation
• 1382. Find Minimum Number of Coins for Each Amount Hard Bit Manipulation
• 1384. Count Ways to Assign Tasks — K Workers Hard Bit Manipulation
• 1385. Parallel Courses III — Bitmask Scheduling Hard Bit Manipulation
• 1387. Maximum XOR Subarray (Prefix XOR + Trie) Hard Bit Manipulation
• 1388. Count Pairs with XOR in a Range Hard Bit Manipulation
• 1389. Maximum Genetic Difference Query Hard Bit Manipulation
• 1390. Sum of All XOR Triplets in Array Hard Bit Manipulation
• 1391. Find Subarray with Maximum XOR Hard Bit Manipulation
• 1392. Shortest Path in Binary Tree via XOR Hard Bit Manipulation
• 1393. Count Total Set Bits in All Numbers 1 to N Hard Bit Manipulation
• 1394. Find XOR Sum of All Pairs Bitwise AND Hard Bit Manipulation
• 1395. Count Pairs with AND Greater Than XOR Hard Bit Manipulation
• 1396. Longest Subarray with AND Greater Than Zero Hard Bit Manipulation
• 1397. Sum of XOR of All Subarrays Hard Bit Manipulation
• 1398. Count Subarrays with XOR Less Than K Hard Bit Manipulation
• 1399. Maximum AND of Two Numbers After One Swap Hard Bit Manipulation
• 1400. Find the Largest Number in Range with Max Set Bits Hard Bit Manipulation
• 1401. SOS DP — Sum Over Subsets Using Bitmask Hard Bit Manipulation
• 1402. Inclusion-Exclusion via Bitmask Hard Bit Manipulation
• 1403. Profile Dynamic Programming on Grid (Bitmask) Hard Bit Manipulation
• 1404. Broken Necklace — Bitmask Circular DP Hard Bit Manipulation
• 1405. 2-SAT Problem — Implication Graph + Bits Hard Bit Manipulation
• 1406. Fast Fourier Transform Butterfly — Bit Reversal Hard Bit Manipulation
• 1407. XOR Basis — Gaussian Elimination over GF(2) Hard Bit Manipulation
• 1408. Count Arrays with XOR Equal to K (Linear Basis) Hard Bit Manipulation
• 1409. Nim Game with Multiple Piles — Sprague-Grundy Hard Bit Manipulation
• 1410. Maximum Score from K Consecutive XOR Operations Hard Bit Manipulation