Upload Button Icon Add office photos

Filter interviews by

Yandex Software Developer Interview Questions and Answers

Updated 27 Feb 2024

Yandex Software Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - Technical 

(3 Questions)

  • Q1. What is 2 powered by 8?
  • Ans. 

    2 powered by 8 is equal to 256.

    • 2^8 = 2*2*2*2*2*2*2*2 = 256

  • Answered by AI
  • Q2. What is a race condition?
  • Ans. 

    A race condition is a situation in which the outcome of a program depends on the sequence or timing of uncontrollable events.

    • Occurs when multiple threads or processes access shared data or resources concurrently

    • Can lead to unpredictable behavior or bugs in the program

    • Example: Two threads trying to increment the same variable simultaneously

  • Answered by AI
  • Q3. What is an arrow function?
  • Ans. 

    Arrow functions are a concise way to write functions in JavaScript.

    • Arrow functions are written using the '=>' syntax.

    • They do not have their own 'this' keyword, instead they inherit it from the parent scope.

    • They are often used for short, one-line functions.

    • Example: const add = (a, b) => a + b;

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.

    Example of Sub...

  • Ans. 

    Find the maximum sum of a contiguous subarray in an array of integers.

    • Use Kadane's algorithm to find the maximum subarray sum in linear time.

    • Initialize two variables: maxSum and currentSum.

    • Iterate through the array and update currentSum by adding the current element or starting a new subarray.

    • Update maxSum if currentSum becomes greater than maxSum.

    • Return maxSum as the maximum subarray sum.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 50 Minutes
Round difficulty - Easy

This was face to face interview round.

  • Q1. 

    Finding Triplets in a Binary Tree Problem Statement

    You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...

  • Ans. 

    Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.

    • Traverse the binary tree to find all possible triplets.

    • Check if the sum of each triplet is greater than X.

    • Ensure the relationship of grandparent-parent-child in each triplet.

    • Return the valid triplets in any order.

    • Handle constraints and edge cases appropriately.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

FACE TO FACE ROUND INTERVIEW

  • Q1. Can you tell me about yourself?
  • Q2. What is the difference between Mutex and Semaphores? Please provide a real-life example.
  • Ans. 

    Mutex is used for exclusive access to a resource by only one thread at a time, while Semaphores can allow multiple threads to access a resource simultaneously.

    • Mutex is binary and allows only one thread to access a resource at a time, while Semaphores can have a count greater than one.

    • Mutex is used for protecting critical sections of code, while Semaphores can be used for controlling access to a pool of resources.

    • Exampl...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaabove 7 cgpaAmazon interview preparation:Topics to prepare for the interview - Computer Fundamentals, Data Structures and AlgorithmsTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Participate in previous interview questions from leetcode, geeksforgeeks
Tip 2 : Revise computer science subjects like dbms and oops thoroughly
Tip 3 : Participate in live contests on CodeChef, Codeforces

Application resume tips for other job seekers

Tip 1 : Only write the things on which you are the most confident about

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions
Based on ds and algorithms

  • Q1. 

    Minimum Number of Platforms Problem

    Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.

    Explanation:

    Given two arrays:

    • AT - represent...
  • Ans. 

    Determine the minimum number of platforms needed at a railway station so that no train has to wait.

    • Sort the arrival and departure times arrays in ascending order.

    • Initialize two pointers, one for arrival times and one for departure times.

    • Increment the platform count when a train arrives and decrement when it departs.

    • Keep track of the maximum platform count needed.

    • Return the maximum platform count as the minimum number o

  • Answered by AI
  • Q2. 

    Minimum Number of Swaps to Achieve K-Periodic String

    Given a string S of length N, an array A of length M consisting of lowercase letters, and a positive integer K, determine the minimum number of swaps r...

  • Ans. 

    The minimum number of swaps required to make a string K-periodic by replacing characters with elements from an array.

    • Iterate through the string and check if each character matches the character K positions ahead.

    • Count the number of characters that need to be swapped to make the string K-periodic.

    • Use the array elements to swap characters in the string.

    • Return the total number of swaps needed for each test case.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

It was good round they asked me about all the ds and algo basics 
With 2 problems by sharing the screeen

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider all eight possible directions for connectivity while traversing the matrix.

    • Handle edge ca...

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Medium

In this round, three questions were asked and all of them were based on DSA and a little bit about projects.

  • Q1. 

    Minimum Jumps Problem Statement

    Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...

  • Ans. 

    Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.

    • Use BFS to traverse through the shops and keep track of the minimum jumps required.

    • If at any point the current shop is unreachable (Arr[i] = 0), return -1.

    • Optimize by using a visited array to avoid revisiting the same shop.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 65 percentAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Computer Networks, JavaTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems

Application resume tips for other job seekers

Tip 1 : Build your resume such that it grabs the eye of the interviewer
Tip 2 : metion your key skills and also maintain atleast 2 projects

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Dec 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 25 Minutes
Round difficulty - Medium

Very friendly interviewer. Although waiting time was very high

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the result list based on the criteria mentioned in the question.

    • Return the sorted list of pairs.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNoAmazon interview preparation:Topics to prepare for the interview - CV points, Leadership principles, ecommerce basics, problem solving, case studiesTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : be confident about your CV points
Tip 2 : practice consulting cases and how to answer situational questions

Application resume tips for other job seekers

Tip 1 : be crisp about achievement
Tip 2 : add data points to support your achievements

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

10 min for debugging
40 min for problems(coding)
40 min for pyschometric
30 min for aptitude

  • Q1. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. 

    The task is to calculate the total number of unique paths from the top-left to bottom-right corner of an M x N matrix by moving only right or down.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the number of unique paths for each cell in the matrix.

    • Initialize the first row and first column with 1 as there is only one way to reach each cell in the first row and column.

    • For each cell ...

  • Answered by AI
  • Q2. 

    Most Frequent Word Problem Statement

    You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...

  • Ans. 

    Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.

    • Split strings 'A' and 'B' into words

    • Count frequency of each word in 'A'

    • Check if word is not in 'B' and is the most frequent and lexicographically smallest

    • Return the word or -1 if no such word exists

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

timing was 4 pm . we connected on amazon chime. Initially he asked me a few things from resume then moved on to problem solving.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider all eight possible directions for connectivity while traversing the matrix.

    • Handle edge ca...

  • Answered by AI
  • Q2. 

    Largest Rectangle in Histogram Problem Statement

    You are given an array/list HEIGHTS of length N, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.

    ...
  • Ans. 

    Find the area of the largest rectangle that can be formed within the bounds of a given histogram.

    • Iterate through the histogram bars and maintain a stack to keep track of increasing heights.

    • Calculate the area of the rectangle formed by each bar as the smallest height in the stack times the width.

    • Update the maximum area found so far and return it as the result.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Data structures , oops, operating systems, database management system , algorithmsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : be confident since interviewer is looking at how confident you are with your skills
Tip 2 : dont learn the algorithms but try to understand them
Tip 3 : focus on trees and graphs since amazon asks more of that

Application resume tips for other job seekers

Tip 1 : KEEP RESUME SHORT(1 PAGE)
Tip 2 : DONT BLUFF IN RESUME SINCE MY INTERVIEWER ASKED ME LOOKING FROM IT

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered. 

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

    Explanation...

  • Ans. 

    Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.

    • Iterate through the array and keep track of the maximum sum subarray encountered so far.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum.

    • Consider the sum of an empty subarray as 0.

    • Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.

  • Answered by AI
  • Q2. 

    Connecting Ropes with Minimum Cost

    You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...

  • Ans. 

    Connect ropes with minimum cost by merging two smallest ropes at a time.

    • Sort the array of rope lengths in ascending order.

    • Merge the two smallest ropes at a time and update the cost.

    • Repeat the process until all ropes are merged.

    • Return the total cost as the minimum cost to connect all ropes.

  • Answered by AI
  • Q3. 

    Left View of a Binary Tree Problem Statement

    Given a binary tree, your task is to print the left view of the tree.

    Example:

    Input:
    The input will be in level order form, with node values separated by a...
  • Ans. 

    Print the left view of a binary tree given in level order form.

    • Traverse the tree level by level and print the first node encountered at each level

    • Use a queue to perform level order traversal

    • Keep track of the level while traversing the tree

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Easy

This was face to face interview round.

  • Q1. 

    Finding Triplets in a Binary Tree Problem Statement

    You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...

  • Ans. 

    Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.

    • Traverse the binary tree to find all possible triplets with the required relationship.

    • Keep track of the sum of each triplet and compare it with the given integer X.

    • Return the triplets that satisfy the condition in any order.

    • Ensure each triplet follows the format (grand-parent, parent, child).

  • Answered by AI
  • Q2. 

    Loot Houses Problem Statement

    A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determi...

  • Ans. 

    Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.

    • Use dynamic programming to keep track of the maximum amount of money that can be stolen up to each house.

    • At each house, the thief can either choose to steal from the current house or skip it and steal from the previous house.

    • The maximum amount of money that can be stolen at the current house is the maximum of the ...

  • Answered by AI
Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in ChennaiAmazon interview preparation:Topics to prepare for the interview - Computer Fundamentals, Data Structures and AlgorithmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces, etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Only write those things in the resume which you are confident of and keep practicing.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Pythagorean Triplet Detection

    Determine whether an array contains a Pythagorean triplet. A Pythagorean triplet exists if there are three integers x, y, z such that x2 + y2 = z2 within the array.

    Input:

    ...
  • Ans. 

    Detect if an array contains a Pythagorean triplet.

    • Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.

    • Use a nested loop to generate all possible combinations of three numbers in the array.

    • Check if the sum of squares of two numbers is equal to the square of the third number.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Find Pair Sum Equal to K

    Given an integer array arr and an integer 'Sum', find and return the total number of pairs in the array which, when added together, result in the 'Sum'.

    Note:
    The array can cont...
  • Ans. 

    Find total number of pairs in array that sum to given value.

    • Use a hashmap to store frequency of each element in the array.

    • Iterate through the array and check if (Sum - current element) exists in the hashmap.

    • Increment count of pairs if found and update hashmap accordingly.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Find the Next Smaller Palindrome

    You are provided with a number N, expressed as a string S, which is a palindrome. The task is to determine the largest number strictly less than N that is also a palindrom...

  • Ans. 

    Find the largest palindrome number strictly less than the given palindrome number.

    • Iterate from the middle towards the start of the number and copy the digits to the left side to create the next smaller palindrome.

    • Handle cases where the middle digit is not 0 by decrementing it and mirroring the left side to the right side.

    • If the number is all 9s, change the first and last digits to 1 and fill the middle with 0s.

  • Answered by AI
  • Q2. 

    Kth Largest Number in a Stream Problem Statement

    Design a data structure that can handle an infinite stream of numbers and efficiently return the k-th largest number at any given time.

    Explanation:

    You ...

  • Ans. 

    Design a data structure to efficiently return the k-th largest number from an infinite stream of numbers.

    • Implement a max heap to store the numbers in the stream.

    • Keep the heap size limited to k to efficiently find the k-th largest number.

    • Update the heap when adding new numbers or querying for the k-th largest number.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
  • Q2. 

    Chemical Formula Problem Statement

    Given a chemical formula as a string, return the count of each atom present in the compound.

    Explanation:

    • An atomic element starts with an uppercase letter followed ...

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in BangaloreEligibility criteriaAbove 6 CGPAAmazon interview preparation:Topics to prepare for the interview - Data Structures, OOPS, DBMS, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Tip 1: Try to list only those projects in your resume regarding which you're comfortable talking in depth.
Tip 2: Always be honest about whatever you mention in your resume.
Tip3: Keep it 1 pager.
Tip4: Don't add your picture in the resume, instead use that space to put something more useful.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions
Based on ds and algorithms

  • Q1. 

    Ninja's Pattern with Powers of 2

    Ninja, who loves playing with numbers, sets out to arrange numbers within 'N' rows. The unique arrangement follows these rules: the first row contains 1 number, the second...

  • Ans. 

    Generate a pattern of numbers in rows following a specific sequence based on powers of 2.

    • Start with 1 number in the first row, 2 numbers in the second row, 4 numbers in the third row, and so on based on powers of 2.

    • Fill the pattern with numbers in increasing sequence from 1 to 9, recycling back to 1 after reaching 9.

    • Output the pattern for a given number 'N' of rows.

    • Example: For N = 4, the pattern would be 1, 23, 4567,

  • Answered by AI
  • Q2. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

    • Example: For a node with data 4, left subtree nodes (2, 1, 3) are smaller and righ

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions based on ds and algorithms

  • Q1. 

    Zig-Zag Array Rearrangement

    You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index i, the element ARR[...

  • Ans. 

    Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.

    • Iterate through the array and swap elements to satisfy the zig-zag condition.

    • Ensure that for every odd index i, ARR[i] > ARR[i-1] and ARR[i] > ARR[i+1].

    • Multiple correct answers may exist for a given array.

  • Answered by AI
  • Q2. 

    Flatten a Linked List

    You are provided with a linked list of 'N' nodes. Each node contains two pointers: NEXT, pointing to the next node in the list, and CHILD, pointing to a linked list. Each child linke...

  • Ans. 

    Flatten a linked list of sorted child linked lists into a single sorted linked list.

    • Traverse the linked list and maintain a priority queue to keep track of the next smallest element.

    • Merge the child linked lists into the priority queue while traversing the main linked list.

    • Pop elements from the priority queue to create the final flattened linked list.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

My interview started at 9:30 and it took around 45 minutes to complete my interview.This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is number of islands in a matrix.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider edge cases like when the matrix is empty or all cells are water (0s).

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 65 percentAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Computer Networks, JavaTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems

Application resume tips for other job seekers

Tip 1 : Mention your skills in which you are perfect
Tip 2 : Mention atleast two projects

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

Yandex Interview FAQs

How many rounds are there in Yandex Software Developer interview?
Yandex interview process usually has 1 rounds. The most common rounds in the Yandex interview process are Technical.
What are the top questions asked in Yandex Software Developer interview?

Some of the top questions asked at the Yandex Software Developer interview -

  1. What is 2 powered by...read more
  2. What is a race conditi...read more
  3. What is an arrow functi...read more

Tell us how to improve this page.

Yandex Software Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Yandex Software Developer Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

4.0

Salary

5.0

Job security

5.0

Company culture

4.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Senior HR Executive
3 salaries
unlock blur

₹3.2 L/yr - ₹3.5 L/yr

Social Media Executive
3 salaries
unlock blur

₹2 L/yr - ₹2 L/yr

Explore more salaries
Compare Yandex with

Google

4.4
Compare

Alibaba Group

4.1
Compare

Tencent

4.6
Compare

Infosys

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview