Upload Button Icon Add office photos

Yahoo

Compare button icon Compare button icon Compare

Filter interviews by

Yahoo DevOps Site Reliability Engineer Interview Questions and Answers

Updated 9 Oct 2024

Yahoo DevOps Site Reliability Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Gave a question about implementing hashset.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with your core CSE concepts

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Implement boolean canConstruct(String targetString, String[] dict) which returns true if we can construct the targetString by concatenating the words given in the dictionary

Round 2 - Technical 

(1 Question)

  • Q1. Implement key value store
  • Ans. 

    Implement a key value store for storing and retrieving data efficiently.

    • Use a hash table or a balanced tree data structure to store key-value pairs.

    • Implement functions for inserting, updating, deleting, and retrieving key-value pairs.

    • Consider implementing features like transactions, concurrency control, and data persistence.

    • Example: Implement a simple key value store using a hash table in Python.

  • Answered by AI

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Minimum Knight Moves (LC Medium)
  • Q2. OS, CN, DB concepts like multithreading, semaphore, tcp vs udp, transaction and ACId properties. Java concepts like stack vs heap(memory), error vs exception. Any 1 Project discussion for 10 mins

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare all the fundamental concepts of operating systems and databases. Refer to the company-tagged questions from LC.

I appeared for an interview in Jun 2022.

Round 1 - Technical 

(1 Question)

  • Q1. Focus on algorithms - trees, graphs. Questions on improving algorithm performance. Converting algorithm to code.

Interview Preparation Tips

Interview preparation tips for other job seekers - Deep Study - Graph data structure, Tree Data Structure, and solve as many problems as you can on Graph and Tree
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I appeared for an interview before Jul 2023.

Round 1 - Coding Test 

45 min round. Similar to Leetcode medium level question.

Round 2 - Coding Test 

45 min coding round, 2 question asked

Round 3 - Technical 

(1 Question)

  • Q1. System design of proximity service
  • Ans. 

    Design a system for proximity service

    • Utilize geolocation data to track user locations

    • Implement algorithms to calculate proximity between users

    • Use real-time updates to notify users of nearby contacts

  • Answered by AI
Round 4 - One-on-one 

(1 Question)

  • Q1. Behavioral questions

Skills evaluated in this interview

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

I applied via Approached by Company and was interviewed before Nov 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Prefer not to due to NDA
Round 3 - Coding Test 

Brush up on DS and Algorithms

Interview Preparation Tips

Interview preparation tips for other job seekers - Brush up on DS and algorithms
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Aug 2023. There were 4 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Hiring manager round
  • Q2. Questions on previous projects
Round 2 - One-on-one 

(2 Questions)

  • Q1. Longest subsequence with sum zero
  • Ans. 

    Find the longest subsequence in an array with sum zero.

    • Iterate through the array and keep track of the running sum.

    • Store the running sum in a hashmap along with the index.

    • If the same sum is encountered again, the subsequence between the two indices has a sum of zero.

  • Answered by AI
  • Q2. Find diameter of tree
  • Ans. 

    The diameter of a tree is the longest path between two leaf nodes in the tree.

    • Calculate the longest path between two leaf nodes in the tree

    • This can be done by finding the height of the left and right subtrees and adding them together

    • The diameter of the tree is the maximum of either the diameter of the left subtree, the diameter of the right subtree, or the sum of the heights of the left and right subtrees

  • Answered by AI
Round 3 - One-on-one 

(1 Question)

  • Q1. System design: Hotel booking system
  • Ans. 

    Design a hotel booking system for managing reservations and availability.

    • Use a database to store hotel information, room availability, and reservations.

    • Implement user authentication and authorization for booking.

    • Include a search feature for users to find available rooms based on their criteria.

    • Allow users to make reservations, modify or cancel them.

    • Send confirmation emails to users after successful bookings.

  • Answered by AI
Round 4 - Coding Test 

Divide one big integer by another

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Print the nodes of a n-ary tree in an arc wise manner as seen from the outside.
  • Ans. 

    Print nodes of n-ary tree in arc wise manner from outside

    • Traverse the tree level by level from outside to inside

    • Use a queue to keep track of nodes at each level

    • Print the nodes at each level in a clockwise or anticlockwise manner

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Uber Senior Software Engineer interview:
  • n-ary tree

Skills evaluated in this interview

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

I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.

Round 1 - Coding Test 

It was a ideal machine coding round. Consisting of a question to be completed within 45 mins. For a given manager to employee hierarchy, count direct + indirect repartees.

Interview Preparation Tips

Topics to prepare for Uber Senior Software Engineer interview:
  • Data Structures
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Nov 2023. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. Given array of integer create subarray with sum = 0
  • Ans. 

    Create subarrays with sum = 0 from given array of integers.

    • Iterate through the array and keep track of the running sum.

    • Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.

    • If yes, then the subarray between those two indices has a sum of 0.

  • Answered by AI
  • Q2. Left view of binary tree
  • Ans. 

    The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.

    • Traverse the tree in a level order manner and keep track of the first node at each level.

    • Use a queue to store nodes at each level and update the left view nodes accordingly.

    • Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].

  • Answered by AI

Skills evaluated in this interview

Yahoo Interview FAQs

How many rounds are there in Yahoo DevOps Site Reliability Engineer interview?
Yahoo interview process usually has 1 rounds. The most common rounds in the Yahoo interview process are Technical.

Tell us how to improve this page.

Yahoo DevOps Site Reliability Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.0
 • 5.1k Interviews
Swiggy Interview Questions
3.8
 • 434 Interviews
Udaan Interview Questions
3.9
 • 334 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
CarDekho Group Interview Questions
3.7
 • 73 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
OLX Interview Questions
3.8
 • 57 Interviews
Facebook Interview Questions
4.3
 • 52 Interviews
Groupon Interview Questions
3.1
 • 42 Interviews
View all
AD Operations Specialist
18 salaries
unlock blur

₹3.8 L/yr - ₹8.8 L/yr

Software Developer
12 salaries
unlock blur

₹11 L/yr - ₹31.8 L/yr

Software Engineer
11 salaries
unlock blur

₹7 L/yr - ₹16.4 L/yr

Technical Lead
11 salaries
unlock blur

₹9.3 L/yr - ₹32 L/yr

Associate Manager
10 salaries
unlock blur

₹13.5 L/yr - ₹25 L/yr

Explore more salaries
Compare Yahoo with

Google

4.4
Compare

Facebook

4.3
Compare

Amazon

4.0
Compare

Udaan

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