Cracking The Coding Interview 6th Edition In LeetCode

This article is inspired by CTCI Questions Lists(https://leetcode.com/discuss/interview-question/256347/ctci-questions-lists) by @eilat and https://ryanym.com/posts/ctci-on-leetcode/

However, they are something to be do more, so I checked all the problem by myself and added, modified the lists, and if adding only exact same problem, it's difficult to find, so I added simlilar, harder, or easier problems if possible.

If you want to add or modify, leave a comment, I'll check it and update it. Thanks.


Table of contents(click to go to the chapter)

Chapter 1: Arrays and Strings
Chapter 2: Linked Lists
Chapter 3: Stacks and Queues
Chapter 4: Trees and Graphs
Chapter 8: Recursion and Dynamic Programming
Chapter 10: Sorting and Searching
Chapter 16: Modreate
Chapter 17: Hard


Chapter 1: Arrays and Strings

1.1 Is Unique

1.2 Check Permutation

1.3 URLify ← Not Found

1.4 Palindrome Permutation

1.5 One Away

1.6 String Compression

1.7 Rotate Matrix

1.8 Zero Matrix

1.9 String Rotation


Chapter 2: Linked Lists

2.1 Remove Dups

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 and Queues

3.1 Three In One - Not Found

3.2 Stack Min

3.3 Stack of Plates

3.4 Queue via Stacks

3.5 Sort Stacks - Not Found

3.6 Animal Shelter - Not Found


Chapter 4: Trees and Graphs

4.1 Route Between Nodes

4.2 Minimal Tree

4.3 List of Depths

4.4 Check Balanced

4.5 Validate BST

4.6 Successor

4.7 Build Order

4.8 First Common Ancestor

4.9 BST Sequences 

4.10 Check Subtree

4.11 Random Node - Not Found

4.12 Paths with Sum


Chapter 8: Recursion and Dynamic Programming

8.1 Triple Step

8.2 Robot in a Grid

8.3 Magic Index - Not Found

8.4 Power Set

8.5 Recursive Multiply

8.6 Towers of Hanoi - Not Found

8.7 Permutation without Dups

8.8 Permutation with Duplicates

8.9 Parens

8.10 Paint Fill

8.11 Coins

8.12 Eight Queens

8.13 Stack of Boxes

8.14 Boolean Evaluation - Not Found


Chapter 10: Sorting and Searching

10.1 Sorted Merge

10.2 Group Anagrams

10.3 Search in Rotated Array

10.4 Sorted Search

10.5 Sparse Search - Not Found

10.6 Sort Big File - Not Found

10.7 Missing Int

10.8 Find Duplicates

10.9 Sorted Matrix Search

10.10 Rank from Stream

10.11 Peaks and Valleys


Chapter 16: Modreate

16.1. Number Swapper - Not Found

16.2. Word Frequencies

16.3. Intersection - Not Found

16.4. Tic Tac Win

16.5. Factorial Zeros

16.6. Smallest Difference - Not Found

16.7. Number Max - Not Found

16.8. English Int

16.9. Operations - Not Found

16.10. Living People - Not Found

16.11. Diving Board - Not Found

16.12. XML Encoding - Not Found

16.13. Bisect Squares - Not Found

16.14. Best Line

16.15. Master Mind - Not Found

16.16. Sub Sort

16.17. Contiguous Sequence

16.18. Pattern Matcher

16.19. Pond Sizes

16.20. T9

16.21. Sum Swap - Not Found

16.22. Langtons Ant - Not Found

16.23. Rand7 From Rand5

16.24. Pairs With Sum

16.25. LRU Cache

16.26. Calculator


Chapter 17: Hard

17.1. Add Without Plus

17.2. Shuffle

17.3. Random Set - Not Found

17.4. Missing Number

17.5. Letters and Numbers

17.6. Count of 2s - Not Found

17.7. Baby Names - Not Found

17.8. Circus Tower - Not Found

17.9. Kth Multiple - Not Found

17.10. Majority Element

17.11. Word Distance

17.12. BiNode

17.13. ReSpace - Not Found

17.14. Smallest K

17.15. Longest Word

17.16. The Masseuse

17.17. Multi Search - Not Found

17.18. Shortest Supersequence

17.19. Missing Two

17.20. Continuous Median

17.21. Volume of Histogram

17.22. Word Transformer

17.23. Max Black Square

17.24. Max Submatrix - Not Found

17.25. Word Rectangle - Not Found

17.26. Sparse Similarity - Not Found

Comments (54)