Cracking the coding interview exercises and notes
Go to file
anebz 44805d8516 16.8. maximum subarray problem
O(n) time, O(1) space
2019-04-10 20:32:45 +02:00
01. Arrays and strings folder renaming 3 2019-04-10 12:40:32 +02:00
07. Object-Oriented design folder renaming 3 2019-04-10 12:40:32 +02:00
08. Recursion folder renaming 3 2019-04-10 12:40:32 +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 16.8. maximum subarray problem 2019-04-10 20:32:45 +02:00
.gitignore counter exercise 2019-03-29 23:42:31 +01:00
README.md folder renaming 2019-04-10 12:36:12 +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 7 Object-oriented design

  • Hash tables

Chapter 8 Recursion

  • Magic index

Chapter 10 Sorting and searching

  • Sorted matrix search