Cracking the Coding Interview

Dive into Data Structures and Algorithms

GitHub Repo   Download Zip

       

Introduction

Fun programming

Learning Data Structures and Algorithms in order to develop Logical and Analytical Thinking by solving 189 problems from all different zones.

Topics of Coverage

Mainly the following topics are covered.

Problems

Problem #	Problem Name	Status
Chapter 1: Arrays & Strings
2.1	Remove Dumps
2.2	Return Kth to Last
2.3	Delete Middle Node
2.4	Partition
2.5	Sum Lists
2.6	Palindrome
2.7	Intersection
2.8	Loop Detection
Chapter 2: Linked List
2.1	Remove Dumps
2.2	Return Kth to Last
2.3	Delete Middle Node
2.4	Partition
2.5	Sum Lists
2.6	Palindrome
2.7	Intersection
2.8	Loop Detection
Chapter 3: Stacks & Queues
3.1	Three in One
3.2	Return Kth to Last
3.3	Stack Min
3.4	Queue via Stacks
3.5	Sort Stack:
3.6	Animal Shelter

Helpful CTCI Libraries

AssortedMethods

//Generate Random Integer from 0 to n
> int randomInt(int n)

//Generate Random Integer from min to max
> int randomIntInRange(int min, int max)

//Generate Random Boolean value
> boolean randomBoolean()

//Generate Random Boolean value with probability of being True
> boolean randomBoolean(int percentTrue)

//Generate Random Boolean Matrix of Size M * N and Probability of being True
> boolean[][] randomBooleanMatrix(int M, int N, int percentTrue)

//Generate Random Matrix of size M * N with values in range min & max
> int[][] randomMatrix(int M, int N, int min, int max)

//Generate Random Array of Size N with values in range min & max
> int[] randomArray(int N, int min, int max)