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
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
Best solution I've seen for this problem. This channel is so underrated.
great explanation nikhil! The delivery and quality is top notch
I always search ur u tube to vlear any confusion ..great job
Similar to the house robber I. Thanks for the explanation.
Excellent explanation sir
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
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
Hey bro,Will you please make a video on collection framework?? Much needed one.
Good explanation Nikhil !
this is my first playlist where i didnt skipped a video or changed playlist while learning programming , thank u sir
Please upload more videos on hard leetcode problem
maza aa gya
merei professor ne ye mid sem mei de diya