Company OAs All Problems Placement Data Interview Experiences Premium

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 Practicing Go 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.

infosys_1staug OA Questions & Online Assessment | OAHelper

infosys_1staug OA Questions 2026 — Online Assessment & Interview Practice

5 real infosys_1staug online assessment questions from recent interviews. Includes coding rounds, MCQs, and infosys_1staug interview preparation tips for SDE Intern, New Grad, and full-time roles.

Two Editors — Maximum Profit Difference
Maximum Points Covered by a Length-L Window
Binary Strings with No K Consecutive Ones
Longest Increasing Grid Path with One Dash
Group Knapsack with Non-Adjacent Groups

Browse All Companies Interview Experiences Placement Data infosys_1staug Dynamic Programming OA questions (3)infosys_1staug Sorting OA questions (3)infosys_1staug Sliding Window OA questions (2)infosys_1staug Array OA questions (1)infosys_1staug Arrays OA questions (1)infosys_1staug Game Theory OA questions (1)infosys_1staug Graphs OA questions (1)infosys_1staug Greedy OA questions (1)

i

infosys_1staug OA Questions

5 QuestionsOnline Assessment

0 / 5 solved in this company0% complete

01

Two Editors — Maximum Profit Difference

ArrayGreedy+2ArrayGreedySortingGame Theory

02

Maximum Points Covered by a Length-L Window

ArraysSorting+2ArraysSortingHash TableSliding Window

03

Binary Strings with No K Consecutive Ones

Dynamic ProgrammingStrings+1Dynamic ProgrammingStringsSliding Window

04

Longest Increasing Grid Path with One Dash

Dynamic ProgrammingGraphs+2Dynamic ProgrammingGraphsSortingMatrix

05

Group Knapsack with Non-Adjacent Groups

Dynamic ProgrammingKnapsackDynamic ProgrammingKnapsack

Solve