Greedy Algorithms Interview Questions | HackerRank

We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

|

Prepare
Certify
Compete
Apply

Hiring developers?

Prepare
Interview Preparation Kit
Greedy Algorithms

Greedy Algorithms

Minimum Absolute Difference in an Array
EasyProblem Solving (Basic)Max Score: 15Success Rate: 87.38%

Given a list of integers, calculate their differences and find the difference with the smallest absolute value.

Luck Balance
EasyProblem Solving (Basic)Max Score: 20Success Rate: 93.31%

Greedy Florist
MediumProblem Solving (Basic)Max Score: 35Success Rate: 94.12%

Max Min
MediumProblem Solving (Basic)Max Score: 35Success Rate: 86.12%

Reverse Shuffle Merge
AdvancedProblem Solving (Advanced)Max Score: 50Success Rate: 59.68%

Status

Solved

Unsolved

Difficulty

Easy

Medium

Hard

Blog
Scoring
Environment
FAQ
About Us
Helpdesk
Careers
Terms Of Service
Privacy Policy

Cookie support is required to access HackerRank

Seems like cookies are disabled on this browser, please enable them to open this website