Upload Button Icon Add office photos

Yahoo

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Yahoo Network Specialist Interview Questions and Answers

Updated 20 Jan 2025

Yahoo Network Specialist Interview Experiences

1 interview found

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

I applied via Company Website and was interviewed before Jan 2024. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Can you provide an overview of your background and previous professional experiences?
  • Ans. 

    I have over 5 years of experience in network administration and troubleshooting.

    • Managed network infrastructure for a medium-sized company

    • Implemented security measures to protect against cyber threats

    • Troubleshooted network issues to ensure minimal downtime

    • Upgraded network equipment to improve performance

  • Answered by AI
  • Q2. Tel me abt yourself
  • Ans. 

    I am a dedicated network specialist with 5 years of experience in designing, implementing, and troubleshooting network infrastructures.

    • Experienced in configuring routers, switches, firewalls, and VPNs

    • Skilled in network monitoring and troubleshooting tools such as Wireshark and Nagios

    • Certified in Cisco CCNA and CompTIA Network+

    • Strong problem-solving and communication skills

    • Passionate about staying updated with the lates

  • Answered by AI

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Not Selected
Round 1 - Technical 

(3 Questions)

  • Q1. What is ACID in DBs ?
  • Ans. 

    ACID stands for Atomicity, Consistency, Isolation, and Durability in databases.

    • Atomicity ensures that all operations in a transaction are completed successfully or none at all.

    • Consistency ensures that the database remains in a consistent state before and after the transaction.

    • Isolation ensures that multiple transactions can be executed concurrently without affecting each other.

    • Durability ensures that once a transaction...

  • Answered by AI
  • Q2. What is the difference in checked and unchecked exceptions ?
  • Ans. 

    Checked exceptions are checked at compile time while unchecked exceptions are not checked at compile time.

    • Checked exceptions are subclasses of Exception class except RuntimeException and its subclasses.

    • Unchecked exceptions are subclasses of RuntimeException and Error classes.

    • Checked exceptions must be caught or declared in the method signature using 'throws' keyword.

    • Unchecked exceptions do not need to be caught or decl...

  • Answered by AI
  • Q3. Find the min difference between any two integers of 2 sorted list
  • Ans. 

    To find the minimum difference between any two integers of 2 sorted lists, iterate through both lists simultaneously and keep track of the minimum difference.

    • Iterate through both sorted lists simultaneously

    • Keep track of the minimum difference found so far

    • Update the minimum difference if a smaller difference is found

  • Answered by AI

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
Not Selected

I applied via Approached by Company and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Traverse through a matrix of uppercase english alphabets to find a given word. you are allowed to make up to k jumps, and same position can be repeated too.

Round 2 - Technical 

(1 Question)

  • Q1. Compression of 0-1 matrix of particular size.
  • Ans. 

    Compression of 0-1 matrix involves reducing the size of the matrix by storing only the necessary information.

    • Use run-length encoding to compress the matrix by storing consecutive repeated values as a single value and count.

    • Identify patterns in the matrix that can be represented more efficiently.

    • Consider using sparse matrix representation if the matrix has a lot of zeros.

    • Implement efficient algorithms to compress and de...

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Question on trie
  • Q2. Question on intervals
Round 1 - Technical 

(1 Question)

  • Q1. What is actual rule is using to sale more products in this company
  • Ans. 

    The actual rule for selling more products in this company is to focus on customer needs and provide excellent customer service.

    • Focus on customer needs and preferences

    • Provide excellent customer service

    • Offer promotions and discounts

    • Maintain high product quality

    • Stay up-to-date with market trends

    • Build strong relationships with customers

    • Encourage customer feedback and use it to improve

    • Train sales staff to be knowledgeable a

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing is hard work may take bow in life
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed before Jun 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. What is AI ?
  • Ans. 

    AI stands for Artificial Intelligence, which is the simulation of human intelligence processes by machines, especially computer systems.

    • AI involves the development of algorithms that can perform tasks that typically require human intelligence.

    • Examples of AI include speech recognition, image recognition, natural language processing, and autonomous vehicles.

    • AI can be categorized into narrow AI (focused on a specific task...

  • Answered by AI
  • Q2. Tell me about machine learning
  • Ans. 

    Machine learning is a branch of artificial intelligence that involves developing algorithms and models that can learn from and make predictions or decisions based on data.

    • Machine learning uses algorithms to analyze data, learn from it, and make predictions or decisions.

    • It is used in various fields such as healthcare, finance, marketing, and more.

    • Examples of machine learning applications include recommendation systems, ...

  • Answered by AI

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a Data Structures and Algorithms round with preety good questions . I was expected to come up with an efficient approach and code it as well .

  • Q1. 

    K Closest Points to Origin Problem Statement

    Your house is located at the origin (0,0) of a 2-D plane. There are N neighbors living at different points on the plane. Your goal is to visit exactly K neighb...

  • Ans. 

    Find the K closest points to the origin in a 2-D plane using Euclidean Distance.

    • Calculate the Euclidean Distance of each point from the origin

    • Sort the points based on their distances

    • Return the first K points as the closest neighbors

  • Answered by AI
  • Q2. 

    Power Set Generation

    Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

    A power set of a set 'ARR' i...

  • Ans. 

    Generate the power set of a sorted array of integers with individually sorted subsets.

    • Use recursion to generate all possible subsets by including or excluding each element in the array.

    • Sort each subset before adding it to the power set.

    • Handle base cases for empty array and single element array.

    • Ensure the subsets are unique by using a set data structure.

    • Time complexity can be exponential due to the nature of generating

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Hard

This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .

  • Q1. 

    Roman Numeral to Integer Conversion

    Convert a string representing a Roman numeral into its integer equivalent and return the result.

    Explanation:

    Roman numerals are represented by seven different symbol...

  • Ans. 

    Convert a Roman numeral string to its integer equivalent.

    • Create a mapping of Roman numeral symbols to their integer values.

    • Iterate through the input string and add the corresponding integer values.

    • Handle cases where subtraction is needed (e.g., IV = 4, IX = 9).

  • Answered by AI
  • Q2. 

    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
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was also a DSA round with 2 questions . One was implementation heavy and the other was related to recursion and so I handled it carefully so that my code does not run into TLE or Segmentation Fault.

  • Q1. 

    Arithmetic Expression Evaluation Problem Statement

    You are provided with a string expression consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...

  • Ans. 

    Evaluate arithmetic expressions in infix notation with given operators and precedence rules.

    • Parse the infix expression to postfix using a stack.

    • Evaluate the postfix expression using a stack.

    • Handle operator precedence and parentheses while evaluating.

    • Ensure no division by zero cases and operands fit in 32-bit integer.

  • Answered by AI
  • Q2. 

    Remove Duplicates from Sorted Array Problem Statement

    You are given a sorted integer array ARR of size N. Your task is to remove the duplicates in such a way that each element appears only once. The outpu...

  • Ans. 

    Remove duplicates from a sorted array in-place with O(1) extra memory.

    • Use two pointers - one for iterating through the array and another for placing unique elements.

    • Compare current element with next element to identify duplicates and skip them.

    • Update array in-place by moving unique elements to the front.

    • Return the length of the array after removal of duplicates.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was a typical System Design round where I was asked about the various features of Facebook and what sort of data structures and algorithms are used in implementing them .

  • Q1. How does Facebook store likes and dislikes?
  • Ans. 

    Facebook stores likes and dislikes using a combination of databases and algorithms.

    • Likes and dislikes are stored in databases such as MySQL or Cassandra.

    • Algorithms are used to analyze user behavior and recommend content based on likes and dislikes.

    • User interactions with posts, pages, and ads are tracked to determine likes and dislikes.

    • Likes and dislikes may also be used to personalize the user's feed and target ads mor

  • Answered by AI
  • Q2. How does Facebook implement graph search?
  • Ans. 

    Facebook implements graph search using a graph database to efficiently search for connections between users and their interests.

    • Facebook uses a graph database to store connections between users, pages, groups, etc.

    • The graph search algorithm traverses the graph to find relevant connections based on user queries.

    • It takes into account factors like user relationships, interests, and interactions to provide personalized sea

  • Answered by AI
Round 5 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to asnwers all the questions with some help from the interviewer.

  • Q1. What is Hadoop and why is it used?
  • Ans. 

    Hadoop is a framework for distributed storage and processing of large data sets.

    • Hadoop is used for storing and processing big data across a distributed network of computers.

    • It is based on the MapReduce programming model, which allows for parallel processing of data.

    • Hadoop consists of HDFS for storage and YARN for resource management.

    • It is used for tasks like data warehousing, log processing, recommendation systems, and...

  • Answered by AI
  • Q2. How does Facebook Chat work?
  • Ans. 

    Facebook Chat works by using a combination of websockets, long polling, and push technology to deliver real-time messaging.

    • Facebook Chat uses websockets for real-time communication between the client and server.

    • Long polling is used to check for new messages when websockets are not supported.

    • Push technology is used to notify users of new messages even when the chat window is not open.

    • Messages are stored in a database an...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFacebook interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.

  • Q1. 

    Ninja and Sorted Array Merging Problem

    Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...

  • Ans. 

    Merge two sorted arrays into one sorted array in place.

    • Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.

    • Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.

    • Continue this process until all elements from ARR2 are merged into ARR1.

  • Answered by AI
  • Q2. 

    Word Distance Calculation

    Given a document represented as an array/list ARR of words with length N, find the smallest distance between two given words for multiple queries. The distance is defined as the ...

  • Ans. 

    Find the smallest distance between two words in a document for multiple queries.

    • Iterate through the document array to find the indices of the two words in each query.

    • Calculate the absolute difference between the indices to get the distance.

    • If a word from the query is not present in the document, return the length of the document array.

    • Repeat the process for each query and output the smallest distance for each.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Then in the second round they asked a little about tree and told me to code 2 codes.

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    The problem requires implementing a function to return the level order traversal of a binary tree.

    • Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.

    • Use a queue data structure to perform level order traversal.

    • Process each level of the tree one by one, starting from the root node.

    • Print the node values at each level in the order they appear from left to ...

  • Answered by AI
  • Q2. 

    Combination Sum Problem Statement

    Given an array of distinct positive integers ARR and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...

  • Ans. 

    Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.

    • Use backtracking to generate all possible combinations.

    • Sort the array to ensure elements are in non-decreasing order.

    • Track the current combination and sum while backtracking.

    • Terminate recursion when the sum equals the target sum.

    • Avoid duplicates by skipping elements that have been used in previou

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a online test round where I was given 3 DSA questions to be solved in 60 minutes.

  • Q1. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves finding the number of distinct ways to climb to the Nth stair by taking one or two steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Consider using modulo 10^9+7 to avoid overflow in calculations.

  • Answered by AI
  • Q2. 

    Optimal Strategy for a Coin Game

    You are playing a coin game with your friend Ninjax. There are N coins placed in a straight line.

    Here are the rules of the game:

    1. Each coin has a value associated wit...
  • Ans. 

    The problem involves finding the optimal strategy to accumulate the maximum amount in a coin game with specific rules.

    • Start by understanding the rules of the game and how players take turns to choose coins.

    • Consider the scenario where both players play optimally to maximize winnings.

    • Iterate through different strategies to determine the best approach for selecting coins.

    • Keep track of the total winnings accumulated by eac...

  • Answered by AI
  • Q3. 

    Generate All Parentheses Combinations

    Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered w...

  • Ans. 

    Generate all possible valid parentheses configurations using N pairs.

    • Use backtracking to generate all possible combinations of parentheses.

    • Keep track of the number of open and close parentheses used.

    • Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.

    • Base case: when the length of the generated string is 2*N, add it to the result array.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Three questions of increasing difficulty level. The first one was on string manipulation, the second was based on the iterative version of the merge sort algorithm and the last one on dynamic programming.
Total Questions: 3

Round: Other Interview
Experience: Eight students were selected for this stage which consisted of three separate interviews. The first one was on algorithms and programming, the second on system design and the third was HR. In the algorithms and programming interview I was asked two questions. The interviewer asked me to first explain the proposed algorithm and then I was expected to write the code on a white board they had provided. Three weeks after the interviews the selected candidates were informed through the concerned placement coordinator.

General Tips: Don't panic, the interviewers don't expect you to come up with the optimum result directly and they will give you enough time to refine your solution.
Skill Tips: No special preparation is required. Just make sure that you have understood the fundamentals
of Data Structures and Algorithms well.
College Name: NIT SURATHKAL
Contribute & help others!
anonymous
You can choose to be anonymous

Yahoo Interview FAQs

How many rounds are there in Yahoo Network Specialist interview?
Yahoo interview process usually has 1 rounds. The most common rounds in the Yahoo interview process are One-on-one Round.

Recently Viewed

SALARIES

Forbes Marshall

DESIGNATION

JOBS

HR Works Consultancy

No Jobs

SALARIES

Iris Software

No Salaries

INTERVIEWS

Yahoo

No Interviews

INTERVIEWS

Yahoo

No Interviews

JOBS

Evolutyz IT Services

No Jobs

SALARIES

Forbes Marshall

JOBS

Impetus Consultants

No Jobs

SALARIES

Forbes Marshall

Tell us how to improve this page.

Yahoo Network Specialist Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Google Interview Questions
4.4
 • 823 Interviews
Swiggy Interview Questions
3.8
 • 425 Interviews
Udaan Interview Questions
4.0
 • 333 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
OLX Interview Questions
3.8
 • 57 Interviews
Facebook Interview Questions
4.3
 • 52 Interviews
View all
AD Operations Specialist
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Lead
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Manager
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Yahoo with

Google

4.4
Compare

Facebook

4.3
Compare

Microsoft Corporation

4.0
Compare

Amazon

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