Cracking The Coding Interview

Cracking the Coding Interview is a book written by Gayle Laakmann McDowell, which is intended to help job seekers prepare for technical interviews at software companies. It also includes information on various topics such as big O notation, data structures and algorithms, and 189 programming interview questions, ranging from the basics to the trickiest algorithm problems.

Here you will find my notes about the concepts explained in the book (for chapters) and my problem solutions in C++.

	Notes
	1.1 Big O Time & Space
	1.2 How to Prepare
	1.3 Optimize & Solve Technique
	1.3.1. Best Conceivable Runtime (BCR)
	2.1 Hash Tables
	2.2 Linked Lists
	2.3 Queues
	2.4 Stacks
	2.5 StringBuilder
	3.1 Trees (in italian)
	3.2 Binary Trees (in italian)
	3.3 Binary Search Trees (in italian)
	3.4 Graphs (in italian)
	4. Bit Manipulation

	Problem solutions
Chapter 1.	Problem 1 - IsUnique
	Problem 2.1 - Check Permutation
	Problem 2.2 - Check Permutation
	Problem 3 - URLify
	Problem 4 - Palindrome Permutation
	Problem 5 - One Away
	Problem 6 - String Compression
	Problem 7 - Rotate Matrix
	Problem 8 - Zero Matrix
	Problem 9 - String Rotation
Chapter 2.	Problem 1 - Remove Dups
	Problem 2 - Return Kth to Last
	Problem 3 - Delete Middle Node
	Problem 4 - Partition
	Problem 5 - Sum Lists
	Problem 6 - Palindrome
	Problem 7 - Intersection
	Problem 8 - Loop Detection
Chapter 3.
Chapter 4.	Problem 1 - Route Between Nodes
	Problem 2 - Minimal Tree
	Problem 3 - List of Depths
	Problem 4 - Check Balanced
	Problem 5 - Validate BST
	Problem 6 - Successor
	Problem 7 - Build Order