Yahoo Software Engineer2 Interview Questions and Answers

Q1. Q1 was about ds algo
Add your answer

Q1. Q2 was about lld
Add your answer

Q1. Q3 was about lld too
Add your answer

Q1. Q4 was about hiring manager round, from resume basically
Add your answer

Q1. Was asked a simple question based on recursion
Add your answer

Q1. System Design Concepts. Discussion about day to day work on my current job
Add your answer

Q1. Detailed system design interview. Was asked a lots of questions about design of current project
Add your answer

Q1. It was more about day to day work responsibilities. Whether I was willing to relocate. And some questions around strengths and weakness
Add your answer

Data Structures and Algorithms - Easy

Code a chineese pebble game

Q1. 2 Entities for cross site sale promotion.
Ans. 
Two entities for cross site sale promotion are affiliate marketing platform and customer loyalty program.
• Affiliate marketing platform: Allows businesses to partner with affiliates who promote their products on their own websites in exchange for a commission.

• Customer loyalty program: Rewards customers for repeat purchases or other actions, encouraging them to continue shopping with the brand.
Answered by AI
Add your answer
Q2. Grill on Q1 with questions on security and loop holes. List SPOF and how to fix it.
Add your answer

Q1. Do you want to do a Puzzle round?
Add your answer
Q2. Then asks Celebrity problem which I obviously didn't know at that time.
Add your answer

The interviewer was a team Lead Engineer. He first asked me a few questions about database fundamentals (Cluster Index, Composite Index, ACID, etc). Then he presented me with a coding question on codility (LC Hard String question). He was very helpful during the interview and nudged me towards the right direction when I got stuck.

Usually medium LC questions

Q1. Design Snakes and Ladder
Ans. 
Design a snakes and ladder game with a board, dice, and player pieces.
• Create a game board with squares numbered from 1 to 100.

• Place snakes and ladders on specific squares to move players up or down.

• Players roll a dice to move their pieces on the board.

• The first player to reach square 100 wins the game.
Answered by AI
Add your answer

You need to write code as algorithm for the given problem

You will need a end to end architecture and details , along with problem solving skillset

Q1. Techno managerial Round
Add your answer

Q1. Senior manager round or as called AA round
Add your answer

Hackerrank was used for test

Q1. Implement BFS to find the nearest neighbour
Ans. 
Implement BFS algorithm to find the nearest neighbour
• Create a queue to store nodes to be visited

• Start with the initial node and add it to the queue

• While the queue is not empty, dequeue a node, visit its neighbours, and add them to the queue

• Repeat until the nearest neighbour is found
Answered by AI
Add your answer
Q2. Implement Priority queue using heap.
Ans. 
Priority queue can be implemented using a heap data structure.
• Create a min heap or max heap based on the priority order needed.

• Insert elements into the heap based on their priority level.

• Remove elements from the heap based on their priority level.

• Heapify the heap after each insertion or deletion operation.

• Example: Implementing a min heap for a priority queue where lower values have higher priority.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 50 minutes
Round difficulty - Easy

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round duration - 40 minutes
Round difficulty - Easy

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
Ans. 
Implement a Trie data structure with insert and search functions.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert function to add words by iterating through characters.

• Implement search function to check if a word exists by traversing the Trie.

• Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Answered by AI
Add your answer