135. Candy Leetcode solution in C++. #cpp #leetcode

Explaining and solving the Candy (hard) Leetcode problem in C++. I have used greedy approach with 2 loops checking left neighbors of a current element and right neighbors respectively. Please let me know if you liked this video. Stay tuned for the next one! Like, comment, subscribe if this was helpful or if you have any feedback. Thank you for watching! :)