Skip to content

Implementation of Algorithms and Data Structures from Cracking the Coding Interview

Notifications You must be signed in to change notification settings

Komdosh/CrackingTheCodingInterview

Repository files navigation

Cracking The Coding Interview

This repo shows my own programming skills.

I took these tasks from the great book "Cracking The Coding Interview" written by Gayle Laakmann McDowell.

How to work with this repo?

You can see a links below with language tag and progress bar.

Each section was solved in a specific programming language. Progress means how far I have come, what tasks have been completed.

There you can find a readme files with implementation details. Each task has a naive (mine) and an optimized (described in the book) implementation. Does this mean that the naive will always be worse than the optimized one? - No, it's just mine own solution. First, I try to solve the problem on my own, this is how a naive implementation was created, then I read the solution described in the book and implement it in a specific language. Sometimes I have exactly the same point of view, then the task will have one solution.

You also be able to clone this project, compile and run my solutions.

Data Structures

  1. Arrays and Strings Kotlin 100%

  2. Linked Lists Go 100%

  3. Stacks and Queues Java 100%

  4. Trees and Graphs C/C++ 41%

Concepts and Algorithms

  1. Bit Manipulation Rust 12%

  2. Math and Logic Puzzles Python 0%

  3. Object-Oriented Design Java 0%

  4. Recursion and Dynamic Programming Go 0%

  5. System Design and Scalability Kotlin 0%

  6. Sorting and Searching C/C++ 0%

  7. Testing Kotlin 16%

Knowledge Based

  1. C and C++ C/C++ 0%

  2. Java Java 0%

  3. Databases SQL 0%

  4. Threads and Locks Go 0%

Tasks

  1. Moderate 0%

  2. Hard 0%

About

Implementation of Algorithms and Data Structures from Cracking the Coding Interview

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published