Этот материал находится в платной подписке. Оформи премиум подписку и смотри или слушай 11 Essential Coding Interview Questions + Coding Exercises!, а также все другие курсы, прямо сейчас!
• Урок 1. 00:01:24
Introduction
• Урок 2. 00:02:27
What Is a Typical Coding Interview Like?
• Урок 3. 00:05:28
Problem Solving Technique #1 for Coding Interviews
• Урок 4. 00:03:08
Problem Solving Technique #2 for Coding Interviews
• Урок 5. 00:02:18
Problem Solving Technique #3 for Coding Interviews
• Урок 6. 00:01:08
Most Frequently Occurring Item in an Array (Difficulty = *)
• Урок 7. 00:03:40
Most Frequently Occurring Item in an Array (Solution)
• Урок 8. 00:00:54
Common Elements in Two Sorted Arrays (Difficulty = **)
• Урок 9. 00:03:39
Common Elements in Two Sorted Arrays (Solution)
• Урок 10. 00:01:07
Is One Array a Rotation of Another? (Difficulty = **)
• Урок 11. 00:04:11
Is One Array a Rotation of Another? (Solution)
• Урок 12. 00:00:48
Non-Repeating Character (Difficulty = **)
• Урок 13. 00:02:49
Non-Repeating Character (Solution)
• Урок 14. 00:02:18
One Away Strings (Difficulty = ***)
• Урок 15. 00:03:06
One Away Strings (Solution)
• Урок 16. 00:05:32
One Away Strings (Solution in Pseudocode)
• Урок 17. 00:02:11
Assign Numbers in Minesweeper (Difficulty = **)
• Урок 18. 00:04:47
Assign Numbers in Minesweeper (Solution)
• Урок 19. 00:03:36
Find Where to Expand in Minesweeper (Difficulty = ***)
• Урок 20. 00:10:53
Find Where to Expand in Minesweeper (Solution)
• Урок 21. 00:04:24
Find Where to Expand in Minesweeper (Solution in Pseudocode)
• Урок 22. 00:01:20
Rotating 2D Array (Difficulty = ***)
• Урок 23. 00:05:22
Rotating 2D Array (Out-of-Place Solution)
• Урок 24. 00:07:06
Rotating 2D Array (In-Place Solution)
• Урок 25. 00:05:20
Rotating 2D Array (In-Place Solution in Pseudocode)
• Урок 26. 00:02:30
N-th Element of a Linked List (Difficulty = **)
• Урок 27. 00:05:08
N-th Element of a Linked List (Solution)
• Урок 28. 00:03:09
Is This a Binary Search Tree? (Difficulty = **)
• Урок 29. 00:02:44
Is This a Binary Search Tree? (Solution)
• Урок 30. 00:05:06
Is This a Binary Search Tree? (Solution in Pseudocode)
• Урок 31. 00:03:25
Lowest Common Ancestor (Difficulty = ***)
• Урок 32. 00:07:03
Lowest Common Ancestor (Solution)
• Урок 33. 00:07:42
Lowest Common Ancestor (Solution in Pseudocode)
• Урок 34. 00:00:27
Conclusion