Skip to content
Merged
Show file tree
Hide file tree
Changes from 9 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion CONTRIBUTING.md
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
# Contributing guidelines
<!-- # Contributing guidelines -->
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Don't edit the contributing guidelines

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

this seems to have happened by mistake, didn't intend to

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
<!-- # Contributing guidelines -->
# Contributing guidelines

Then please uncomment this line


## Before contributing

Expand Down
41 changes: 39 additions & 2 deletions data_structures/linked_list/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -21,8 +21,45 @@ def __init__(self) -> None:
self.head: Node | None = None
self.size = 0

def add(self, item: Any) -> None:
self.head = Node(item, self.head)
def add(self, item: Any, position: int = 0) -> None:
"""
Add an item to the LinkedList at the specified position.
Default position is 0 (the head).

Args:
item (Any): The item to add to the LinkedList.
position (int, optional): The position at which to add the item.
Defaults to 0.

Raises:
ValueError: If the position is negative.

>>> linked_list = LinkedList()
>>> linked_list.add(1)
>>> linked_list.add(2)
>>> linked_list.add(3)
>>> linked_list.add(4, 2)
>>> print(linked_list)
3 --> 2 --> 4 --> 1
"""
if position < 0:
raise ValueError("Position must be non-negative")

if position == 0 or self.head is None:
new_node = Node(item, self.head)
self.head = new_node
else:
current = self.head
counter = 0
while current and counter < position - 1:
current = current.next
counter += 1

if current: # Check if current is not None
new_node = Node(item, current.next)
current.next = new_node
else:
raise ValueError("Out of bounds")
self.size += 1

def remove(self) -> Any:
Expand Down