Cracking the coding interview exercises and notes
Go to file
anebz 6280172289 fix: reordering and fix of small errors 2019-09-19 09:30:43 +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
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
11. Advanced topics folder renaming 2 2019-04-10 12:37:11 +02:00
16. Moderate problems fix: reordering and fix of small errors 2019-09-19 09:30:43 +02:00
17. Hard problems 17.14. word transformer 2019-05-09 17:00:53 +02:00
.gitignore fixed reverse double linked list code 2019-08-12 20:01:19 +02:00
README.md Updated exercises and README with ch2 2019-08-09 00:03:49 +02:00
introduction.md renaming and reordering 2019-03-27 16:45:11 +01:00

README.md

Cracking the coding interview exercises and notes

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
  • List intersection
  • Loop detection
  • Insert node at beginning
  • Insert node at end
  • Reverse list, single and double linked

Chapter 7 Object-oriented design

  • Hash tables

Chapter 8 Recursion

  • Magic index

Chapter 10 Sorting and searching

  • Sorted matrix search