Design Browser History | Made Easy | META | Leetcode 1472

[@ankitsingh6624]

Aap itna acha teach karte ho ki repeat dekhta hu question already karne ke baad bhi raretalent.🙇🙇

[@codestorywithMIK]

Thank you so much Ankit ❤️

[@amitshankhwar2542]

Soo true ..

[@codestorywithMIK]

Apologies for the delay today guys. Have been travelling this weekend. Hope you guys will understand ❤❤❤

[@UECAshutoshKumar]

Thank you 😊

[@anuppatankar4294]

By seeing your video today I was able to code it myself. Your daily uploads are really helpful for improving my skills. Keep up the great work! 👍🏻

[@codestorywithMIK]

Thanks a lot ❤

[@molyoxide8358]

In the morning, I saw today's problem & left it(too lazy), but after this video removed my laziness & I went forward to solve this challenge. Thanks again for your guidance.

[@codestorywithMIK]

Excellent!❤

[@utsabkundu27]

Code in Java: class BrowserHistory { Stack past=new Stack(); Stack future=new Stack(); String curr; public BrowserHistory(String homepage) { curr=homepage; } public void visit(String url) { past.push(curr); curr=url; future=new Stack(); } public String back(int steps) { while(steps>0 && past.size()>0) { future.push(curr); curr=past.peek(); past.pop(); steps--; } return curr; } public String forward(int steps) { while(steps>0 && future.size()>0) { past.push(curr); curr=future.peek(); future.pop(); steps--; } return curr; } }

[@Whirlwind03]

Amazing Explanation brother was literally waiting for your video

[@codestorywithMIK]

Thank you so much Sajan

[@wearevacationuncoverers]

One of the finest explanations on this.

[@shikharpandya4927]

Anyone who wants to practise dsa like listening a story this is the guy u should follow :)

[@souravjoshi2293]

Thanks for working for us during weekends also bro. Respect hai tumhare lie

[@rajgupta5355]

Bhaiya this is superb....

[@tutuimam3381]

Thanks a lot

[@anshumantripathy115]

At 5:50 , when "BrowserHistory" is called the current is initialized and the url is also added to the back stack. So, the top of the stack is actually the value of current. Later also the same thing is done in the story, the top of the back stack is the value of current but in the code you have done different.

[@anshumantripathy115]

A/c to the story this should be the code, but I am getting error class BrowserHistory { public: stack past; stack future; string current; BrowserHistory(string homepage) { current = homepage; past.push(homepage); } void visit(string url) { future = stack(); past.push(url); current = url; } string back(int steps) { while (steps > 0 && !past.empty()) { future.push(current); past.pop(); current = past.top(); steps--; } return current; } string forward(int steps) { while (steps > 0 && !future.empty()) { past.push(future.top()); future.pop(); current = past.top(); steps--; } return current; } };

[@vedantdeshmukh1778]

@@anshumantripathy115 I am facing same error.

[@anshumantripathy115]

@@vedantdeshmukh1778 class BrowserHistory { public: stack past; stack future; string current; BrowserHistory(string homepage) { current = homepage; past.push(homepage); } void visit(string url) { future = stack(); past.push(url); current = url; } string back(int steps) { while (steps > 0 && !past.empty()) { /* code */ future.push(current); past.pop(); if(!past.empty()){ current = past.top(); }else{ past.push(current); future.pop(); } cout

[@anshumantripathy115]

@@vedantdeshmukh1778 There are some corner cases which needs to be checked. Check the new code I shared. This one works, but it becomes a bit complex using this approach rather we should follow the code shared by MIK.

[@codestorywithMIK]

You are right Anshuman. Missed to cover corner cases in explanation. Thank you so much for pointing this out

[@Aditrash-n5j]

Instead of using "curr" you can use "peek" of stack to return values, like this class BrowserHistory { Stack backward; Stack forward; public BrowserHistory(String homepage) { backward = new Stack(); forward = new Stack(); backward.push(homepage); } public void visit(String url) { // Clear forward while(!forward.isEmpty()) forward.pop(); backward.push(url); } public String back(int steps) { // Pop from backward into forward while(backward.size() != 1 && steps != 0){ forward.push(backward.pop()); steps--; } return backward.peek(); } public String forward(int steps) { // Pop form forward into backword while(!forward.isEmpty() && steps != 0){ backward.push(forward.pop()); steps--; } return backward.peek(); } }

[@molyoxide8358]

Yeah It's Sunday tomorrow we need 2 other approaches too. A Humble request from a Coder to Coder🥰 And also if you're free please shed some light on leetcode - 1019 as I requested in the previous video.

[@codestorywithMIK]

Sure. Travelling this weekend. Will make for sure next week

[@rajgupta5355]

Bhaiya other 2 approaches k liye please video bnaiyega

[@Imrockonn]

❤

[@KishanSingh-vc3re]

Do they ask such questions in Dsa rounds or only in system design interviews

[@waghakshay540]

sir canyou please make a dryrun video for this code..I have some confusion

[@sonalipatro2087]

please make video on other two approaches as well

[@codestorywithMIK]

Sure. Travelling this weekend. Will make for sure next week

[@Ramneet04]

I waa able to code with two stack approach, hey well dlubly ll is more optimise???

[@aryanvashishtha0001]

Bro explaination is Top-notch but pls try to improve the quatlity of video if possible....

[@codestorywithMIK]

Actually the quality will improve after a while as it takes some time to upload full quality from KZbin And thank you so much for your kind words ❤❤❤

[@udaykumarchetla6205]

Bro can u upload videos for today's contest last 2 problems?

[@souravjoshi2293]

Waiting for today's Leetcode

[@codestorywithMIK]

Being uploaded

[@YashSinghal]

daab diya 😅😆

[@hirenjoshi6073]

Hi Bro! Make it using Doubly Linked List

[@swapnilnangare5805]

Mazhar bhai ek baar word break bhi samaza do pls. Trie ke saath dp samazne ke liye hard ja rahi hain. lots of love.

[@codestorywithMIK]

That’s a wonderful Qn swapnil. Noted. Let me cover that too. Thanks again for pointing

[@omkarjadhav848]

Bhaiya using doubly linked list bhi samza dena please

[@whodatsaken]

great explanation bro. loved it for those who want DLL implementation class BrowserHistory { public: struct ListNode{ string data; ListNode* prev; ListNode* next; ListNode(string x){ data=x; prev=nullptr; next=nullptr; } }; ListNode* head=nullptr; BrowserHistory(string homepage) { head=new ListNode(homepage); } void visit(string url) { ListNode* temp=new ListNode(url); temp->prev=head; head->next=temp; head=head->next; } string back(int steps) { while(head->prev!=nullptr and steps){ head=head->prev; steps--; } return head->data; } string forward(int steps) { while(head->next!=nullptr and steps){ head=head->next; steps--; } return head->data; } };

[@Babu_Vishaal]

bro ...! ho sake to job opening ke update bta diya kro.

[@codestorywithMIK]

Sure Vishal

[@aadityabuchale15]

Bhiya bohot late kr diya.. its okay i know you might be in any work.. btw thanks for the video..

[@codestorywithMIK]

Thank you for understanding Aaditya ❤️

[@somsk56]

Sir , I GUESS STACK APPROACH , IT IS NOT OK FOR INTERVIEW RIGHT ? SO WHICH ONE I HAVE TO FOLLOW PLEASE TELL ME

[@codestorywithMIK]

You can use any approach. Totally depends on what the interviewer wants.

[@somsk56]

@@codestorywithMIK If you are interviewer then what do you prefer sir ?

[@amir26ansari]

Good voice , whats ur name

[@codestorywithMIK]

Thanks Amir. It’s Mazhar

[@kumarsaurabh5449]

class BrowserHistory { public: vectormp; int curr; BrowserHistory(string homepage) { mp.push_back(homepage); curr=0; } void visit(string url) { mp.erase(mp.begin()+curr+1,mp.end()); mp.push_back(url); curr++; } string back(int steps) { curr=max(0,curr-steps); return mp[curr]; } string forward(int steps) { curr=min((int)mp.size()-1,curr+steps); return mp[curr]; } }; // vector approach

[@MakeuPerfect]

bhaiya aj ka daily challenge ??

[@codestorywithMIK]

It will come soon . Sorry for the delay. Have been travelling this weekend. But it will be uploaded today. Few things : 1) The best part about today’s qn is that it can be solved using already used template of TRIE that I taught. It will be fun ✌️❤️

[@codestorywithMIK]

Being uploaded now