Summarise with AI

Your next OA is closer than you think.Real questions from this season's OAs

ProductCompany OAs All Problems OA Calendar Mock OAs DSA Roadmap SQL Roadmap Agent Engineering

ResourcesInterview experiences Topics OA Groups Contribute Company Insights OA Store Premium For Colleges

Terms Privacy Refunds Trust & Safety Contact© 2026 OA Helper

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

Company Topic

INFOSYS Dynamic Programming OA Questions

Practice 51+ Dynamic Programming coding questions asked in INFOSYS online assessments.

Carving the Corridor Into Expert SquadsHard Thinning the Garrison Down to OneMedium Great Chains of Blue and Red BallsHard Edit Distance with ROT13 CascadeMedium Power-Assisted Selection on a Circular RingMedium Longest Alternating-Parity Zigzag Subsequence With a Minimum Step

Medium

Maximum Total Distinct Types Over Exactly K BoxesHard

Stock Trading with Cooldown and Priority PassesMedium

Split the Array with a Per-Group Setup FeeMedium

Stock Trading with a One-Day CooldownMedium

Reassemble Every Readable SentenceMedium

Length of the Longest Subsequence That Sums to TargetMedium

Maximum Sum of K Non-Overlapping Fixed-Length SubarraysHard

Stock Trading with Daily Holding FeeMedium

Transposed RefrainHard

Maximum Value of K Coins From PilesHard

Alternating Vowel PathsMedium

Best Time to Buy and Sell Stock IIMedium

Minimum-Cost Interleaving of Two SequencesHard

Count Strings of Length N with No Two Consecutive A'sMedium

Minimum Cost K-Partition with Per-Segment Range CostMedium

Compositions of N with No Two Equal Adjacent PartsMedium

Two Knights on a Phone KeypadHard

Energy HarvesterMedium

Project Phase Task AssignmentMedium

Maximum Subsequence Sum with Inversion ConstraintHard

String Alignment with Contiguous RemovalHard

Run-length Encoding Compression ScoreHard

Alternating Sign Subsequence with BonusMedium

String Alignment CostHard

Maximize Subsequence Sum with Gap PenaltyMedium

Maximum Total Value with Group RestrictionsMedium

Maximum Array Sum with Subarray FlipsHard

Minimum Cost to Partition Production OrdersMedium

Count Increasing TripletsMedium

Beautiful stringsHard

Geodesic Triple Sequence AlignmentHard

Alternating Subsequence MaximumMedium

Funny Jumping GameHard

Minimum Cost Grid PathHard

Maximum Sum of Good SubarrayHard

Permutaria Royal DanceHard

Sum of Beauty of Increasing SubsequencesHard

Flip Flop ArraysMedium

Forbidden ArrangementsHard

Minimum Operations for Character GroupingHard

Sum of Time to Traverse a RoadHard

Number of Distinct Common SubsequencesHard

All INFOSYS OA questions All Dynamic Programming questions Interview experiences

INFOSYS Dynamic Programming OA Questions | OAHelper