Maximum Sum of Balanced Subsequence
Asked at ServiceNow · Coding Questions · Difficulty: Hard
A subsequence of `nums` at indices `i0 < i1 < ... < i_{k-1}` is **balanced** if for every `j` in `[1, k-1]`:
Loading the problem…
More ServiceNow interview questions
- Find Max Minimum Value Using K Elements
- Lexicographically Smallest String With Minimum Replacements
- Two-Team Turn-Based Battle Simulator
- Toy Language Type System
- Grid Infection and Immunity Simulation
- Earliest Supporting Version with a Probe Budget