Deutsche Bank Greedy Questions

5 greedy problems asked at Deutsche Bank interviews

Easy (1)Medium (1)Hard (3)

Questions

Title	Difficulty	Acceptance	Frequency
Smallest K-Length Subsequence With Occurrences of a Letter	Hard	39.6%	100.0%
Maximum Running Time of N Computers	Hard	56.4%	100.0%
Find the Maximum Sum of Node Values	Hard	69.5%	100.0%
Minimum Operations to Make the Array Increasing	Easy	81.8%	100.0%
Best Time to Buy and Sell Stock II	Medium	70.7%	62.5%

Showing 5 questions