Deutsche Bank Interview Questions

21 of 21

No.	Problem	Difficulty	Frequency
2838	Maximum Coins Heroes Can Collect	Medium	100.0%
2039	The Time When the Network Becomes Idle Graph	Medium	100.0%
2030	Smallest K-Length Subsequence With Occurrences of a Letter String	Hard	100.0%
2968	Apply Operations to Maximize Frequency Score	Hard	100.0%
2141	Maximum Running Time of N Computers	Hard	100.0%
2137	Pour Water Between Buckets to Make Water Levels Equal	Medium	100.0%
3068	Find the Maximum Sum of Node Values Linked List	Hard	100.0%
1827	Minimum Operations to Make the Array Increasing Array	Easy	100.0%
2869	Minimum Operations to Collect Elements	Easy	100.0%
2735	Collecting Chocolates	Medium	87.5%
241	Different Ways to Add Parentheses	Medium	75.0%
1	Two Sum Sliding Window	Easy	62.5%
14	Longest Common Prefix DP	Easy	62.5%
121	Best Time to Buy and Sell Stock	Easy	62.5%
977	Squares of a Sorted Array Array	Easy	62.5%
52	N-Queens II	Hard	62.5%
118	Pascal's Triangle	Easy	62.5%
805	Split Array With Same Average Array	Hard	62.5%
2552	Count Increasing Quadruplets	Hard	62.5%
322	Coin Change DP	Medium	62.5%
151	Reverse Words in a String String	Medium	62.5%