Min Cost Climbing Stairs (LeetCode 746) | Full solution with thought process and animations

[@dineshkm7832]

Best solution I've seen for this problem. This channel is so underrated.

[@santasingh9045]

great explanation nikhil! The delivery and quality is top notch

[@sudheeri1171]

You are amazing at presenting the DSA.
Could you please sort the DSA questions based on Blind 75 or Interview 150 or some other sheet?
It would be great for revision or for learning quickly in a couple of months

[@unknownman1]

Similar to the house robber I. Thanks for the explanation.

[@dineshkm7832]

I always search ur u tube to vlear any confusion ..great job

[@yourhelper433]

Excellent explanation sir

[@shaikmubashira5836]

this is my first playlist where i didnt skipped a video or changed playlist while learning programming , thank u sir

[@ianuj4231]

thank you... u are great from your solution... could derive the space optimized.. one..
class Solution {
public:
int minCostClimbingStairs(vector& nums) {
int n = nums.size();
int prev2=0, prev1=0;
for(int i=2;i

[@vidhyabaskar202]

Good explanation Nikhil !

[@Homelander_30]

Hey bro,Will you please make a video on collection framework?? Much needed one.

[@urvashichaurasia6284]

Please upload more videos on hard leetcode problem

[@Busybee-x4l]

maza aa gya

[@Busybee-x4l]

merei professor ne ye mid sem mei de diya