JobsJob TrackerJob alerts

Oxigen Wallet · 10 questions

All 10Coding 4System Design 1Low-Level Design 1
  • Sum of Non-Repeated ElementsCoding
  • Max Subarray SumCoding
  • C vs C++
  • Two Stacks in ArrayCoding
  • Main Function and Macros
  • Payment Backend ProcessSystem Design
  • C++ Advanced Concepts
  • B-Tree and B+Tree
  • AVL Tree InsertionCoding
  • What is a virtual function in C++?Low-Level Design
← Oxigen Wallet questions
  1. Interview questions
  2. Oxigen Wallet
  3. Max Subarray Sum
Coding

Max Subarray Sum

Filed under Oxigen Wallet · Also reported at Reve System

The question

Find the maximum subarray sum such that no two elements are adjacent.

No write-up yet. Related questions below have one.

Related Oxigen Wallet questions

  • Sum of Non-Repeated Elements
  • Two Stacks in Array
  • AVL Tree Insertion
← Sum of Non-Repeated ElementsC vs C++ →

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