File: root - text - article - 2019 - 05 - day-3-week-coding-interview-email-course.txt
Tags: 面试技术, 算法, 模式, Interview Course, Computing, Algorithm, Pattern, | English | Home Page | Category: Computing | 458 Views, 19947 Search Bots | 472 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 面试技术, 算法, 模式, Interview Course, Computing, Algorithm, Pattern, | English | Home Page | Category: Computing | 458 Views, 19947 Search Bots | 472 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
This is Day 3/7 of our 1-week coding interview email course.
If our problems have felt over your head . . . you'll find this one especially helpful.
But first, really quick: have you looked into our full coding interview prep course yet? (The one that only costs money if it gets you hired.)
It might be the option you’ve been looking for if you’re seeking even more in-depth guidance on interview questions. Now, onto the next tip . . .
The hard part of coding interviews is getting stuck—hitting that moment where you don't know what to do next to come up with a solution (or come up with a more efficient solution).
The key to getting unstuck—the insight you're missing—is one of those algorithmic patterns we talked about. Might be a particular data structure. Might be a way of breaking the problem down.
So to get stuck less often, you should read up on lots of data structures and algorithms, right?
Wrong. Here's the problem:
Just because you're familiar with the data structure or algorithm, doesn't mean you'll know how to apply it when a problem calls for it!
Instead, you should be focusing on building a connection between the situation that calls for an algorithmic pattern, and the algorithmic pattern itself. The only way to do this is to run real practice problems.
That's why on Interview Cake, we teach with problems. Sure, we have a reading about linked lists ... but we really teach the linked list by throwing you into half a dozen questions about them.
Teaching with problems is the only way to really build those connections.
But teaching with problems has a side effect: It can feel overwhelming.
Sometimes, folks try a problem or two on Interview Cake, don't get it right away, and conclude that they're not "ready" for our questions. They email me and ask for some pre-readings to get up to speed with data structures and algorithms first.
The problem isn't that they're not ready. It's that they're shy about pressing the "Tell me more" button more than once or twice!
But that button was made to be pressed. Heck, press it a couple dozen times if you have to. Many of our problems have that many hints. And they're there to be used! Use them all. Don't be shy.
When you show all the hints on a question one-by-one, the experience gracefully degrades into a reading.
You could even say that when you read through a question this way, the question is the pre-reading!
But it's more active than a normal reading. You have to consider each step on your own before revealing the next one. Much better for learning.
And if you mark the problem for review later, you can try taking a more full swing at it again in a few days.
Tags: 面试技术, 算法, 模式, Interview Course, Computing, Algorithm, Pattern, | English | Home Page | Cateogry: Computing | 458 Views, 19947 Search Bots | 472 Words If our problems have felt over your head . . . you'll find this one especially helpful.
But first, really quick: have you looked into our full coding interview prep course yet? (The one that only costs money if it gets you hired.)
It might be the option you’ve been looking for if you’re seeking even more in-depth guidance on interview questions. Now, onto the next tip . . .
The hard part of coding interviews is getting stuck—hitting that moment where you don't know what to do next to come up with a solution (or come up with a more efficient solution).
The key to getting unstuck—the insight you're missing—is one of those algorithmic patterns we talked about. Might be a particular data structure. Might be a way of breaking the problem down.
So to get stuck less often, you should read up on lots of data structures and algorithms, right?
Wrong. Here's the problem:
Just because you're familiar with the data structure or algorithm, doesn't mean you'll know how to apply it when a problem calls for it!
Instead, you should be focusing on building a connection between the situation that calls for an algorithmic pattern, and the algorithmic pattern itself. The only way to do this is to run real practice problems.
That's why on Interview Cake, we teach with problems. Sure, we have a reading about linked lists ... but we really teach the linked list by throwing you into half a dozen questions about them.
Teaching with problems is the only way to really build those connections.
But teaching with problems has a side effect: It can feel overwhelming.
Sometimes, folks try a problem or two on Interview Cake, don't get it right away, and conclude that they're not "ready" for our questions. They email me and ask for some pre-readings to get up to speed with data structures and algorithms first.
The problem isn't that they're not ready. It's that they're shy about pressing the "Tell me more" button more than once or twice!
But that button was made to be pressed. Heck, press it a couple dozen times if you have to. Many of our problems have that many hints. And they're there to be used! Use them all. Don't be shy.
When you show all the hints on a question one-by-one, the experience gracefully degrades into a reading.
You could even say that when you read through a question this way, the question is the pre-reading!
But it's more active than a normal reading. You have to consider each step on your own before revealing the next one. Much better for learning.
And if you mark the problem for review later, you can try taking a more full swing at it again in a few days.
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Skip the readings, focus on problems. And use all the hints!
- Find Missing Numbers in an Array
- Compare Version Numbers
- Find the non-duplicate number
- Reverse a Directed Graph
- Spreadsheet Column Title
- YES!!
- Sort a Partially Sorted List
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- Daily Interview Problem: Group Words that are Anagrams
©2006~2024 SteakOverCooked - 0.00721 Seconds(s) - 2773.475 KB/s - 12 Online
Memory: 495.38 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !