Nina Torgunakova
April 01, 2023
1.3k

Solving algorithms: beyond cramming for job interviews

April 01, 2023

Transcript

1. Solving algorithms:
beyond cramming for
job interviews
1
@ninoid_

2. Have you ever used this site?
2
@ninoid_

3. Or this one?
3
@ninoid_

4. Or maybe this one?
4
@ninoid_

5. 5

6. How employers see the solving CS problems:
6
@ninoid_

7. 7
@ninoid_

8. 8
@ninoid_

9. 9
@ninoid_
Nina Torgunakova
Frontend Engineer

10. Job interviews
10
@ninoid_
Other benefits

11. Some myths and facts about
algorithmic problems
11
@ninoid_

12. Problems are boring.
12
Myth №1:
@ninoid_

13. 13
@ninoid_
Myth № 1: Problems are boring

14. Problems could be fun
and tricky!
14
Fact №1:
@ninoid_

15. 15
@ninoid_
Fact №1: Problems could be fun and tricky

16. 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

17. 0,5
Either you meet
or either you
don't meet
17
@ninoid_
Fact №1: Problems could be fun and tricky

18. 18
@ninoid_
Fact №1: Problems could be fun and tricky

19. 19
What is the minimum amount of cuts
needed to divide a circle into 3 equal
slices?
@ninoid_
Fact №1: Problems could be fun and tricky

20. 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. 21
@ninoid_
Fact №1: Problems could be fun and tricky

22. ?
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. ?
23
@ninoid_
Fact №1: Problems could be fun and tricky

24. All problems are complex.
24
Myth №2:
@ninoid_

25. 25
@ninoid_
Myth №2: All problems are complex

26. There are many tasks for all
levels of preparation.
26
Fact №2:
@ninoid_

27. 27
@ninoid_
Fact №2: Many tasks for each level of preparation

28. 28
@ninoid_
Fact №2: Many tasks for each level of preparation

29. 29
@ninoid_
Fact №2: Many tasks for each level of preparation

30. 30
@ninoid_
Fact №2: Many tasks for each level of preparation

31. Problems are time-consuming.
31
Myth №3:
@ninoid_

32. When you decide to stay in the office
for ten minutes to sort out a bug
32
@ninoid_
Myth №3: Problems are time-consuming

33. You can limit your solving time
to prevent wastes.
33
Fact №3:
@ninoid_

34. How I see myself solving a problem
34
@ninoid_
Fact №3: You can limit your time

35. It is all about the marathon.
Not the sprint.
35
@ninoid_
Fact №3: You can limit your time

36. Problems are not connected with
real work and needed only for job
interviews.
36
Myth №4:
@ninoid_

37. 37
@ninoid_
Myth №4: Problems are not connected with real work

not only with tech interviews.
38
Fact №4:
@ninoid_

39. 39
@ninoid_
Fact №4: It is useful not only for job interviews

40. 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

41. // TODO: DELETE THIS SLIDE
41
@ninoid_

42. You will write code faster.
42
Result №1:
@ninoid_

43. 43
@ninoid_
What I can write now in 5 minutes:
Result №1: You will write code faster

44. 44
@ninoid_
What I wrote in 5 minutes a year ago:
Result №1: You will write code faster

45. Fewer bugs in your code.
45
Result №2:
@ninoid_

46. 46
@ninoid_
Result №2: Fewer bugs in your code.

47. You will explain your decisions
better.
47
Result №3:
@ninoid_

48. 48
@ninoid_
Use the discussion sections to practice explaining
Result №3: You will explain your decisions better.

49. You will not be afraid of complex
49
Result №4:
@ninoid_

50. 50
Auto-building network maps for data centers
@ninoid_
Result №4: You will not be afraid of complex tasks.

51. You will expand your horizons.
Not only in the programming
field!
51
Result №5:
@ninoid_

52. 52
@ninoid_
Result №5: You will expand your horizons.

53
@ninoid_

54. Keep track of your energy level
during the day.
54
Tip №1:
@ninoid_

55. Always consider constraints and
try to test every action.
55
Tip №2:
@ninoid_

56. 56
Tip №2: Always consider constraints
1
2 3
4 5
with N amount of nodes
What if the amount of nodes
equals 0?
Could it be?
@ninoid_

57. Try to explain your solutions
and learn from others.
57
Tip №3:
@ninoid_

58. 58
@ninoid_
Tip №3: Try to learn from others

1 with someone else's
chapter 20."
59
@ninoid_
Tip №3: Try to learn from others

60
Tip №4:
@ninoid_

61. 61
@ninoid_

62. 62
@ninoid_

63. 63
@ninoid_