Flipkart coding interview questions

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

• 65. Longest Subarray with Sum K Medium Array
• 69. Container With Most Water Medium Array
• 73. Find the Duplicate Number Medium Array
• 77. Search in Rotated Sorted Array Medium Array
• 86. Subsets Medium Array
• 92. 3Sum Closest Medium Array
• 94. Maximum Points You Can Obtain from Cards Medium Array
• 95. Minimum Difference Between Largest and Smallest in Three Moves Medium Array
• 101. Find the Duplicate Number (Floyd's Cycle Detection) Medium Array
• 105. Trapping Rain Water Medium Array
• 108. Jump Game II Medium Array
• 109. Largest Rectangle in Histogram Medium Array
• 114. Candy Hard Array
• 126. Jump Game II (Minimum Jumps) Hard Array
• 133. Create Maximum Number Hard Array
• 139. Maximum Performance of a Team Hard Array
• 213. Longest Palindrome by Rearranging Characters Medium String
• 218. Decode Ways Medium String
• 223. Count Palindromic Substrings Medium String
• 237. Count Distinct Subsequences (Modulo 10^9+7) Medium String
• 242. Sort Characters By Frequency Medium String
• 243. Find the Index of the First Occurrence Medium String
• 248. Number of Distinct Substrings (Count) Medium String
• 252. Find Longest Word by Deleting Characters Medium String
• 257. Edit Distance Hard String
• 269. Word Ladder (Shortest Transformation Length) Hard String
• 287. Number of Atoms Hard String
• 355. Merge K Sorted Linked Lists Medium Linked List
• 356. Reverse Linked List in Groups of K 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
• 402. Largest Rectangle in Histogram (Stack) Hard Linked List
• 436. Find Minimum in Rotated Sorted Array Easy Binary Search
• 475. Magnetic Force Between Two Balls (Introduction) Easy Binary Search
• 478. Search in Rotated Sorted Array (With Duplicates) Medium Binary Search
• 480. Find K Closest Elements in Sorted Array Medium Binary Search
• 481. Capacity to Ship Packages Within D Days 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
• 488. Magnetic Force Between Two Balls 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
• 501. Find the Duplicate Number (Binary Search on Value) Medium Binary Search
• 506. Longest Increasing Subsequence Length (Patience Sort + BS) Medium Binary Search
• 507. Russian Doll Envelopes (BS + Greedy) 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
• 525. Find First and Last Position of Element Medium Binary Search
• 554. Minimum Limit of Balls in a Bag Hard Binary Search
• 558. Smallest Sufficient Team (Bitmask DP) Hard Binary Search
• 594. Next Greater Element I Easy Stack
• 608. Next Greater Element II (Circular Array) Medium Stack
• 610. Largest Rectangle in Histogram Medium Stack
• 611. Maximal Rectangle in Binary Matrix Medium Stack
• 613. Asteroid Collision Medium Stack
• 617. Max Width Ramp Medium Stack
• 619. Sum of Subarray Minimums 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
• 638. Number of Atoms 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
• 654. Largest Rectangle in Histogram (Optimal) Hard Stack
• 674. Cut Off Trees for Golf Event 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
• 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
• 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
• 778. Edit Distance (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
• 848. Diameter of Binary Tree Easy 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
• 905. All Nodes Distance K in Binary Tree 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
• 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
• 1032. Cheapest Flights Within K Stops 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
• 1068. Cut Off Trees for Golf Event 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
• 1096. Shortest Bridge Hard Graphs
• 1172. Edit Distance (Levenshtein) 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
• 1186. Russian Doll Envelopes 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
• 1200. Diameter of Binary 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
• 1217. Dungeon Game — Minimum Health Medium Dynamic Programming
• 1218. Cherry Pickup I — Two-Pass DP Medium Dynamic Programming
• 1219. Maximum Points You Can Obtain from Cards Medium Dynamic Programming
• 1220. Count Vowels Permutations Medium Dynamic Programming
• 1222. Maximal Square of Ones in Matrix Medium 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