I noticed that in recent years, a lot of "pass any coding interview"-ads started appearing out of nowhere (or maybe I live under a rock). On the other hand, I worked in many places and talk to many people and no one ever mentioned participating in such courses/bootcamps before. Therefore, I would like to ask if you know any successful stories, where a person went to some programming bootcamp without any prior experience and then started working in some well-known IT company?
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 13.11.2024 05:00:20 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
I can share how only doing competitive programming made me not perform well on a job interview. Competitive programming very rarely makes you think about:
But there is a huge Math.random() factor in job interviews in my opinion, so no doubt there are cases of inexperienced guys doing a bootcamp and getting a job.
True, interviewers are often like obsessed with hash maps as if it's the one most important thing from computer science. Some google booklet for interviewees even almost explicitly says so :)
Well, a lot of large-scale software development is about fast lookup in some sort of databases, so it kind of makes sense. Either exact lookup, through hashing, or close enough lookup, through nearest neighbour structures or rounding and then hashing. Situations where you can't do generic lookup are when the fun begins.
Hash maps + heaps + avl and Rb tree + a lot of luck factor..
I might agree only with threading. Lately, I had an interview when I was asked to do something in parallel and I was really surprised, but I managed to remind myself how to do it with the documentation.
For the other points: hash maps are used really often in problems. In POI we have a special tag for problems which focus on the limited memory (there are about 7 tasks with this tag if I remember correctly). Maybe linked lists are not very popular, but I saw some problems using them as well.
Nice. Do you speak Russian though? Do you even know what's the "двач" is? :)
Yeah, I speak Russian enough to get it (although I had to look up some specific jokes like who Ванька Ерохин is). I even posted and translated it in some comment a long time ago. двач = 2ch.hk.
Bump.
Nobody replies positively. Does it mean that courses and bootcamps are shit? I might make one in the future so it's quite important for me :D
Or that people taking them and making use of them are not active users of CF (which makes sense)