Deutsche Bank Interview Questions — 30 DSA Problems

28 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Deutsche Bank LeetCode questions for software engineering interviews.

• Smallest K-Length Subsequence With Occurrences of a Letter (HARD) — String, Stack, Greedy, Monotonic Stack
• Maximum Running Time of N Computers (HARD) — Array, Binary Search, Greedy, Sorting
• Find the Maximum Sum of Node Values (HARD) — Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting
• Maximum Coins Heroes Can Collect (MEDIUM) — Array, Two Pointers, Binary Search, Sorting, Prefix Sum
• The Time When the Network Becomes Idle (MEDIUM) — Array, Breadth-First Search, Graph
• Apply Operations to Maximize Frequency Score (HARD) — Array, Binary Search, Sliding Window, Sorting, Prefix Sum
• Minimum Operations to Make the Array Increasing (EASY) — Array, Greedy
• Minimum Operations to Collect Elements (EASY) — Array, Hash Table, Bit Manipulation
• Pour Water Between Buckets to Make Water Levels Equal (MEDIUM) — Array, Binary Search
• Minimize the Difference Between Target and Chosen Elements (MEDIUM) — Array, Dynamic Programming, Matrix
• Robot Collisions (HARD) — Array, Stack, Sorting, Simulation
• Boats to Save People (MEDIUM) — Array, Two Pointers, Greedy, Sorting
• Koko Eating Bananas (MEDIUM) — Array, Binary Search
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Collecting Chocolates (MEDIUM) — Array, Enumeration
• Two Sum (EASY) — Array, Hash Table
• Asteroid Collision (MEDIUM) — Array, Stack, Simulation
• Longest Common Prefix (EASY) — String, Trie
• Maximum Fruits Harvested After at Most K Steps (HARD) — Array, Binary Search, Sliding Window, Prefix Sum
• Best Time to Buy and Sell Stock II (MEDIUM) — Array, Dynamic Programming, Greedy
• Frequency of the Most Frequent Element (MEDIUM) — Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Design HashMap (EASY) — Array, Hash Table, Linked List, Design, Hash Function
• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Minimize Manhattan Distances (HARD) — Array, Math, Geometry, Sorting, Ordered Set
• Validate IP Address (MEDIUM) — String
• Fruit Into Baskets (MEDIUM) — Array, Hash Table, Sliding Window
• Reverse String (EASY) — Two Pointers, String
• Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• Squares of a Sorted Array (EASY) — Array, Two Pointers, Sorting