There are several scenarios where you’ll be asked to complete a technical problem.<\/p>\n\n\n\n
- \n
- Over the phone, where you’re expected to write code on a shared document<\/li>\n\n\n\n
- Online assessment <\/li>\n\n\n\n
- Technical Interview (whiteboard)<\/li>\n<\/ul>\n\n\n\n
The general approach<\/em><\/strong><\/p>\n\n\n\n
The approach I take when tackling a technical question is UMPIRE<\/strong>.<\/p>\n\n\n\n
U: Understand the problem<\/p>\n\n\n\n
- \n
- Validate your assumptions by thinking of different inputs and outputs.<\/li>\n\n\n\n
- Ask the interviewer questions about the problem<\/li>\n<\/ul>\n\n\n\n
M: Match the problem with the interviewer<\/p>\n\n\n\n
- \n
- Try to think about known categories of problems (Linked List, Dynamic Programming) or patterns that match the problem. <\/li>\n<\/ul>\n\n\n\n
P: Plan your approach and solution<\/p>\n\n\n\n
- \n
- Use visualizations and pseudocode to plan your approach.<\/li>\n<\/ul>\n\n\n\n
I: Implement your solution<\/p>\n\n\n\n
R: Review your solution<\/p>\n\n\n\n
- \n
- Go through your code as if you’re debugging it and there’s a bug. Step through the code line by line.<\/li>\n\n\n\n
- Evaluate some of the common edge cases.<\/li>\n<\/ul>\n\n\n\n
E: Evaluate your solution<\/p>\n\n\n\n
- \n
- Discuss the pros and cons of your algorithm, what you like about your algorithm, and what you could do differently.<\/li>\n\n\n\n
- This is where you also discuss the Big-O time complexity of your algorithm.<\/li>\n<\/ul>\n\n\n\n
One more comment: when solving a technical problem, a good strategy is to come up with the native solution first and then optimize your code later on. <\/p>\n\n\n\n
Remember, the interviewer wants to see your approach and thought process, so don’t forget to talk out loud, use visualizations, and break down the problem into smaller steps. It’s ok if you don’t finish the problem completely in the end. <\/p>\n\n\n\n
Study tips and resources!<\/em><\/strong><\/p>\n\n\n\n
It really comes down to practicing like how you would in an interview. <\/p>\n\n\n\n
- \n
- Try to use the approach above when solving a problem.<\/li>\n\n\n\n
- Time yourself. <\/li>\n\n\n\n
- Find a study partner, so you can practice problems with each other and do mock interviews. <\/li>\n\n\n\n
- Study by topic<\/li>\n<\/ul>\n\n\n\n
Here are some of my favorite resources:<\/em><\/strong><\/p>\n\n\n\n
Online study platforms:<\/em><\/strong><\/p>\n\n\n\n
- \n
- Leetcode<\/li>\n\n\n\n
- Codesignal<\/li>\n\n\n\n
- Codility<\/li>\n<\/ul>\n\n\n\n
What’s cool about CodeSignal is that they have an “Interview Practice” section that has problems for each topic.<\/p>\n\n\n\n
![\"\"](\"https:\/\/osu-wams-blogs-uploads.s3.amazonaws.com\/blogs.dir\/6519\/files\/2023\/01\/Screenshot-2023-01-12-at-5.25.50-PM.png\")
<\/figure>\n\n\n\nWhat’s cool about Codility is that for each lesson there’s reading material to go along with it. Codility will also evaluate the time complexity and performance of your program giving you a score after submitting.<\/p>\n\n\n\n
![\"\"](\"https:\/\/osu-wams-blogs-uploads.s3.amazonaws.com\/blogs.dir\/6519\/files\/2023\/01\/Screenshot-2023-01-12-at-5.27.52-PM.png\")
<\/figure>\n\n\n\nBooks<\/em><\/strong><\/p>\n\n\n\n
- \n
- Grokking algorithms book (pdf)<\/a><\/li>\n\n\n\n
- Competitive Programmer’s Handbook (pdf)<\/a> (this one is a bit excessive, but has some really interesting topics!)<\/li>\n<\/ul>\n\n\n\n
Youtube<\/em><\/strong><\/p>\n\n\n\n
- \n
- Abdul Bari<\/a> (the goat…)<\/li>\n\n\n\n
- Cod<\/a>ing made simple<\/a><\/li>\n\n\n\n
- Neetcode<\/a><\/li>\n<\/ul>\n\n\n\n
To conclude<\/em><\/strong><\/p>\n\n\n\n
Mastering algorithms and data structures can be overwhelming and tough. It comes down to consistency and practice. Do a couple of problems every day while implementing the approach and strategies I outlined above and you’ll definitely see improvement over time. Good luck & thanks for reading!<\/p>\n","protected":false},"excerpt":{"rendered":"
I am currently going through the job hunting process. This includes applying to new grad positions, emailing recruiters, attending career fairs, and *of course* doing LeetCode problems. If you haven’t applied to jobs yet, you’ll soon find out that you’ll receive an online assessment (OA) as the first step in the interview process. I’ve received […]<\/p>\n","protected":false},"author":13207,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-9","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/posts\/9","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/users\/13207"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/comments?post=9"}],"version-history":[{"count":10,"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/posts\/9\/revisions"}],"predecessor-version":[{"id":22,"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/posts\/9\/revisions\/22"}],"wp:attachment":[{"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/media?parent=9"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/categories?post=9"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/easterdr\/wp-json\/wp\/v2\/tags?post=9"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
- Cod<\/a>ing made simple<\/a><\/li>\n\n\n\n
- Competitive Programmer’s Handbook (pdf)<\/a> (this one is a bit excessive, but has some really interesting topics!)<\/li>\n<\/ul>\n\n\n\n
- Grokking algorithms book (pdf)<\/a><\/li>\n\n\n\n
- Use visualizations and pseudocode to plan your approach.<\/li>\n<\/ul>\n\n\n\n
- Try to think about known categories of problems (Linked List, Dynamic Programming) or patterns that match the problem. <\/li>\n<\/ul>\n\n\n\n