Search for a command to run...
Series
This series is a personal study journal documenting my journey learning Python algorithms for coding tests. I'll share challenges, solutions, and insights as I work through different algorithm problems, hoping to learn and grow step by step.
1. How Recursive Calls Work When a recursive function is called, the current state of the function (parameter values, local variables, etc.) is saved onto the stack, and control moves to the newly called function. Then, the function completes its exe...
https://leetcode.com/problems/linked-list-cycle/description/ Entire Code # Definition for singly-linked list. class Node(object): def __init__(self, value): self.value = value self.next = None def create_linked_list(values): ...
In my Python algorithms class, we recently worked with linked lists. The reverse method is a popular topic in technical interviews, but it was slightly harder to understand than the remove method. Below are detailed notes on both. Remove The remove m...
Leetcode - middle of the linked list (URL) Entire code class Node: def __init__(self, value): self.value = value self.next = None class LinkedList: def __init__(self, value): new_node = Node(value) self.head...
I haven't taken the course because I had to work on my paper… Today, I learned about Prepend, Pop First, Get, Set, and Insert in Linked List(LL). Prepend def prepend(self, value): new_node = Node(value) if self.length == 0: ...
Append def append(self, value): new_node = Node(value) if self.head is None: self.head = new_node self.tail = new_node else: self.tail.next = new_node self.tail = new_node self.length += 1 Explanation ...