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 interviews
Search
Nina Torgunakova
April 01, 2023
Programming
0
1.4k
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
0
190
Smart nano stores for state management, or how we made front-end simpler
ninoid
0
290
Unveiling Nano Stores
ninoid
0
440
Умные nano stores, или как мы сделали веб-разработку проще
ninoid
0
770
Other Decks in Programming
See All in Programming
Open standards for building event-driven applications in the cloud
meteatamel
0
230
Productivity is Messing Around and Having Fun
hollycummins
1
180
最近コードレビューで指摘したこと
forrep
3
110
Let's learn code review
riofujimon
2
640
TypeScriptから始める VR生活
tamagokakeg
2
110
教えて!スクラムコーチ品質とスピードのバランスはどうすりゃいいの?
pinboro
0
110
How to improve maintainability and readability of your automated tests? ( #scrumniigata )
teyamagu
PRO
1
130
Fragment Composition of GraphQL
quramy
14
1.7k
slow types ってなんだろう?
karad
0
210
TypeScriptコードの漸進的改善 / Progressive Improvement of TypeScript Code
medley
1
430
Documentation testsの恩恵 / Documentation testing benefits
ssssota
1
560
TypeScriptとGraphQLで実現する 型安全なAPI実装 / TSKaigi 2024
hokaccha
5
2.7k
Featured
See All Featured
Creating an realtime collaboration tool: Agile Flush - .NET Oxford
marcduiker
14
1.5k
Building Applications with DynamoDB
mza
88
5.7k
Learning to Love Humans: Emotional Interface Design
aarron
267
39k
Automating Front-end Workflow
addyosmani
1357
200k
Understanding Cognitive Biases in Performance Measurement
bluesmoon
12
1.1k
How to Ace a Technical Interview
jacobian
273
22k
The Pragmatic Product Professional
lauravandoore
26
5.9k
GraphQLの誤解/rethinking-graphql
sonatard
56
9.3k
How to name files
jennybc
65
94k
Statistics for Hackers
jakevdp
790
220k
Imperfection Machines: The Place of Print at Facebook
scottboms
261
12k
No one is an island. Learnings from fostering a developers community.
thoeni
16
2.1k
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_