Yandex Software Engineer Interview Questions and Answers

3 leetcode hards, followed by some system design

Q1. How to design amazon
Ans. 
Designing Amazon involves creating a user-friendly e-commerce platform with a vast product selection, efficient search and recommendation algorithms, secure payment processing, and reliable delivery logistics.
• Develop a user-friendly interface for easy navigation and product search

• Implement recommendation algorithms based on user behavior and preferences

• Integrate secure payment processing systems to protect customer inf...read more
Answered by AI
Add your answer
Q2. How to invert 25 bst
Ans. 
To invert a binary search tree (BST), swap the left and right children of each node recursively.
• Start from the root node and recursively swap the left and right children of each node.

• Repeat this process for all nodes in the BST.

• The final result will be the inverted BST.
Answered by AI
Add your answer

3 questions of dsa
1 of api

Q1. Graph based question to find the shortest path between 2 prime numbers by changing 1 digit at once and obtained number should be prime too.
Add your answer

It was a machine coding round

Q1. Similar to the other question
Add your answer
Q2. Give an array and an element sort the array with difference of that number to array elements
Ans. 
Sort an array of strings by the difference of a given element to each array element.
• Iterate through the array and calculate the absolute difference between the given element and each array element.

• Sort the array based on the calculated differences.

• Return the sorted array.
Answered by AI
Add your answer

Q1. Find the leaves of the tree.
Ans. 
Leaves of a tree are the nodes with no children in a tree data structure.
• Traverse the tree and identify nodes with no children.

• Use depth-first search or breadth-first search algorithms to find leaves.

• Examples: In a binary tree, leaves are nodes with no left or right child.

• In a general tree, leaves are nodes with no children in their child list.
Answered by AI
Add your answer
Q2. Find the LCA of tree.
Ans. 
The Lowest Common Ancestor (LCA) of a tree is the shared ancestor of two nodes farthest from the root.
• Start from the root and traverse the tree to find the paths from the root to the two nodes.

• Compare the paths to find the last common node between them, which is the LCA.

• If one of the nodes is an ancestor of the other, then the ancestor node is the LCA.
Answered by AI
Add your answer

Q1. What projects you worked upon?
Ans. 
I have worked on projects involving web development, mobile app development, and data analysis.
• Developed a web application using React and Node.js for a client in the e-commerce industry

• Created a mobile app using Flutter for a startup in the healthcare sector

• Performed data analysis on customer behavior using Python and SQL for a marketing company
Answered by AI
Add your answer
Q2. What internships you did?
Ans. 
I completed internships at ABC Company and XYZ Company during my undergraduate studies.
• Interned at ABC Company working on web development projects

• Interned at XYZ Company assisting with software testing and quality assurance

• Gained hands-on experience in coding, debugging, and problem-solving
Answered by AI
Add your answer

Q1. React hooks implemetation
Add your answer
Q2. Node event loop
Add your answer

Q1. Tell me about yourself
Add your answer

Coding mainly on LinkedList and Strings

Q1. Have asked about my previous work experience and STAR pattren questions
Add your answer

Q1. Basic java understanding questions
Add your answer
Q2. Few basic SQL questions and mongodb questions
Add your answer