Minimum Operations | Hackerearth | Arrays Practice Problem | DSA

preview_player
Показать описание
This is a practice problem from Hackerearth.
In this video I will give you insights on what goes into one's head while solving a coding problem. I'll teach you how to understand problems, approach to find solutions and implement them.
In the end I will explain some basic concepts of time and space complexity.

Timecodes
0:00 - Intro
0:15 - Problem Analysis
5:23 - Code Implementation
8:30 - Extra Tips on Improving Time and Space Complexity

Hope this helps to become a better programmer.

Please share your feedback in the comments.

If you like this video, give it a thumbs up to keep me motivated.

Subscribe for more such videos.

Share to your friends to spread more knowledge.

Thank You!

Рекомендации по теме
Комментарии
Автор

Thank you sir for explaination, but I have one doubt like if array is:1, 2, 3, 1, 4, 2, 3.then count becomes 7, but actual operations are 4 only

-VLaharika
Автор

Need Help In Coding Please Reply Soon.

jatinbhardwaj
join shbcf.ru