Company Topic
INFOSYS Greedy OA Questions
Practice 8+ Greedy coding questions asked in INFOSYS online assessments.
Stock Trading with Daily Holding FeeMediumPower Grid Surge NavigationMediumBest Time to Buy and Sell Stock IIMediumMaximum Position-Weighted Sum of K ItemsMediumMaximum Network Engagement FrequencyHardBlocks: Maximum Alternating Binary ValueMediumMax K XOR SumEasySanitization SchedulingMediumMeeting Room AllocationMediumAlternating Sign Subsequence with BonusMediumLexicographically Minimal Array Segment ProductHardMaximum Array Sum with Subarray FlipsHardMaximize Fixed Points After One SwapMediumMinimum Operations to TransformEasyAlternating Subsequence MaximumMediumAssign Cookies with Matching ParityMediumMaximum Pairs Where One Member Divides A and the Other Divides BMediumStock Trading with Cooldown and Priority PassesMediumBakery Oven RotationMediumTwo Editors — Maximum Profit DifferenceEasyMaximize the Minimum Worker-Task ScoreMediumMaximum Value After One Bit FlipEasyMaximum Total Rectangle AreaMediumEqual Heights in Minimum YearsHardEqualize Building HeightsMediumOptimal Permutation with XOR ConditionMediumSteps to ZeroEasy