coderz.py

Keep Coding Keep Cheering!

Linked List Reversal in Python

Write a function to reverse a Linked List in place. The function will take in the head of the list as input and return the new head of the list.

September 15, 2020 | Data Structure, python | No comments

Linked List Nth to Last Node in Python

Write a function that takes a head node and an integer value n and then returns the nth to last node in the linked list. For example, given:

September 13, 2020 | Data Structure, python | No comments

Singly Linked List Cycle Check in Python

Given a singly linked list, write a function which takes in the first node in a singly linked list and returns a boolean indicating if the linked list contains a “cycle”.

September 10, 2020 | Algorithm, Data Structure, python | No comments

Implementation of Doubly Linked List in Python

In Doubly Linked List, We declare two pointers to store location of next Node and previous Node.

September 10, 2020 | Data Structure, python | No comments

Understand Doubly Linked List Data Structure

In a doubly linked list, we define a linked list in which each node keeps an explicit reference to the node before it and a reference to the node after it.

September 7, 2020 | Data Structure | No comments

Top Coding Challenge Websites in 2020

Coding Challenge websites you can use to develop your coding skills and the best way to improve your skill when learning to code is by solving coding challenges.

September 4, 2020 | general | No comments

8 common data structures every programmer must know

Data structure is a way of data organization, management, and storage format that enables efficient access and modification.

September 2, 2020 | Data Structure | No comments

Implementation of Singly Linked List in Python

In a singly linked list, we have an ordered list of items as individual Nodes that have pointers to other Nodes.

September 1, 2020 | Data Structure, python | 1 comment

Understand The Singly Linked List and its Operation

A singly linked list, in its simplest form, is a collection of nodes that collectively form a linear sequence. Each node stores a reference to an object that is an element of the sequence, as well as a reference to the next node of the list.

August 21, 2020 | Data Structure | 1 comment

Understand Big-O Notation Complexity Of Algorithm

Big-O notation is a relative representation of the complexity of an algorithm.

August 18, 2020 | Algorithm, Data Structure | No comments

Advertisement