Company Topic
INFOSYS Array OA Questions
Practice 16+ Array coding questions asked in INFOSYS online assessments.
Maximum Total Distinct Types Over Exactly K BoxesHardLongest Parity-Step StreakMediumStock Trading with a One-Day CooldownMediumMaximum Sum of K Non-Overlapping Fixed-Length SubarraysHardStock Trading with Daily Holding FeeMediumTransposed RefrainHardPower Grid Surge NavigationMediumMaximum Value of K Coins From PilesHardBest Time to Buy and Sell Stock IIMediumMinimum-Cost Interleaving of Two SequencesHardMinimum Cost K-Partition with Per-Segment Range CostMediumMaximum Position-Weighted Sum of K ItemsMediumMax K XOR SumEasyEnergy HarvesterMediumMaximum Sum of ScoresMediumPeak Overlap ScoreMediumMaximum Subsequence Sum with Inversion ConstraintHardAlternating Sign Subsequence with BonusMediumLexicographically Minimal Array Segment ProductHardMaximize Subsequence Sum with Gap PenaltyMediumSatellite Signal ProcessingHardMaximum Total Value with Group RestrictionsMediumMaximum Array Sum with Subarray FlipsHardMaximize Fixed Points After One SwapMediumMinimum Cost to Partition Production OrdersMediumCount Increasing TripletsMediumGeodesic Triple Sequence AlignmentHardAlternating Subsequence MaximumMediumFunny Jumping GameHardMaximum Sum of Good SubarrayHardTranquil PairsHardSum of Beauty of Increasing SubsequencesHardFlip Flop ArraysMediumAssign Cookies with Matching ParityMediumSmallest Elements by ParityEasyCount Equal Codes Within Distance KMediumLongest Alternating-Parity Zigzag Subsequence With a Minimum StepMediumMaximum Pairs Where One Member Divides A and the Other Divides BMediumStock Trading with Cooldown and Priority PassesMediumSplit the Array with a Per-Group Setup FeeMediumBakery Oven RotationMediumLength of the Longest Subsequence That Sums to TargetMediumTwo Editors — Maximum Profit DifferenceEasyMaximum Value After One Bit FlipEasyMaximum Total Rectangle AreaMediumChoose Two Equal SubsetsHardSum of Time to Traverse a RoadHardEqual Heights in Minimum YearsHardEqualize Building HeightsMediumSum of Indices for Good SubarraysHard