Deloitte coding interview questions

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

• 103. Shortest Unsorted Continuous Subarray Medium Array
• 116. Reverse Pairs Hard Array
• 134. Split Array Largest Sum Hard Array
• 165. Valid Parentheses (String Version) Easy String
• 211. Longest Palindromic Substring Medium String
• 212. Group Anagrams Medium String
• 239. Remove K Digits Medium String
• 246. Reverse Vowels of a String Medium String
• 257. Edit Distance Hard String
• 394. Merge K Sorted Lists (Optimal — Min Heap) Hard Linked List
• 487. Split Array Largest Sum Medium Binary Search
• 531. Split Array Largest Sum (Optimal) Hard Binary Search
• 534. Reverse Pairs (Modified Merge Sort) Hard Binary Search
• 551. Minimum Time to Repair Cars Hard Binary Search
• 575. Valid Parentheses (Multiple Types) Easy Stack
• 576. Remove All Adjacent Duplicates in String Easy Stack
• 613. Asteroid Collision Medium Stack
• 666. Shortest Unsorted Continuous Subarray Hard Stack
• 778. Edit Distance (Recursive + Memoization) Medium Recursion
• 1172. Edit Distance (Levenshtein) Easy Dynamic Programming
• 1215. Split Array Largest Sum (Binary Search + DP) Medium Dynamic Programming