Infosys coding interview questions

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

• 1. Print Array Elements Easy Array
• 2. Find Maximum Element in Array Easy Array
• 3. Reverse an Array Easy Array
• 4. Check if Array is Sorted Easy Array
• 7. Move Zeros to End Easy Array
• 9. Find Second Largest Element Easy Array
• 11. Count Even and Odd Numbers Easy Array
• 14. Find Minimum in Array Easy Array
• 19. Best Time to Buy and Sell Stock Easy Array
• 21. How Many Numbers Are Smaller Than Current Easy Array
• 35. Concatenation of Array Easy Array
• 46. Number of Rectangles That Can Form Largest Square Easy Array
• 47. Average Salary Excluding Min and Max Easy Array
• 52. Maximum Average Subarray I Easy Array
• 61. Two Sum Easy Array
• 64. Subarray Sum Equals K Medium Array
• 69. Container With Most Water Medium Array
• 74. Maximum Subarray (Kadane's Algorithm) Medium Array
• 76. Set Matrix Zeroes Medium Array
• 78. Find Peak Element Medium Array
• 81. Maximum Product Subarray Medium Array
• 83. Next Permutation Medium Array
• 87. Permutations Medium Array
• 107. Minimum Path Sum Medium Array
• 112. Best Time to Buy and Sell Stock III Hard Array
• 114. Candy Hard Array
• 115. Count of Smaller Numbers After Self Hard Array
• 118. Burst Balloons Hard Array
• 119. Best Time to Buy and Sell Stock IV Hard Array
• 120. Count of Range Sum Hard Array
• 127. Minimum Number of Refueling Stops Hard Array
• 134. Split Array Largest Sum Hard Array
• 151. Check if String is Palindrome Easy String
• 152. Count Vowels and Consonants Easy String
• 153. Remove All Spaces from a String Easy String
• 154. Count Occurrences of a Character Easy String
• 155. Check if Two Strings are Anagrams Easy String
• 156. Find the First Non-Repeating Character Easy String
• 157. Check if String Contains Only Digits Easy String
• 158. Remove Duplicate Characters from String Easy String
• 159. Reverse Words in a Sentence Easy String
• 160. Find the Length of Last Word Easy String
• 161. Check if String is a Subsequence of Another Easy String
• 164. Add Binary Strings Easy String
• 166. Detect Capital Usage Easy String
• 170. Check if Strings are Isomorphic Easy String
• 176. Check if String is a Rotation of Another Easy String
• 179. Longest Continuous Repeating Character Easy String
• 181. Find All Occurrences of a Substring Easy String
• 182. Maximum Number of Words in Sentences Easy String
• 184. Check if Pangram Easy String
• 190. Longest Substring Without Repeating Characters (Brute) Easy String
• 191. Count Prefix and Suffix Pairs Easy String
• 193. Remove Trailing Zeros from String Easy String
• 194. Count Substrings Starting and Ending with Given Character Easy String
• 204. Capitalize the First Letter of Every Word Easy String
• 205. Shift the Letters Easy String
• 210. Longest Substring Without Repeating Characters Medium String
• 216. ZigZag Conversion Medium String
• 218. Decode Ways Medium String
• 220. Generate Parentheses (Count) Medium String
• 224. Longest Repeating Character Replacement Medium String
• 226. Palindrome Partitioning (Count) Medium String
• 231. Reverse Words in a String Medium String
• 236. Partition Labels (Count) Medium String
• 251. Substring with Concatenation of All Words (Count) Medium String
• 257. Edit Distance Hard String
• 258. Wildcard Matching Hard String
• 273. Palindrome Partitioning II (Minimum Cuts) Hard String
• 298. Find the Length of a Linked List Easy Linked List
• 299. Search for an Element in a Linked List Easy Linked List
• 300. Insert a Node at the Beginning Easy Linked List
• 301. Insert a Node at the End Easy Linked List
• 302. Insert a Node at a Given Position Easy Linked List
• 303. Delete a Node by Value Easy Linked List
• 304. Delete a Node by Position Easy Linked List
• 305. Find the Middle Node of a Linked List Easy Linked List
• 306. Detect a Cycle in a Linked List (Floyd's Algorithm) Easy Linked List
• 307. Check if Linked List is a Palindrome Easy Linked List
• 308. Remove Duplicates from Sorted Linked List Easy Linked List
• 309. Merge Two Sorted Linked Lists Easy Linked List
• 310. Count Occurrences of a Value in Linked List Easy Linked List
• 311. Convert Linked List to Array Easy Linked List
• 312. Convert Array to Linked List Easy Linked List
• 313. Print Linked List in Reverse (Recursive) Easy Linked List
• 314. Find the Nth Node from the End Easy Linked List
• 317. Move Last Node to Front Easy Linked List
• 318. Find Sum of All Nodes in Linked List Easy Linked List
• 319. Check if Two Linked Lists are Identical Easy Linked List
• 321. Remove All Occurrences of a Given Value Easy Linked List
• 322. Segregate Even and Odd Nodes Easy Linked List
• 323. Count Nodes in a Loop (Cycle Length) Easy Linked List
• 324. Add 1 to a Number Represented as Linked List Easy Linked List
• 325. Find the Starting Point of a Cycle Easy Linked List
• 326. Reverse a Linked List Iteratively Easy Linked List
• 327. Reverse a Linked List Recursively Easy Linked List
• 328. Sort Linked List Using Bubble Sort Easy Linked List
• 329. Max Element in Linked List Easy Linked List
• 330. Min Element in Linked List Easy Linked List
• 331. Doubly Linked List — Insert at Beginning Easy Linked List
• 332. Doubly Linked List — Insert at End Easy Linked List
• 333. Doubly Linked List — Delete a Node Easy Linked List
• 334. Doubly Linked List — Reverse Traversal Easy Linked List
• 335. Circular Linked List — Detect Easy Linked List
• 336. Circular Linked List — Insert at Position Easy Linked List
• 338. Concatenate Two Linked Lists Easy Linked List
• 339. Check if Linked List has Even or Odd Length Easy Linked List
• 340. Swap Data of Two Nodes without Swapping Pointers Easy Linked List
• 341. Rotate Linked List by K Places Easy Linked List
• 342. Delete Last Occurrence of a Given Value Easy Linked List
• 343. Find Pair with Given Sum in Doubly Linked List Easy Linked List
• 344. Point Arbit Pointer to Greatest Value Right Side Node Easy Linked List
• 345. Reverse a Doubly Linked List Easy Linked List
• 346. Check if Linked List is Circular Easy Linked List
• 347. Multiply Two Numbers Represented as Linked Lists Easy Linked List
• 348. Subtract Two Numbers Represented as Linked Lists Easy Linked List
• 349. XOR Linked List — Insert and Traverse Easy Linked List
• 350. Find Common Elements in Two Sorted Linked Lists Easy Linked List
• 351. Find the Fractional Node (Every Kth Node) Easy Linked List
• 352. Return Kth Node from Beginning Easy Linked List
• 353. Append the Last N Nodes to Beginning Easy Linked List
• 354. Identical Linked Lists Check (Recursive) Easy Linked List
• 365. Linked List Cycle II (Start of Cycle) Medium Linked List
• 395. Reverse Nodes in K-Group (No Extra Space) Hard Linked List
• 417. Binary Search in Sorted Array Easy Binary Search
• 418. Find Index of Target in Sorted Array Easy Binary Search
• 419. Count Occurrences of Element in Sorted Array Easy Binary Search
• 420. Find the First Occurrence of Target Easy Binary Search
• 421. Find the Last Occurrence of Target Easy Binary Search
• 423. Check if Array is Sorted and Search Easy Binary Search
• 424. Square Root Using Binary Search Easy Binary Search
• 425. Find Floor of an Element in Sorted Array Easy Binary Search
• 426. Find Ceil of an Element in Sorted Array Easy Binary Search
• 429. Binary Search on Answer — Minimum Pages Easy Binary Search
• 430. Find Fixed Point (arr[i] == i) in Sorted Array Easy Binary Search
• 432. Find the Only Repeating Element Easy Binary Search
• 433. Find the Only Missing Element in Sorted Array Easy Binary Search
• 434. Check if Target Exists in Sorted 2D Matrix Easy Binary Search
• 435. Find the Pivot in Rotated Sorted Array Easy Binary Search
• 436. Find Minimum in Rotated Sorted Array Easy Binary Search
• 437. Peak Index in a Mountain Array Easy Binary Search
• 439. Lower Bound in Sorted Array Easy Binary Search
• 440. Upper Bound in Sorted Array Easy Binary Search
• 441. Number of Times Array is Rotated Easy Binary Search
• 442. Search in Sorted Rotated Array (No Duplicates) Easy Binary Search
• 443. Find Kth Missing Positive Number Easy Binary Search
• 446. Find N/3 Majority Element Using Binary Search Easy Binary Search
• 447. Count Elements Less Than or Equal to Mid Easy Binary Search
• 448. Find Position of Element in Infinite Sorted Array Easy Binary Search
• 449. Find First Bad Version Easy Binary Search
• 450. Intersection of Two Sorted Arrays (BS Approach) Easy Binary Search
• 451. Find Pair with Given Sum in Sorted Array Easy Binary Search
• 452. Find Closest Element to Target in Sorted Array Easy Binary Search
• 453. Two Sum in Sorted Array (Binary Search Variant) Easy Binary Search
• 455. Find the Difference in Sorted Array of Consecutive Numbers Easy Binary Search
• 457. Cube Root Using Binary Search Easy Binary Search
• 458. Find Kth Positive Number Not in Array Easy Binary Search
• 459. Check if N-th Root of M Exists Easy Binary Search
• 460. Find the Element That Appears Once in Sorted Array Easy Binary Search
• 461. Count Zeros in Sorted Binary Array Easy Binary Search
• 462. Find All Positions of Target in Sorted Array Easy Binary Search
• 463. Minimum Absolute Difference to Target in Sorted Array Easy Binary Search
• 464. Count Pairs with Difference Less Than K Easy Binary Search
• 465. Index of First 1 in Infinite Binary Sorted Array Easy Binary Search
• 466. Find Row with Maximum Ones in Sorted Binary Matrix Easy Binary Search
• 467. Find the Transition Point in 0s and 1s Array Easy Binary Search
• 468. Check if Array Can Be Made Strictly Increasing by Removing One Element Easy Binary Search
• 469. Find Smallest Missing Positive in Sorted Array Easy Binary Search
• 470. Divide Two Integers Without Division (BS Approach) Easy Binary Search
• 471. Power Function (Exponentiation by Squaring) Easy Binary Search
• 472. Find Maximum of Bitonic Sequence Easy Binary Search
• 473. Find Minimum Difference Between Any Two Elements Easy Binary Search
• 476. Find K Closest Elements to a Target Easy Binary Search
• 477. Find Peak Element in Array Medium Binary Search
• 487. Split Array Largest Sum Medium Binary Search
• 531. Split Array Largest Sum (Optimal) Hard Binary Search
• 532. Count of Smaller Numbers After Self Hard Binary Search
• 533. Count of Range Sum Hard Binary Search
• 548. Minimum Total Distance Traveled Hard Binary Search
• 553. Minimum Number of Refueling Stops Hard Binary Search
• 556. Maximum Profit in Job Scheduling (Binary Search + DP) Hard Binary Search
• 564. Check Balanced Parentheses Easy Stack
• 565. Reverse a String Using Stack Easy Stack
• 566. Evaluate Postfix Expression Easy Stack
• 567. Convert Infix to Postfix Easy Stack
• 568. Reverse a Stack Using Recursion Easy Stack
• 569. Sort a Stack Using Recursion Easy Stack
• 570. Find Middle Element of Stack Easy Stack
• 571. Delete Middle Element of Stack Easy Stack
• 572. Check if Stack is Palindrome Easy Stack
• 573. Count Occurrences of Element in Stack Easy Stack
• 574. Reverse a Number Using Stack Easy Stack
• 578. Baseball Game Score Easy Stack
• 579. Reverse First K Elements of Queue Easy Stack
• 580. Interleave First Half with Second Half Easy Stack
• 581. Generate Binary Numbers from 1 to N Easy Stack
• 582. BFS Level Order Traversal Using Queue Easy Stack
• 583. Check if Queue is Palindrome Easy Stack
• 585. Students Unable to Eat Lunch Easy Stack
• 587. First Non-Repeating Character in Stream Easy Stack
• 589. Next Greater Element Easy Stack
• 590. Next Smaller Element Easy Stack
• 591. Previous Greater Element Easy Stack
• 592. Previous Smaller Element Easy Stack
• 593. Stock Span Problem Easy Stack
• 595. Next Greater Element in Circular Array Easy Stack
• 596. Evaluate Prefix Expression Easy Stack
• 597. Balanced Brackets with Wildcard Easy Stack
• 599. Task Scheduler — Simple Version Easy Stack
• 600. Convert Decimal to Binary Using Stack Easy Stack
• 601. Delete Consecutive Same Words Easy Stack
• 602. Count Pairs of Matching Parentheses Easy Stack
• 603. Simplify Unix Directory Path Easy Stack
• 605. Remove K Digits to Get Smallest Number Easy Stack
• 607. Rotting Oranges — BFS via Queue Easy Stack
• 641. Perfect Squares Medium Stack
• 687. Print 1 to N Using Recursion Easy Recursion
• 688. Print N to 1 Using Recursion Easy Recursion
• 689. Factorial of a Number Easy Recursion
• 690. Nth Fibonacci Number Easy Recursion
• 691. Sum of First N Natural Numbers Easy Recursion
• 692. Product of First N Natural Numbers Easy Recursion
• 693. Power of a Number (x^n) Easy Recursion
• 694. Sum of Digits of a Number Easy Recursion
• 695. Reverse a String Using Recursion Easy Recursion
• 696. Check Palindrome Using Recursion Easy Recursion
• 697. Count Zeros in a Number Easy Recursion
• 698. GCD of Two Numbers (Euclidean Algorithm) Easy Recursion
• 699. LCM of Two Numbers Using Recursion Easy Recursion
• 700. Find Maximum Element in Array Recursively Easy Recursion
• 701. Find Minimum Element in Array Recursively Easy Recursion
• 702. Binary Search Using Recursion Easy Recursion
• 703. Linear Search Using Recursion Easy Recursion
• 704. Count Occurrences of Element in Array Easy Recursion
• 705. Reverse an Array Using Recursion Easy Recursion
• 706. Check if Array is Sorted (Recursive) Easy Recursion
• 707. Sum of Array Elements Using Recursion Easy Recursion
• 708. Print All Elements of Array Recursively Easy Recursion
• 709. Find Index of an Element Recursively Easy Recursion
• 710. Count Digits in a Number Easy Recursion
• 711. Multiply Two Numbers Without * Operator Easy Recursion
• 712. Print Multiplication Table Using Recursion Easy Recursion
• 713. Tower of Hanoi — Minimum Moves (Modulo 10^9+7) Easy Recursion
• 714. Print All Even Numbers up to N Easy Recursion
• 715. Print All Odd Numbers up to N Easy Recursion
• 716. Sum of Even Numbers up to N Easy Recursion
• 717. Recursive Bubble Sort Easy Recursion
• 718. Recursive Insertion Sort Easy Recursion
• 719. Print Fibonacci Series up to N Terms Easy Recursion
• 720. Check if a Number is a Power of 2 Easy Recursion
• 721. Check if a Number is a Power of 3 Easy Recursion
• 722. Flatten a Nested Array Recursively Easy Recursion
• 723. Recursive String Length Easy Recursion
• 724. Count Vowels in a String Recursively Easy Recursion
• 725. Remove All Occurrences of a Character Recursively Easy Recursion
• 726. Replace Spaces with Underscores (Recursive) Easy Recursion
• 727. Concatenate N Copies of a String Easy Recursion
• 728. Is Uppercase String (Recursive Check) Easy Recursion
• 729. Convert Number to Binary Using Recursion Easy Recursion
• 730. Convert Binary to Decimal Using Recursion Easy Recursion
• 731. Nth Row of Pascal's Triangle (Modulo 10^9+7) Easy Recursion
• 732. Recursive Exponentiation (Fast Power, Modulo 10^9+7) Easy Recursion
• 733. First Occurrence of Element in Array Easy Recursion
• 734. Last Occurrence of Element in Array Easy Recursion
• 735. Move All Zeros to End (Recursive) Easy Recursion
• 736. Single Entry of Pascal's Triangle — C(n, k) (Modulo 10^9+7) Easy Recursion
• 737. Recursive Floor Division Easy Recursion
• 738. Jump Search Using Recursion Easy Recursion
• 739. Print Pattern — Right Angle Triangle (Recursive) Easy Recursion
• 740. Print Pattern — Inverted Triangle (Recursive) Easy Recursion
• 741. Check Armstrong Number Recursively Easy Recursion
• 742. Sum of Squares of First N Numbers Easy Recursion
• 743. Recursive Palindrome Number Check Easy Recursion
• 744. Compute Binomial Coefficient C(n, r) (Modulo 10^9+7) Easy Recursion
• 745. Return All Indices of Target in Array Easy Recursion
• 746. Find the Sorted Position of Element (Recursive) Easy Recursion
• 747. Tribonacci Number Easy Recursion
• 748. Digital Root (Recursive Digit Sum) Easy Recursion
• 758. Palindrome Partitioning Medium Recursion
• 764. Decode Ways (Recursive + Memoization, Modulo 10^9+7) Medium Recursion
• 770. House Robber (Recursive + Memoization) Medium Recursion
• 777. Longest Increasing Subsequence (Recursive + Memoization) Medium Recursion
• 778. Edit Distance (Recursive + Memoization) Medium Recursion
• 802. Wildcard Matching (Recursive + Memo) Hard Recursion
• 806. Burst Balloons (Interval DP via Recursion) Hard Recursion
• 835. Inorder Traversal of Binary Tree Easy Trees
• 836. Preorder Traversal of Binary Tree Easy Trees
• 837. Postorder Traversal of Binary Tree Easy Trees
• 838. Level Order Traversal (BFS) Easy Trees
• 839. Height / Maximum Depth of Binary Tree Easy Trees
• 841. Count Total Nodes in Binary Tree Easy Trees
• 842. Count Leaf Nodes Easy Trees
• 843. Sum of All Nodes Easy Trees
• 844. Check if Two Trees are Identical Easy Trees
• 845. Mirror / Invert a Binary Tree Easy Trees
• 846. Check if Binary Tree is Symmetric Easy Trees
• 847. Check if Binary Tree is Balanced Easy Trees
• 849. Maximum Path Sum Root to Leaf Easy Trees
• 850. Check if Path with Given Sum Exists Easy Trees
• 851. Find All Root-to-Leaf Paths Easy Trees
• 852. Left View of Binary Tree Easy Trees
• 853. Right View of Binary Tree Easy Trees
• 854. Top View of Binary Tree Easy Trees
• 855. Bottom View of Binary Tree Easy Trees
• 856. Zigzag Level Order Traversal Easy Trees
• 857. Boundary Traversal of Binary Tree Easy Trees
• 858. Vertical Order Traversal Easy Trees
• 859. Check if Binary Tree is Complete Easy Trees
• 860. Check if Binary Tree is Full Easy Trees
• 861. Check if Binary Tree is Perfect Easy Trees
• 862. Find Maximum Width of Binary Tree Easy Trees
• 863. Find Lowest Common Ancestor (LCA) Easy Trees
• 864. Find Distance Between Two Nodes Easy Trees
• 865. Print Nodes at Distance K from Root Easy Trees
• 866. Find Level of a Node in Binary Tree Easy Trees
• 867. Check if Leaf Nodes are at Same Level Easy Trees
• 868. Convert Binary Tree to its Mirror Easy Trees
• 869. Sum of Nodes on Longest Path Root to Leaf Easy Trees
• 870. Count Half Nodes in Binary Tree Easy Trees
• 871. Find the Deepest Left Leaf Node Easy Trees
• 872. Find Maximum Level Sum in Binary Tree Easy Trees
• 873. Connect Level Order Siblings (Next Pointer) Easy Trees
• 874. Iterative Inorder Traversal Using Stack Easy Trees
• 877. Delete Node in Binary Search Tree Easy Trees
• 878. Find Minimum in BST Easy Trees
• 879. Find Maximum in BST Easy Trees
• 880. Check if a Tree is a Valid BST Easy Trees
• 882. Inorder Predecessor in BST Easy Trees
• 883. Floor Value in BST Easy Trees
• 884. Ceil Value in BST Easy Trees
• 886. Kth Largest Element in BST Easy Trees
• 887. Sorted Array to Balanced BST Easy Trees
• 888. Count Nodes in BST with Keys in Given Range Easy Trees
• 889. Lowest Common Ancestor in BST Easy Trees
• 890. Check if Array is Preorder of BST Easy Trees
• 891. Two Sum in BST Easy Trees
• 892. Find Pairs with Given Sum in BST Easy Trees
• 893. Check if BST Contains Dead End Easy Trees
• 894. Print BST Keys in Given Range Easy Trees
• 938. Count of Smaller Numbers After Self (BST/BIT) Hard Trees
• 945. Count of Range Sum (Merge Sort + BST) Hard Trees
• 953. Count of Range Sum (Segment Tree) Hard Trees
• 969. Build Adjacency List from Edge List Easy Graphs
• 970. Build Adjacency Matrix from Edge List Easy Graphs
• 971. Convert Adjacency Matrix to List Easy Graphs
• 972. Check if Edge Exists in Graph Easy Graphs
• 973. Count Degree of Each Vertex Easy Graphs
• 974. BFS Traversal of Undirected Graph Easy Graphs
• 975. DFS Traversal of Undirected Graph Easy Graphs
• 976. BFS Traversal of Directed Graph Easy Graphs
• 977. DFS Traversal of Directed Graph Easy Graphs
• 978. Find Shortest Path in Unweighted Graph Easy Graphs
• 979. Check if Path Exists Between Two Nodes Easy Graphs
• 980. Level of Each Node from Source Easy Graphs
• 981. Count Connected Components in Undirected Graph Easy Graphs
• 982. Multi-Source BFS — Minimum Distance to Any Source Easy Graphs
• 983. Check if Graph is Bipartite Easy Graphs
• 984. Detect Cycle in Undirected Graph (DFS) Easy Graphs
• 985. Detect Cycle in Directed Graph (DFS) Easy Graphs
• 986. Detect Cycle in Undirected Graph Using BFS Easy Graphs
• 987. Find All Neighbours of a Node Easy Graphs
• 988. Count Isolated Nodes in a Graph Easy Graphs
• 990. Flood Fill Algorithm Easy Graphs
• 992. Count Islands Using BFS Easy Graphs
• 993. Surrounded Regions — Capture Os Easy Graphs
• 995. Rotting Oranges — Multi-Source BFS Easy Graphs
• 996. 01 Matrix — Distance to Nearest Zero Easy Graphs
• 1004. Walls and Gates — Multi-Source BFS Easy Graphs
• 1005. Find if Path Exists in Grid Easy Graphs
• 1006. Count Reachable Nodes from a Source Easy Graphs
• 1008. Check if Path Crosses Itself Easy Graphs
• 1009. Find Number of Connected Components Using DSU Easy Graphs
• 1010. Detect Cycle Using DSU Easy Graphs
• 1011. Check if Two Nodes are in Same Component Easy Graphs
• 1012. Topological Sort Using DFS Easy Graphs
• 1013. Topological Sort Using Kahn's Algorithm (BFS) Easy Graphs
• 1014. Check if a Directed Graph is a DAG Easy Graphs
• 1015. Course Schedule I — Can Finish All Courses Easy Graphs
• 1016. Find Mother Vertex in Directed Graph Easy Graphs
• 1017. Print All Paths Between Two Nodes Easy Graphs
• 1018. Check if Graph is Tree Easy Graphs
• 1019. Find All Articulation Points (Bridges Intro) Easy Graphs
• 1020. Minimum Moves to Reach Target in Knight Moves Easy Graphs
• 1021. Clone an Undirected Graph Easy Graphs
• 1022. Word Ladder I — Minimum Transformations Easy Graphs
• 1024. Minimum Steps to Reach End in Circular Array Easy Graphs
• 1025. Count Paths from Source to Destination in DAG Easy Graphs
• 1115. Climbing Stairs Easy Dynamic Programming
• 1116. Frog Jump — Min Cost to Reach Nth Stair Easy Dynamic Programming
• 1117. Fibonacci Number (Bottom-Up DP) Easy Dynamic Programming
• 1118. Tribonacci Number Easy Dynamic Programming
• 1120. House Robber I Easy Dynamic Programming
• 1121. House Robber II (Circular Array) Easy Dynamic Programming
• 1122. Jump Game I — Can Reach End Easy Dynamic Programming
• 1123. Jump Game II — Minimum Jumps Easy Dynamic Programming
• 1124. Decode Ways — Count Decodings Easy Dynamic Programming
• 1125. Counting Bits — Number of 1s for 0 to N Easy Dynamic Programming
• 1126. Perfect Squares — Min Number of Squares Easy Dynamic Programming
• 1127. Ugly Number II — Nth Ugly Number Easy Dynamic Programming
• 1128. N-th Tribonacci — Space Optimized Easy Dynamic Programming
• 1130. Number of Ways to Reach a Position After K Steps Easy Dynamic Programming
• 1133. Count Ways to Make Change for Amount Easy Dynamic Programming
• 1134. Longest Increasing Subsequence Length (Basic) Easy Dynamic Programming
• 1135. Unique Paths in Grid Easy Dynamic Programming
• 1136. Unique Paths II — With Obstacles Easy Dynamic Programming
• 1137. Minimum Path Sum in Grid Easy Dynamic Programming
• 1138. Triangle — Minimum Path Sum Top to Bottom Easy Dynamic Programming
• 1139. Maximum Sum Path in Grid Easy Dynamic Programming
• 1140. Count All Paths from Top-Left to Bottom-Right Easy Dynamic Programming
• 1141. Cherry Pickup I — Max Cherries Easy Dynamic Programming
• 1142. Gold Mine Problem — Maximum Gold Easy Dynamic Programming
• 1144. Number of Paths with Sum K in Grid Easy Dynamic Programming
• 1145. 0/1 Knapsack — Basic Easy Dynamic Programming
• 1146. Subset Sum Problem Easy Dynamic Programming
• 1147. Equal Partition Subset Sum Easy Dynamic Programming
• 1148. Count Subsets with Given Sum Easy Dynamic Programming
• 1149. Count Subsets with Given Difference Easy Dynamic Programming
• 1150. Target Sum — Assign + / - Signs Easy Dynamic Programming
• 1151. Minimum Subset Sum Difference Easy Dynamic Programming
• 1152. Unbounded Knapsack — Basic Easy Dynamic Programming
• 1153. Coin Change I — Minimum Coins Easy Dynamic Programming
• 1154. Coin Change II — Number of Ways Easy Dynamic Programming
• 1155. Rod Cutting Problem Easy Dynamic Programming
• 1156. Maximize the Cut Segments Easy Dynamic Programming
• 1157. Minimum Cost to Fill Given Weight Easy Dynamic Programming
• 1158. Maximum Ribbon Cut Easy Dynamic Programming
• 1159. Coin Change in Minimum Steps Easy Dynamic Programming
• 1160. Longest Common Subsequence — Basic Easy Dynamic Programming
• 1161. Longest Common Substring Easy Dynamic Programming
• 1162. Print Longest Common Subsequence Easy Dynamic Programming
• 1163. Shortest Common Supersequence Length Easy Dynamic Programming
• 1164. Minimum Insertions to Make String Palindrome Easy Dynamic Programming
• 1165. Minimum Deletions to Make String Palindrome Easy Dynamic Programming
• 1166. Longest Palindromic Subsequence Easy Dynamic Programming
• 1167. Count Palindromic Substrings (DP) Easy Dynamic Programming
• 1169. Distinct Subsequences — Count Easy Dynamic Programming
• 1170. Wildcard Matching (? and *) Easy Dynamic Programming
• 1172. Edit Distance (Levenshtein) Easy Dynamic Programming
• 1190. Burst Balloons Medium Dynamic Programming
• 1208. Maximum Profit in Job Scheduling Medium Dynamic Programming
• 1212. Maximum Sum Circular Subarray Medium Dynamic Programming
• 1213. Maximum Product Subarray Medium Dynamic Programming
• 1215. Split Array Largest Sum (Binary Search + DP) Medium Dynamic Programming
• 1249. Stone Game IV Hard Dynamic Programming
• 1256. Minimum Total Distance Traveled Hard Dynamic Programming
• 1262. Last Stone Weight II Hard Dynamic Programming
• 1265. Check if a Number is Even or Odd Using Bit Easy Bit Manipulation
• 1266. Check if Nth Bit is Set Easy Bit Manipulation
• 1267. Set the Nth Bit of a Number Easy Bit Manipulation
• 1268. Clear the Nth Bit of a Number Easy Bit Manipulation
• 1269. Toggle the Nth Bit of a Number Easy Bit Manipulation
• 1270. Count Number of Set Bits (Hamming Weight) Easy Bit Manipulation
• 1271. Check if a Number is a Power of Two Easy Bit Manipulation
• 1272. Check if a Number is a Power of Four Easy Bit Manipulation
• 1273. Swap Two Numbers Without a Temp Variable Easy Bit Manipulation
• 1274. Find the Rightmost Set Bit Position Easy Bit Manipulation
• 1275. Find the Rightmost Unset Bit Position Easy Bit Manipulation
• 1276. Turn Off the Rightmost Set Bit Easy Bit Manipulation
• 1277. Isolate the Rightmost Set Bit Easy Bit Manipulation
• 1278. Check if Two Numbers Have Opposite Signs Easy Bit Manipulation
• 1279. Find Absolute Value Without Branching Easy Bit Manipulation
• 1280. Compute XOR from 1 to N Easy Bit Manipulation
• 1281. Find XOR of All Numbers in a Range [L, R] Easy Bit Manipulation
• 1282. Count Bits to Flip A to B Easy Bit Manipulation
• 1283. Reverse All Bits of an Integer Easy Bit Manipulation
• 1284. Find the Only Non-Repeating Element (XOR) Easy Bit Manipulation
• 1285. Multiply a Number by 2 Using Left Shift Easy Bit Manipulation
• 1286. Divide a Number by 2 Using Right Shift Easy Bit Manipulation
• 1287. Find Upper and Lower Case of a Character Easy Bit Manipulation
• 1288. Invert Case of All Characters in a String Easy Bit Manipulation
• 1289. Add 1 to a Number Without + Operator Easy Bit Manipulation
• 1290. Subtract 1 from a Number Without - Operator Easy Bit Manipulation
• 1291. Find Maximum of Two Numbers Without If Easy Bit Manipulation
• 1292. Find Minimum of Two Numbers Without If Easy Bit Manipulation
• 1293. Check if a Number is Divisible by 4 Easy Bit Manipulation
• 1294. Check if a Number is Divisible by 8 Easy Bit Manipulation
• 1295. Round Down to Nearest Power of Two Easy Bit Manipulation
• 1296. Round Up to Nearest Power of Two Easy Bit Manipulation
• 1297. Copy Sign Bit from One Number to Another Easy Bit Manipulation
• 1298. Merge Bits from Two Values at a Mask Easy Bit Manipulation
• 1299. Clear All Bits from MSB to Nth Bit Easy Bit Manipulation
• 1300. Clear All Bits from Nth Bit to LSB Easy Bit Manipulation
• 1301. Count Trailing Zeros Using Bit Trick Easy Bit Manipulation
• 1302. Count Leading Zeros of an Integer Easy Bit Manipulation
• 1303. Compute Modulo Without % Operator Easy Bit Manipulation
• 1304. Find Position of Only Set Bit Easy Bit Manipulation
• 1305. Single Number I — One Element Appears Once Easy Bit Manipulation
• 1307. Find the Two Non-Repeating Elements Easy Bit Manipulation
• 1308. Detect if Two Integers Have Opposite Signs Easy Bit Manipulation
• 1309. XOR of All Subsets Easy Bit Manipulation
• 1310. Check if XOR of Array is Zero Easy Bit Manipulation
• 1311. Find XOR of Digits of a Number Easy Bit Manipulation
• 1312. Pairs with XOR Equal to K Easy Bit Manipulation
• 1313. Toggle All Bits After MSB Easy Bit Manipulation
• 1314. Copy Set Bits of a Number in Another Easy Bit Manipulation
• 1315. Count Bits to Convert A to B Easy Bit Manipulation
• 1316. Number of 1-Bits in All Numbers from 0 to N Easy Bit Manipulation
• 1317. Sum of Bit Differences Among All Pairs Easy Bit Manipulation
• 1318. Counting Bits — DP + Bit Easy Bit Manipulation
• 1320. Complement of a Number Easy Bit Manipulation
• 1321. Find the Difference Between Two Strings (XOR) Easy Bit Manipulation
• 1322. Hamming Distance Between Two Integers Easy Bit Manipulation
• 1323. Total Hamming Distance for All Pairs Easy Bit Manipulation
• 1324. Number of Valid Words for Each Puzzle Easy Bit Manipulation