0% completed

All LessonsFree Lessons (8)

Basics

Introduction Need for Speed Analyzing Algorithms Analyzing Algorithms Part II Analyzing Algorithms Part III Problem Set 1

Formal Analysis Tools

Functions and Their Growth Theta Notation Big O and Big Omega Notations Small omega and Small o Notations Problem Set 2 Solution Set 2

Recursive

Recurrence Recurrence Part II Binary Search - Recursive Implementation Permutations Dynamic Programming Top Down and Bottom Up Approaches Problem Set 3 Solution Set 3

Data-Structures

Doubly Linked List

Stacks and Queues

Tree Structures

Priority Expiry Cache Problem

Amortized Analysis

Cost Over Sequence of Operations Dynamic Array Fancy Stack Problem Set 5 Solution Set 5

Probabilistic Analysis

Quantifying Chance & Randomness Random Variables Probability Distribution Expected Value of a Random Variable The Tinder Problem

Complexity Theory

Why should I bother?P and NP classes Get Rich with Complexity NP-Complete and NP-Hard Between P and NP ?Problem Set 6

The End

Cheat Sheet Epilogue

Practice Mock Interview

Big-O Notation For Coding Interviews and Beyond/

...

/

Doubly Linked List

Doubly Linked List

This section explores operations on a doubly linked list

We'll cover the following...

Doubly Linked List

We ended the section on linked list with a question on the complexity of an operation that seeks to find the parent of a given linked list node. The answer is O(n) since if you give me a linked list node, I still need to start from the head and traverse down the linked list matching each node with the one given to me ...