← Deutsche Bank questions

Bottom view of binary tree, LPS, and House Robber

Filed under Deutsche Bank

Solve three problems: 1) Bottom view of a binary tree. 2) Longest Palindromic Subsequence (LPS). 3) House Robber (maximize sum of non-adjacent elements).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Deutsche Bank questions

Collected from public candidate posts and coding forums. Updated Nov 2026.