[go: up one dir, main page]
Scribd
Upload
8K views4 pages

Coding Interview Prep Guide

This document is the table of contents for Cracking the Coding Interview 6th edition. It lists the introduction and chapters on Big O notation, time complexity, and best/worst case scenarios as some of the topics covered in the book. The document provides an overview of the structure and content included in Cracking the Coding Interview 6th edition.

Uploaded by

meetshah95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8K views4 pages

Coding Interview Prep Guide

This document is the table of contents for Cracking the Coding Interview 6th edition. It lists the introduction and chapters on Big O notation, time complexity, and best/worst case scenarios as some of the topics covered in the book. The document provides an overview of the structure and content included in Cracking the Coding Interview 6th edition.

Uploaded by

meetshah95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Cracking

the Coding Interview 6th edition

Table of Contents
Introduction

BIg(O)Notation

Cracking the Coding Interview 6th edition

Cracking the coding interview 6th edition


Go over all the programming questions and keep reminders and cheat notes.

Introduction

Cracking the Coding Interview 6th edition

BIg(O)Notation
Time Complexity
O(1) constant time. This is never counted. O(n) this mean it takes n time. O(n) is linear time.
No matter how big the constant O(1) is linear will surpass it at some point.
Industry meaning of Big O notation is more academia Big Theta. Big O merges the

Best case Worst case and Expected Case


Best case ususally for most algorithms could be O(1

BIg(O)Notation

You might also like