Company OAsDSA SheetAll ProblemsPlacement DataInterview ExperiencesPremium
OAHelper
by@Nxtwave

Built by students, for students — practice company-specific OAs, DSA sheets, and real interview experiences to land your dream role.

© 2026 OAHelper.in·Terms·Privacy·Refunds·Trust & Safety·Contact·
Ready to crack your next OA?

Practice company-specific questions trusted by thousands of students across India.

Start PracticingGo Premium
OA Practice·DSA·Placements

Disclaimer: OAHelper is an independent educational platform. We (oahelper.in) do not own the images or questions shown. Content is uploaded by users.

OAHelper - Real Online Assessment (OA) Questions from 700+ Tech Companies

Practice real online assessment questions from Google, Amazon, Microsoft, and 700+ companies. Get detailed solutions, real question images, and company-specific interview insights. Read interview experiences, company-wise placement data, salaries (CTC), and hiring trends.

Browse CompaniesInterview ExperiencesCompany InsightsPractice ProblemsExplore Questions
NewCampus placement ready — 400+ companies tracked

Practice WhatCompanies Actually Ask

Real OA questions. Real patterns. Real results. Stop guessing and start preparing smart with the ultimate campus placement companion.

Start PracticingTracked Companies
oahelper.in
Description
Editorial
Submissions
MediumArrays·Dynamic Programming

Maximum Subarray

Given an integer array nums, find the subarray with the largest sum, and return its sum.

A subarray is a contiguous non-empty sequence of elements within an array.

Verified Real OA ScreenshotGoogle · Sep 2025
Real OA question screenshot

Example 1

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]

Output: 6

Explanation: The subarray [4,-1,2,1] has the largest sum 6.

Example 2

Input: nums = [1]

Output: 1

C++17Python 3Java 17
42:18
Run
Submit
Ln 0, Col 1 · Spaces: 4
C++17UTF-8● Saved