Company Topic
INFOSYS Dynamic Programming OA Questions
Practice 4+ Dynamic Programming coding questions asked in INFOSYS online assessments.
Maximum Sum of K Non-Overlapping Fixed-Length SubarraysHardStock Trading with Daily Holding FeeMediumTransposed RefrainHardMaximum Value of K Coins From PilesHardAlternating Vowel PathsMediumBest Time to Buy and Sell Stock IIMediumMinimum-Cost Interleaving of Two SequencesHardCount Strings of Length N with No Two Consecutive A'sMediumMinimum Cost K-Partition with Per-Segment Range CostMediumCompositions of N with No Two Equal Adjacent PartsMediumPairsMediumEnergy HarvesterMediumProject Phase Task AssignmentMediumMaximum Subsequence Sum with Inversion ConstraintHardString Alignment with Contiguous RemovalHardRun-length Encoding Compression ScoreHardAlternating Sign Subsequence with BonusMediumString Alignment CostHardMaximize Subsequence Sum with Gap PenaltyMediumMaximum Total Value with Group RestrictionsMediumMaximum Array Sum with Subarray FlipsHardMinimum Cost to Partition Production OrdersMediumCount Increasing TripletsMediumBeautiful stringsHardGeodesic Triple Sequence AlignmentHardAlternating Subsequence MaximumMediumFunny Jumping GameHardMinimum Cost Grid PathHardMaximum Sum of Good SubarrayHardPermutaria Royal DanceHardSum of Beauty of Increasing SubsequencesHardFlip Flop ArraysMediumQuestion 1HardForbidden ArrangementsHardLongest Alternating-Parity Zigzag Subsequence With a Minimum StepMediumMaximum Total Distinct Types Over Exactly K BoxesHardStock Trading with Cooldown and Priority PassesMediumSplit the Array with a Per-Group Setup FeeMediumStock Trading with a One-Day CooldownMediumReassemble Every Readable SentenceMediumLength of the Longest Subsequence That Sums to TargetMediumTwo Knights on a Phone KeypadHardMinimum Operations for Character GroupingHardSum of Time to Traverse a RoadHardNumber of Distinct Common SubsequencesHardLight Road WalkingHard