PowerUp money Interview sde 2 backend
- Posted
- 19 Sept 2026
Summary
I interviewed for a Backend SDE 2 role at PowerUp Money, was given two DSA problems (a binary‑search‑on‑answer problem similar to Koko Eating Bananas and a Longest Increasing Subsequence problem), and was rejected without any constructive feedback.
How it went
R1 :standard dsa
q1 . binary search on the answer type question similar to koko eating bananas. Solved in mins with different approaches , interviewer looked disinterested and busy .said okay and moved to next question
q2 . LIS question , wrote the recusrion and memoization and even the dp table solution , all test cases passed
asked interviewer a few questions about company , he didnt answered anything nicely and was crazy rude , Later saw his profile was some junior 1.5 yoe guy ( no offence in yoe but you should atleast be generous )
VERDICT : Rejected with no constructive feedback ! surprise suprise
Questions asked (2)
- 01
Binary Search on Answer (Similar to Koko Eating Bananas)
Data Structures & Algorithms · Medium
Given an array of integers representing piles of bananas and an integer H representing hours, find the minimum integer eating speed K such that all bananas can be eaten within H hours. The solution requires binary searching over the possible speed values (the answer space) and checking feasibility for each candidate speed.
- 02
Longest Increasing Subsequence
Data Structures & Algorithms · Medium
Given an integer array, find the length of the longest strictly increasing subsequence.