Algorithms · interviews

Tatiana Korovkina

I help developers prepare for coding interviews. Author of the algorithms and data structures course at Shortcut school and of the Telegram channel «Коровкина про алгоритмы» (“Korovkina on algorithms”).

About the course Read the channel

node 1 about

I explain algorithms so you can actually solve them in an interview

I write and teach algorithms courses at Shortcut school: a core course for junior and middle developers, and an advanced one. I used to work at Yandex.

In my Telegram channel «Коровкина про алгоритмы» I walk through problems from real interviews at Russian tech companies, common candidate mistakes, and statistics on which topics come up most often.

  • 01
    Why, not just howI explain why a solution works. Then you can rebuild it in an interview instead of trying to remember it by heart.
  • 02
    Problems from real interviewsPractice is built on problems that candidates actually get at big tech companies.
  • 03
    Mistakes in advanceI go through typical mistakes before you make them in front of an interviewer.

node 2 course

Algorithms and Data Structures. Core course

Everything you need to pass algorithmic interviews for junior and middle positions with confidence. No advanced topics that are rarely asked at this level.

  • Junior and Middle
  • 9 lectures
  • practice after every topic
  • taught in Russian
  1. Arrays, strings, linked listsHow they work inside and when to pick which
  2. HashMap and HashSetFrequency counting, finding duplicates, grouping by key
  3. Two pointers and Sliding WindowPatterns for sorted data and subarrays
  4. Stack and queueLIFO, FIFO and the problems they solve
  5. Binary searchThe classic algorithm and its variations
  6. Intervals and greedy algorithmsMerging intervals, scheduling, greedy choice
  7. Prefix and suffix computationsPrefix sums and fast range queries
  8. Recursion, Divide and Conquer, BacktrackingCore patterns of recursive solutions
  9. Trees: traversals and BSTPreorder, inorder, postorder, BFS and DFS, binary search trees

The course runs within Shortcut’s mentoring programme: one-to-one sessions with a mentor, homework with code review, and support between sessions.

If you are already confident with the basics, there is an advanced course.

node 3 channel

The «Коровкина про алгоритмы» channel

One week, one topic: first the theory, then a problem from a real interview, its walkthrough three hours later, and common mistakes and a recap by the end of the week. The channel is in Russian.

Open in Telegram
  • Problem walkthroughsStep by step, with code and complexity
  • Common mistakesWhat trips candidates up and how to avoid it
  • StatisticsWhich topics and problems come up most often
  • TheoryData structures and patterns in plain language

node 4 more

Talks and articles

Talks Live streams on YouTube: problem walkthroughs and mock coding interviews. In Russian. Watch → Articles Algorithm complexity, optimisation and sorting, with code in Python, Java and Go. In Russian. Read →