Company Topic
Infosys Greedy OA Questions
Practice 11+ Greedy coding questions asked in Infosys online assessments.
Blocks: Maximum Alternating Binary Value
Medium
Max K XOR Sum
Easy
Sanitization Scheduling
Hard
Meeting Room Allocation
Medium
Alternating Sign Subsequence with Bonus
Medium
Lexicographically Minimal Array Segment Product
Hard
Maximum Array Sum with Subarray Flips
Hard
Maximize Fixed Points After One Swap
Medium
Minimum Operations to Transform
Easy
Alternating Subsequence Maximum
Medium
Maximum Total Rectangle Area
Medium
Equal Heights in Minimum Years
Hard
Equalize Building Heights
Medium
Optimal Permutation with XOR Condition
Medium
All Infosys OA questions
All Greedy questions
Interview experiences