188 - Max Min | Greedy | Hackerrank Solution | Python

⭐️ Content Description ⭐️
In this video, I have explained on how to solve max min using sorting and simple logic in python. This hackerrank problem is a part of Problem Solving | Practice | Algorithms | Greedy | Max Min and solved in python. The complexity of this solution is O (n log n).

Make a small donation to support the channel 🙏🙏🙏:-

#maxmin #hackerranksolutions #hackersrealm #hackerrank #python #greedy #howtosolve #problemsolving #tutorial #algorithms #datastructures #programming #coding #codinginterview #education #aswin

[ranjithkalingeri]

can you please start solving backtracking problems

[avinashhemanth]

hey ashwin iam bit confused why this is not worked for this problem
arr.sort()
a=arr[:k]
return max(a)-min(a)