Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
Solving algorithms: beyond cramming for job int...
Search
Nina Torgunakova
April 01, 2023
Programming
0
2k
Solving algorithms: beyond cramming for job interviews
Nina Torgunakova
April 01, 2023
Tweet
Share
More Decks by Nina Torgunakova
See All by Nina Torgunakova
Smart Nano Stores, or how we made front-end simpler (for the FOF meetup in Lisbon)
ninoid
1
580
Smart nano stores for state management, or how we made front-end simpler
ninoid
0
870
Unveiling Nano Stores
ninoid
0
820
Умные nano stores, или как мы сделали веб-разработку проще
ninoid
0
950
Other Decks in Programming
See All in Programming
CSC305 Lecture 05
javiergs
PRO
0
230
Web フロントエンドエンジニアに開かれる AI Agent プロダクト開発 - Vercel AI SDK を観察して AI Agent と仲良くなろう! #FEC余熱NIGHT
izumin5210
3
580
バッチ処理を「状態の記録」から「事実の記録」へ
panda728
PRO
0
170
Server Side Kotlin Meetup vol.16: 内部動作を理解して ハイパフォーマンスなサーバサイド Kotlin アプリケーションを書こう
ternbusty
3
220
3年ぶりにコードを書いた元CTOが Claude Codeと30分でMVPを作った話
maikokojima
0
590
Webサーバーサイド言語としてのRustについて
kouyuume
0
500
Goで実践するドメイン駆動開発 AIと歩み始めた新規プロダクト開発の現在地
imkaoru
4
870
テーブル定義書の構造化抽出して、生成AIでDWH分析を試してみた / devio2025tokyo
kasacchiful
0
210
NixOS + Kubernetesで構築する自宅サーバーのすべて
ichi_h3
0
1.1k
スマホから Youtube Shortsを見られないようにする
lemolatoon
27
33k
組込みだけじゃない!TinyGo で始める無料クラウド開発入門
otakakot
1
330
kiroとCodexで最高のSpec駆動開発を!!数時間で web3ネイティブなミニゲームを作ってみたよ!
mashharuki
0
740
Featured
See All Featured
Rebuilding a faster, lazier Slack
samanthasiow
84
9.2k
The Straight Up "How To Draw Better" Workshop
denniskardys
238
140k
We Have a Design System, Now What?
morganepeng
53
7.8k
Art, The Web, and Tiny UX
lynnandtonic
303
21k
Building Better People: How to give real-time feedback that sticks.
wjessup
369
20k
Performance Is Good for Brains [We Love Speed 2024]
tammyeverts
12
1.2k
Bash Introduction
62gerente
615
210k
CSS Pre-Processors: Stylus, Less & Sass
bermonpainter
359
30k
Creating an realtime collaboration tool: Agile Flush - .NET Oxford
marcduiker
34
2.3k
Rails Girls Zürich Keynote
gr2m
95
14k
Mobile First: as difficult as doing things right
swwweet
225
10k
Designing Experiences People Love
moore
142
24k
Transcript
Solving algorithms: beyond cramming for job interviews 1 @ninoid_
Have you ever used this site? 2 @ninoid_
Or this one? 3 @ninoid_
Or maybe this one? 4 @ninoid_
5
How employers see the solving CS problems: 6 @ninoid_
7 @ninoid_
8 @ninoid_
9 @ninoid_ Nina Torgunakova Frontend Engineer
Job interviews 10 @ninoid_ Other benefits
Some myths and facts about algorithmic problems 11 @ninoid_
Problems are boring. 12 Myth №1: @ninoid_
13 @ninoid_ Myth № 1: Problems are boring
Problems could be fun and tricky! 14 Fact №1: @ninoid_
15 @ninoid_ Fact №1: Problems could be fun and tricky
Can you presume the probability that the last person will
get his own sit? There are 100 seats and 100 passengers. 16 @ninoid_ Fact №1: Problems could be fun and tricky
0,5 Either you meet or either you don't meet 17
@ninoid_ Fact №1: Problems could be fun and tricky
18 @ninoid_ Fact №1: Problems could be fun and tricky
19 What is the minimum amount of cuts needed to
divide a circle into 3 equal slices? Answer: 3 @ninoid_ Fact №1: Problems could be fun and tricky
20 But what if we need to divide a circle
into 99 equal slices? You can solve it programmatically in 2 lines! @ninoid_ Fact №1: Problems could be fun and tricky
21 @ninoid_ Fact №1: Problems could be fun and tricky
? Can you presume the minimum total cost to move
three chips into one column? 22 @ninoid_ Fact №1: Problems could be fun and tricky
? 23 @ninoid_ Answer: 1 Fact №1: Problems could be
fun and tricky
All problems are complex. 24 Myth №2: @ninoid_
25 @ninoid_ Myth №2: All problems are complex
There are many tasks for all levels of preparation. 26
Fact №2: @ninoid_
27 @ninoid_ Fact №2: Many tasks for each level of
preparation
28 @ninoid_ Fact №2: Many tasks for each level of
preparation
29 @ninoid_ Fact №2: Many tasks for each level of
preparation
30 @ninoid_ Fact №2: Many tasks for each level of
preparation
Problems are time-consuming. 31 Myth №3: @ninoid_
When you decide to stay in the office for ten
minutes to sort out a bug 32 @ninoid_ Myth №3: Problems are time-consuming
You can limit your solving time to prevent wastes. 33
Fact №3: @ninoid_
How I see myself solving a problem for two hours
without Google 34 @ninoid_ Fact №3: You can limit your time
It is all about the marathon. Not the sprint. 35
@ninoid_ Fact №3: You can limit your time
Problems are not connected with real work and needed only
for job interviews. 36 Myth №4: @ninoid_
37 @ninoid_ Myth №4: Problems are not connected with real
work
Solving problems can help you not only with tech interviews.
38 Fact №4: @ninoid_
39 @ninoid_ Fact №4: It is useful not only for
job interviews
What will happen in one year? Imagine that from today
you start to solve algorithmic problems wisely. 40 @ninoid_ Fact №4: It is useful not only for job interviews
// TODO: DELETE THIS SLIDE 41 @ninoid_
You will write code faster. 42 Result №1: @ninoid_
43 @ninoid_ What I can write now in 5 minutes:
Result №1: You will write code faster
44 @ninoid_ What I wrote in 5 minutes a year
ago: Result №1: You will write code faster
Fewer bugs in your code. 45 Result №2: @ninoid_
46 @ninoid_ Result №2: Fewer bugs in your code.
You will explain your decisions better. 47 Result №3: @ninoid_
48 @ninoid_ Use the discussion sections to practice explaining Result
№3: You will explain your decisions better.
You will not be afraid of complex work tasks. 49
Result №4: @ninoid_
50 Auto-building network maps for data centers @ninoid_ Result №4:
You will not be afraid of complex tasks.
You will expand your horizons. Not only in the programming
field! 51 Result №5: @ninoid_
52 @ninoid_ Result №5: You will expand your horizons.
What about lifehacks? 53 @ninoid_
Keep track of your energy level during the day. 54
Tip №1: @ninoid_
Always consider constraints and try to test every action. 55
Tip №2: @ninoid_
56 Tip №2: Always consider constraints 1 2 3 4
5 Task: Traverse the tree with N amount of nodes What if the amount of nodes equals 0? Could it be? @ninoid_
Try to explain your solutions and learn from others. 57
Tip №3: @ninoid_
58 @ninoid_ Tip №3: Try to learn from others
"Don't compare your chapter 1 with someone else's chapter 20."
59 @ninoid_ Tip №3: Try to learn from others
Track your progress. 60 Tip №4: @ninoid_
61 Tip №4: Track your progress @ninoid_
62 @ninoid_ Tip №4: Track your progress
63 @ninoid_ Tip №4: Track your progress
1. Leetcode.com. 2. See you tomorrow! 64 @ninoid_ Consistency is
a key!
@ninoid_ ninaTorgunakova 65 @ninoid_