Design Linked List - Leetcode 707 - Python 

Creating extra dummy nodes is well-thought and makes the double linked list so easy to implement. Thanks a lot!

Commenting as a surprise for myself in a few months during Leetcode season Happy Neetcoding everyone 👍

The jump from ‘you can turn off your brain’ to ‘maybe you don’t have to turn off your brain too much’ had me😂😂😂😂😂😂😂

your consistency is awesome

This is very well explained, especially the illustrations. You've gained a new subscriber!

Nothing makes me more sad than after 2 hours of this trying to fix the 36th case, I give up and look this video up for a WAY more simpler and short solution. The count down loops would have helped :/

The doubly linked list is easy to implement it's the edge cases where a lot of errors happen. The dummy nodes really make it easy to implement a doubly linked list.

Thanks a lot 👍 I think the main idea here is 'two dummy nodes', this makes me control the boundaries of linked list. this technique helps in many linked list problems.

Explained well 👏👏. I am a regular follower of your channel. I have gone through your playlist, but I could only find a few hard problems and many easy and medium problems. Upload more leetcode hard problems. It will be beneficial for cracking Faang companies. Thank you.

at 7:33, can we just assume that index is always going to be 0 if cur is not null and cur is not self.right? What't the need to check index == 0 in the while loop?

Can anyone please tell me why in his last function: DeleteAtIndex only checked if curr != Self.right ? What about if the pointer is put on the left dummy node self.left ??

At the moment of writing this, this solution fails on Leetcode. For it to pass correctly you have to set a right boundary to the while loop list traversal by adding a `node != self.right` condition. Otherwise if you go out of bounds the code will try to access a .next property on a None value and will fail.

This solution gives me a memory limit exceeded error. Does anyone know why?

💪

There is no Memory Leak issue here - both Java and Python will immediately collect node to garbadge as far as it is not referenced from main program grapth.

cries in binary

Im early

Anyone else get AttributeError: 'NoneType' object has no attribute 'next' ^^^^^^^^^ prev.next = newNode Line 59 in addAtIndex (Solution.py) ^^^^^^^^^^^^^^^ result = obj.addAtIndex( Line 117 in __helper_select_method__ (Solution.py) ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ret.append(__DriverSolution__().__helper_select_method__(method, params[index], obj)) Line 163 in _driver (Solution.py) _driver() Line 172 in (Solution.py) with this solution?