LRU cache | Live Coding with Explanation | Leetcode  

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!! Questions you might like: ✅✅✅[ Tree Data Structure ] : ru-vid.com/group/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls ✅✅✅[ Graphs Data Structure ] : ru-vid.com/group/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C ✅✅✅[ January Leetcoding Challenge ] : ru-vid.com/group/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn ✅✅✅[ December Leetcoding Challenge ] : ru-vid.com/group/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA ✅✅✅[ November Leetcoding Challenge ] : ru-vid.com/group/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e ✅✅✅[ August Leetcoding Challenge ] : ru-vid.com/group/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe ✅✅✅July Leetcoding challenges: ru-vid.com/group/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC- ✅✅✅June Leetcoding challenges: ru-vid.com/group/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG ✅✅✅May Leetcoding challenges: ru-vid.com/group/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e ✅✅✅Cracking the Coding Interview - Unique String: ru-vid.com/group/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂

Under rated channel, Thanks bro, understood it

one of the best solution...

Great explanation !

*insert() method without declaring headNext* void insert(Node node){ //insert into map map.put(node.key,node); //point node's next to head's next node.next = head.next; //point head's next' prev to node head.next.prev = node; head.next=node; node.prev=head; }

map.remove(node), how it will remove ,here key should be given not the value.

Have done the same approach with c++, but it's giving TLE. Can't find any single solution in c++ without tle in leetcode :( C++ Code: class Node{ public: int key, val; Node *prev, *next; Node(int key,int val){ this->key=key; this->val=val; } }; class LRUCache { public: int cap; Node* head=new Node(0,0); Node* tail=new Node(0,0); unordered_map mp; LRUCache(int capacity) { cap=capacity; head->next=tail; tail->prev=head; } void Add(Node* newNode){ mp[newNode->key]=newNode; Node* tmp=head->next; head->next=newNode; newNode->prev=head; newNode->next=tmp; tmp->prev=newNode; } void Delete(Node* node){ mp.erase(node->key); node->prev->next=node->next; node->next->prev=node->prev; } int get(int key) { if(mp.find(key)!=mp.end()){ // key present Node* resNode=mp[key]; Delete(resNode); Add(resNode); return resNode->val; } return -1; } void put(int key, int value) { if(mp.find(key)!=mp.end()){ // key is present Delete(mp[key]); } if(mp.size()==cap){ Delete(tail->prev); } Add(new Node(key,value)); } };

Understood :-)

@5:40 You remove tail.prev. I thought you would remove tail because the tail of linked list is the last node, isn't tail.prev the second last node?? Why is this not the case?