文件: root - text - article - 2019 - 05 - day-3-week-coding-interview-email-course.txt
标签: 面试技术, 算法, 模式, Interview Course, Computing, Algorithm, Pattern, | 英文 | 主页 | 类别: 计算机科学 | 462 次阅读, 20001 次搜索 | 472 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 面试技术, 算法, 模式, Interview Course, Computing, Algorithm, Pattern, | 英文 | 主页 | 类别: 计算机科学 | 462 次阅读, 20001 次搜索 | 472 个单词
![定阅此目录的博客 定阅此目录的博客](/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.
标签: 面试技术, 算法, 模式, Interview Course, Computing, Algorithm, Pattern, | 英文 | 主页 | 类别: 计算机科学 | 462 次阅读, 20001 次搜索 | 472 个单词 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.
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Daily Interview Problem: Buddy Strings
- Daily Interview Problem: Find the Number of Islands
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Two Tricks of Delphi
- Design Tic-Tac-Toe
- Longest Substring Without Repeating Characters
- ImageMagick Vulnerabilities - CVE-2016–3714
- Delphi Dynamic Array
- Algorithm Interview Question: Nth Fibonacci Number
©2006~2024 牛排过熟 - 0.00776 秒 - 2904.154 KB/s - 10 在线
内存: 496.26 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。