Deutsche Bank Greedy Questions

4 greedy problems asked at Deutsche Bank interviews

Easy (1)Hard (3)

Questions

Title	Difficulty	Acceptance	Frequency
Find the Maximum Sum of Node Values	Hard	69.5%	100.0%
Smallest K-Length Subsequence With Occurrences of a Letter	Hard	39.7%	100.0%
Minimum Operations to Make the Array Increasing	Easy	81.9%	97.7%
Maximum Running Time of N Computers	Hard	56.4%	97.7%

Showing 4 questions