yandex logo
Yandex· Senior+

Yandex Frontend Interview. Senior+ 5YOE (No hire)

Experience
5 years
Posted
3 Jul 2025
316 reads

Summary

I interviewed for a Senior+ Frontend role at Yandex with 5 years of experience. I was not hired primarily due to a lack of knowledge in CI/CD, deployment processes, and backend concepts, despite performing well on various technical and algorithmic challenges.

How it went

Platform, Algorightms:

  1. Implement Array.groupby
  2. Given 2 arrays of intervals find their intersections
  3. Implement Promise.all, Promise.any
  4. Implement lodash.debounce (something similar)
  5. Implement lodash.get
  6. Does string s exist in subsequence of k
  7. Simple hashmap. Messages apear in non consecutive order (let's assume via websockets). We need to log them consecutevly when they appear. Eg messages appear like so 1,3,2,4. First we log 1. Then remember 3. Then log 2 and 3 when we get 2. Then log 4.

Finals:

  1. Why we use SSR?
  2. CI\CD. Have you ever worked with?
  3. Testing. Why we use it? What types of testing did you use?
  4. Cases with optimizing your codebase?
  5. Hardest project\task you ever worked with. How did you deal with that?

Vertict: No hire.

Reason: Don't know CI\CD, Deploy, and backend

Questions asked (12)

  1. 01

    Implement Array.groupby

    Data Structures & Algorithms

    Implement the Array.groupby method.

  2. 02

    Find Intersections of Two Interval Arrays

    Data Structures & Algorithms · Medium

    Given 2 arrays of intervals, find their intersections.

  3. 03

    Implement Promise.all and Promise.any

    Data Structures & Algorithms · Medium

    Implement JavaScript's Promise.all and Promise.any methods.

  4. 04

    Implement lodash.debounce

    Data Structures & Algorithms · Medium

    Implement a debounce function similar to lodash.debounce.

  5. 05

    Implement lodash.get

    Data Structures & Algorithms · Easy

    Implement a function similar to lodash.get for safely accessing nested object properties.

  6. 06

    Check if String S is a Subsequence of K

    Data Structures & Algorithms · Easy

    Given two strings, s and k, determine if s exists as a subsequence of k.

  7. 07

    Log Consecutive Messages from Out-of-Order Stream

    Data Structures & Algorithms · Medium

    Implement a system to log messages consecutively, even if they appear in a non-consecutive order (e.g., via websockets). For example, if messages appear as 1,3,2,4: First, log 1. Then, remember 3. When 2 arrives, log 2 and then 3. Finally, log 4.

  8. 08

    Why use Server-Side Rendering (SSR)?

    System Design

    Explain the reasons and benefits of using Server-Side Rendering (SSR).

  9. 09

    Experience with CI/CD

    System Design

    Discuss your experience with Continuous Integration and Continuous Deployment (CI/CD).

  10. 10

    Importance and Types of Testing

    System Design

    Explain why testing is important and describe the types of testing you have experience with.

  11. 11

    Codebase Optimization Strategies

    System Design

    Describe scenarios where you optimized a codebase and the approaches you took.

  12. 12

    Hardest Project/Task and Resolution

    Behavioral

    Describe the hardest project or task you've worked on and how you approached and resolved it.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Yandex recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!