silva
/
ctci
mirror of https://github.com/viniciusfdasilva/ctci.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
Cracking the coding interview exercises and notes
92 Commits 1 Branch 0 Tags 6 MiB
Java 55%
Python 32.3%
C++ 12.7%
Go to file
anebz eb827fc049 18.5. Dijkstra's algorithm 2019-10-12 19:57:02 +02:00
01. Arrays and strings hackerrank order string by swaps 2019-08-21 11:32:10 +02:00
02. Linked lists fix: reordering and fix of small errors 2019-09-19 09:30:43 +02:00
03. Stacks and queues 3.6. animal shelter 2019-09-24 16:44:05 +02:00
04. Trees and graphs 4. README graph search finished 2019-09-27 22:34:11 +02:00
07. Object-Oriented design folder renaming 3 2019-04-10 12:40:32 +02:00
08. Recursion fix: reordering and fix of small errors 2019-09-19 09:30:43 +02:00
10. Sorting and searching folder renaming 2 2019-04-10 12:37:11 +02:00
16. Moderate problems 16.25. LRU cache 2019-09-19 09:31:26 +02:00
17. Hard problems 17.14. word transformer 2019-05-09 17:00:53 +02:00
18. Advanced topics 18.5. Dijkstra's algorithm 2019-10-12 19:57:02 +02:00
.gitignore fixed reverse double linked list code 2019-08-12 20:01:19 +02:00
README.md updated README with ch3 and ch18 topics 2019-10-03 23:25:03 +02:00
introduction.md renaming and reordering 2019-03-27 16:45:11 +01:00

README.md

Cracking the coding interview exercises and notes

If you can't afford to buy the book, you can find a free pdf here.

Introduction

  1. Big O
  2. Technical questions

Chapter 1 Arrays and strings

  • check unique characters
  • check if permutation
  • replace character by substring
  • Levenshtein distance
  • String compression
  • Matrix rotation
  • String rotation
  • Hash tables (chapter 7)
  • Magic index (chapter 8)
  • Search in sorted matrix (chapter 10)

Chapter 2 Linked lists

  • Remove duplicates
  • Return kth to last
  • Delete middle node
  • Partition list
  • Sum lists
  • Check if palindrome
  • Insert node at beginning
  • Insert node at end
  • Reverse list, single and double linked
  • List intersection
  • Loop detection

Chapter 3 Stacks and queues

  • 3 stacks in array
  • Min function in stack
  • List of stacks
  • Queue via stack
  • Sort stack
  • Animal shelter (enqueue and dequeue with ordering)

Chapter 4 Trees and graphs

Chapter 7 Object-oriented design

  • Hash tables

Chapter 8 Recursion

  • Magic index (index such that A[i] = 1)

Chapter 10 Sorting and searching

  • Sorted matrix search

Chapter 16 Moderate problems

  • Write an integer in english
  • Contiguous sequence or Maximum subarray
  • Least Recently Used cache

Chapter 18 Advanced topics

  • Hash table collision resolution
  • Rabin-Karp substring search