Upload Button Icon Add office photos

Yahoo

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Yahoo Software Engineer Interview Questions and Answers

Updated 22 Jun 2024

Yahoo Software Engineer Interview Experiences

1 interview found

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

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

Round 1 - Coding Test 

Got a leetcode easy question

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare leetcode easy thoroughly

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: First round was a written test which had 20 MCQ's in the field of Databases, Theory of computation, Operating systems, Data Structures and Algorithms and one programming question. 7 students (4 B.Tech, 3 M.Tech) got through to the interviews. Most of the interviews were held in the Google Bangalore campus. There were a total of 5 rounds of interviews. All based on Data Structures and Algorithms. Each round had 2 questions for which we were usually supposed to explain the algorithm first and then write the code on a Google doc.  It was a really great experience. I got a chance to visit both Google Bangalore and Hyderabad campuses and taste their awesome food.
Total Questions: 20

General Tips: Practice your coding skills. Writing a neat code is very important. Interviewers not just look for a good algorithm but also your coding style (indentation, variable names, simplicity etc.)
College Name: NIT SURATHKAL

Software Developer Interview Questions & Answers

Google user image Sree Meghana Thotakuri

posted on 10 Mar 2015

Interview Preparation Tips

Round: Test
Experience: Google's APAC test is an online coding round. The test is for 3 hours and it has 4 coding questions.
Duration: 180 minutes

Round: Technical Interview
Experience: I had 3 technical interviews. The questions asked in them consisted of algorithmic coding and design questions. The approach was more stressed upon. The interviewers were very helpful and they were generous in throw hints whenever I was blocked.

Skills: Algorithmic coding , C++
College Name: IIT BOMBAY

Interview Questionnaire 

13 Questions

  • Q1. Given a source array of integers with possible duplicates and a target integer, write algorithm to find out 2 numbers in source array whose sum is equal to target integer
  • Ans. 

    Algorithm to find 2 numbers in an array whose sum is equal to a target integer

    • Use a hash table to store the difference between target and each element in the array

    • Iterate through the array and check if the current element exists in the hash table

    • Return the pair of elements that sum up to the target integer

  • Answered by AI
  • Q2. Say you have three tables WORK, USERS, MANAGERS WORK - work_id - user_id - how_much USERS - user_id - team MANAGERS - manager_id - team If I am a manager, write a select statement to retrieve the work o...
  • Ans. 

    Write a select statement to retrieve work of all users who belong to my team.

    • Join USERS and WORK tables on user_id

    • Join MANAGERS and USERS tables on team

    • Filter by manager_id

  • Answered by AI
  • Q3. In a Chrome extension, which file contains the most important information of the extension like version, pattern matches, etc
  • Ans. 

    The manifest.json file contains the most important information of a Chrome extension.

    • The manifest.json file includes the version number, permissions, content scripts, background scripts, and other important details.

    • It is located in the root directory of the extension.

    • It is required for all Chrome extensions.

    • Example: "manifest_version": 2, "version": "1.0", "permissions": ["tabs", "storage"]

  • Answered by AI
  • Q4. There are three rooms, and there are Princess, Flowers and Snake in those rooms. The doors of all the rooms have incorrect nameplates. i.e., the nameplate for the princess’ room is not Princess. Similarly,...
  • Q5. Which is faster: finding an item in a hashtable or in a sorted list? And Why?
  • Ans. 

    Hashtable is faster for finding an item than a sorted list.

    • Hashtable has constant time complexity O(1) for finding an item.

    • Sorted list has logarithmic time complexity O(log n) for finding an item.

    • Hashtable uses hashing to directly access the item's location.

    • Sorted list requires binary search to find the item's location.

    • Hashtable is ideal for large datasets with frequent lookups.

    • Sorted list is ideal for datasets that re

  • Answered by AI
  • Q6. What are some of the most popular Data interchange formats when using APIs
  • Ans. 

    JSON and XML are the most popular data interchange formats when using APIs.

    • JSON (JavaScript Object Notation) is a lightweight format that is easy to read and write. It is widely used in web APIs.

    • XML (Extensible Markup Language) is a more complex format that is also widely used in web APIs.

    • Other formats include CSV (Comma Separated Values), YAML (YAML Ain't Markup Language), and Protocol Buffers.

  • Answered by AI
  • Q7. Name some popular APIs for each of these Social Commerce service(llike a photo service etc)
  • Ans. 

    Popular APIs for Social Commerce services

    • Facebook Graph API for social media integration

    • Instagram API for photo sharing and tagging

    • Twitter API for real-time updates and customer engagement

    • Pinterest API for product discovery and sharing

    • Google Maps API for location-based services

    • PayPal API for secure payment processing

  • Answered by AI
  • Q8. How would you change the format of all the phone numbers in 1000 static html pages?
  • Ans. 

    Use a script to iterate through each HTML page, locate phone numbers, and update their format.

    • Write a script using a programming language like Python or JavaScript to iterate through each HTML page

    • Use regular expressions to locate phone numbers in the pages

    • Update the format of the phone numbers as needed (e.g. adding country code, changing separators)

    • Save the updated HTML pages with the new phone number format

  • Answered by AI
  • Q9. If you had an opportunity to design the Google Suggest system, please let us know how you would approach it and how you would execute the plan in terms of settings up systems like(data stores or databases,...
  • Ans. 

    Designing Google Suggest system

    • I would start by analyzing user search patterns and frequently searched keywords

    • Then, I would create a database of these keywords and their associated search results

    • I would use indexing services to quickly retrieve relevant results for each keyword

    • I would also implement machine learning algorithms to improve the accuracy of suggestions over time

  • Answered by AI
  • Q10. How do you find out if a number is a power of 2? And how do you know if it is an odd number? Write code in the language of your choice
  • Ans. 

    Check if a number is a power of 2 and odd.

    • To check if a number is a power of 2, use bitwise AND operator with the number and its predecessor. If the result is 0, it is a power of 2.

    • To check if a number is odd, use modulus operator with 2. If the result is 1, it is odd.

    • Example code in Python:

    • def is_power_of_two(num):

    • return num & (num - 1) == 0

    • def is_odd(num):

    • return num % 2 == 1

  • Answered by AI
  • Q11. How will improve the revenue of the cafeteria of the office.
  • Ans. 

    By introducing new menu items, optimizing pricing strategy, and improving the overall dining experience.

    • Conduct a survey to understand the preferences of employees

    • Introduce healthy and affordable meal options

    • Offer discounts for bulk orders or loyalty programs

    • Partner with local vendors to source fresh ingredients

    • Improve the ambiance and seating arrangements

    • Implement online ordering and delivery services

  • Answered by AI
  • Q12. [Actual question which i screwed up. Bad Time for me]Number of users in 2001 for adwords, chrome, gmail, android and picassa are in the ratio of 6:9:14:13:8, and in 2004 we add 3 lakh more users. New rati...
  • Q13. In google adwords there are about 30 million ads from 42 lanuages . What will I do review the ads and reject ads that do not comply with specific rules
  • Ans. 

    Reviewing 30 million ads from 42 languages in Google AdWords and rejecting non-compliant ads requires a systematic approach.

    • Create a set of specific rules and guidelines for ad compliance

    • Use automated tools to filter out ads that violate the rules

    • Assign a team of reviewers to manually check the remaining ads

    • Ensure that the reviewers are fluent in the languages of the ads they are reviewing

    • Regularly update the rules and...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: I was asked to take the test at 8.30 pm. They fixed this test, a week back. Nobody will call you to remind you to take test. Nor the interviewer will call you. It is your responsibility to check ur mail without fail. On that day I was expecting a call from google from evening till 8.25 pm. None called me. I thought that they would have forgot that. I planned to do go out and have food. But suddenly my ipad gave a alert message and it was from gmail app [thanks for ipad, or else i would not have checked my mail in lap top]. It was from google recruiter. The mail stated that he has shared a doc with me and i must answer the questions in it. a google drive link was given. he mentioned that the test was for 2 hours. I was asked to type answers just below each of these questions.
Duration: 120 minutes

Round: Technical Interview
Experience: Since I had prepared for tech interviews like amazon, I was able to do it good.After a week I got a call from HR and informed that I cleared the first round. Then after two days I was told that i will have a telephonic interview with one of the google developers from adwords team . They scheduled a telephonic interview the next week

Round: Technical Interview
Experience: 1) How will improve the revenue of the cafeteria of the office. Lots of discussions went and i think, i really did that well.
2)[Actual question which i screwed up. Bad Time for me]
Number of users in 2001 for adwords, chrome, gmail, android and picassa are in the ratio of 6:9:14:13:8, and in 2004 we add 3 lakh more users. New ratio is 8:12:13:11:6. Number of picassa users in 2004= 1,44,000. Calculate number of adwords users in 2005.A basic math question that, even a school student can solve. But in that tension i was not able to do it. I took some time and finally gave him a answer. I myself knew that it would be wrong. But interviewer said great lets move on to next question[just to boost up me - good person].My actual job role revolves around developing tools for the the ad review team which will review the ad and reject illlegal ones. So third question was related to that .He told me that as I am from a tech background, I need to explain him technically wat will I do. He also said that he did not need the actual solution. They will just see the way I approach the problem. That an existing problem and they are open to suggestions.3)In google adwords there are about 30 million ads from 42 lanuages . What will I do review the ads and reject ads that do not comply with specific rules .Regarding the criteria under which google bans a ad as illegal – I discussed about different criteria .Out of the criteria’s i told , he asked me to consider only three criteria .
a) Link not working
b) Drug related ads
c) trademarks[trademark used by the companies]I gave lot of approaches like for link not workinga) designing a autobot which will automatically click ads link and check whether it is redirecting to correct page or not . Autobots are used by hackers to get money for the ads they posted . I suggested that by designing similar autobot we can validate the link.b) to check drug related ads -
To detect the language we can first check the geographic location from which the ad is getting posted and can narrow down to some less choices from which we can detect the language
i suggested him that we can create a trie which some specific keywords (like coccaine ) and do pattern matching with that and reject the add it contains any of the works in trie .The interviewer gave me another constraint wat if there comes a ad “coccaine rehabilitation center” we should reject those kind of ads na . thats for a good cause . So i suggested him that i can maintain another set of trie which can contain those set of keywords.Fist check trie1 if drug related keywords exist .
Next check trie 2 if other types of keyword exist.
– if keyword only present in trie1 [reject ad]
– if both tire return true [can reject . but its better that those ad's alone can be subjected to manual evaluation for rejection].I used trie as it can do the pattern matches faster .For trademarks also I discussed using similar datastructures and the interviewer was ok with my answer.

General Tips: I applied for a job in Google jobs page. I know that its very difficult that a resume gets noticed by google.Suddenly one fine day i got a call from Google HR saying that they are interested in my profile and asked me if, i was ready to go with the interview process[Come on! who will say no for Google]. I was surprised.I was asked to take a initial screen test [Online test].
Skills: data structure, Algorithm
College Name: na

Skills evaluated in this interview

Interview Questionnaire 

7 Questions

  • Q1. Image data structure: An image(square image) can be stored as a tree: A node is white if the image is white, is black if the image is black, and is mixed if it contains both. White and black nodes are leav...
  • Q2. There is a dictionary containing words in sorted order. These words consist of some alien alphabets. Using the dictionary, find out the ordering between the alphabets. For eg, if English was the alien lang...
  • Q3. A / b c / / d e f g Print the nodes in the following order: a, b, c, g, f, e, d, h, i, j, k, l ,m, n, o and so on. Which all data structures are used? Can we use just 1?
  • Ans. 

    Multiple data structures are used to print nodes in a specific order. One data structure cannot be used alone.

    • The given order suggests a depth-first search traversal of a tree-like structure.

    • A stack can be used to keep track of the nodes to be visited.

    • A queue can be used to store the children of a node in the order they are visited.

    • An array can be used to store the nodes in the required order.

    • A linked list can be used ...

  • Answered by AI
  • Q4. Given 2 strings like bangalore and blr, return whether one appears as a subsequence of the other. The above case returns true whereas bangalore and brl returns false
  • Q5. Given n pens and n tops, each pen (and each top) having a size different than the other and each pen fitting exactly one top, find the largest pen using minimum number of comparisons. A comparison involves...
  • Ans. 

    Find largest pen using minimum comparisons with tops.

    • Divide pens into two groups and compare largest pen from each group with largest top.

    • Repeat the process with the group containing the largest pen until only one pen is left.

    • The remaining pen is the largest pen.

    • Total number of comparisons required is 2n-3.

  • Answered by AI
  • Q6. Given n dice, each of 'a' sides and a sum b, return the number of ways in which the sum b can be obtained. How can you reduce the time complexity and space complexity?
  • Ans. 

    Given n dice with 'a' sides and sum b, return no. of ways to obtain b. Optimize time and space complexity.

    • Use dynamic programming to reduce time complexity

    • Create a 2D array to store the number of ways to obtain each sum for each number of dice

    • Use rolling arrays to optimize space complexity

    • Example: n=2, a=6, b=7 -> 6 ways to obtain sum 7

    • Example: n=3, a=4, b=8 -> 21 ways to obtain sum 8

  • Answered by AI
  • Q7. Given 2 machines, each having 64 GB RAM, containing all integers (8 byte), sort the entire 128 GB data. You may assume a small amount of additional RAM. Extend this to sort data stored in 1000 machines
  • Ans. 

    Sort 128 GB data on 2 machines with 64 GB RAM each. Extend to 1000 machines.

    • Use external sorting algorithm like merge sort or quick sort

    • Divide data into smaller chunks and sort them individually

    • Merge sorted chunks using additional RAM

    • For 1000 machines, use distributed sorting algorithms like MapReduce or Hadoop

    • Ensure data consistency and fault tolerance in distributed sorting

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There was a preliminary test, wherein questions on discrete structures, data structures, algorithms, math (permutation, combinations, probability) and operating systems were asked. There was also a programming question to code (on paper). It took them around 3 weeks to shortlist students selected for interviews.

Round: Technical Interview
Experience: It took them about a month's time to announce results!

College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    Print the level order traversal of binary tree in spiral form

    • Perform level order traversal of the binary tree

    • Alternate the direction of traversal for each level

    • Use a stack to reverse the order of nodes in each level

    • Print the nodes in the order of traversal

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    Find the maximum element in each subarray of size k in a given array.

    • Iterate through the array from index 0 to n-k.

    • For each subarray of size k, find the maximum element.

    • Store the maximum elements in a separate array.

    • Return the array of maximum elements.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

    • Merge the two arrays into a single sorted array using a modified merge sort algorithm.

    • Return the Kth element from the merged array.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

    • Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

    • Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

    • Continue this process until all elements from the second array are merged into the first array.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Coding questions were comparatively easy. There were three questions.1. Given a string map each character of which to the corresponding digit in a 10 digit mobile phone keypad.2. Don't remember, will add when it comes to my mind.3. Don't remember, will add when it comes to my mind.

Skills: Coding ability, Complete knowledge of working of internet.,
College Name: IIT Bombay

Interview Preparation Tips

Round: Test
Experience: Just 1 online test



Round - I (90 mins)



Online Test conducted @ HackerRank



a. M.C.Qs (Operating System + Aptitude + C Programming Language + Object Oriented Programming)



b. Programming (2 coding questions)The Online Exam started off after a brief Presentation on Amazon.





The MCQs were largely based on Operating System, Data structures and Algorithms, OOP concepts, C language and Aptitude.



Coding Questions



1. Determine whether a Linked List is a palindrome or not.



2. Given few sets of intervals print out the the entire intervals without overlapping , if they overlap then combine them into one.



Eg: Input : (5,7) (1 , 6) (2 ,4) (10 ,14) (8,9)



Output : (1,7) (8,9) (10,14)



Advice: Must solve at least 1 coding question to have a good chance for selection into the next round
Tips: CGPA holds importance because it is basic eligibility criteria for written test and then secondly it increases odds in your favor of your selection more than those with lower CGPA with same interview performance. Prepare a good resume



1. Prioritize your content



2. Put the most important information first (Academic Projects + Internship)



3. Proofread it twice



Advice : Do your best and leave the rest to god

Round: Test
Experience: Round II

2 Coding questions

1. Classic 2-sum problem

2. Given numbers a, b as the seeds for the Fibonacci sequence determine if a third number 'k' is a part of that sequence or not. (Tricky)
Total Questions: 2

Round: Other Interview
Experience: Round III
1. Tell me about yourself
2. Project + Internship Discussion
3. Compress a given string "aabbbccc" to "a2b3c3"
constraint: inplace compression, no extra space to be used
assumption : output size will not exceed input size

Round: Technical Interview
Experience: Round IV
1. Internship Project Discussion (30 mins)
2. Find the largest count of 0s in a row in a matrix of 0s and 1s sorted in an ascending order row-wise.
3. Replicate a tree with random pointers inplace

Round: Other Interview
Experience: Round V
1. Question related to graphs involving concepts of Depth and Height of a tree. (Took a lot of time in solving it ! but finally recognized the pattern)
2. Maximum size square sub-matrix with all 1s
3. Find the median of an infinite series of integers
4. Find the most popular Google searches. (solved it using Trie and Max-Heaps)
2 more questions but can't remember them.Finally after waiting for more than 9 hours the results were announced and I was selected
Tips: Be cool and always ask the interviewer questions at the end of the interview. Explain the interviewer your progress while solving the question so that you both are on the same page + its easier for him to understand. Behavioral and H.R.
Tips
1. Speak clearly and with confidence
2. Always prepare yourself beforehand for some common questions like:
a. Tell me about yourself.
b. Why should I hire you?
c. What are your strengths and weaknesses? (give examples)
d. What is your Dream Company?

General Tips: They judge you purely on the basis of your knowledge and performance during the face to face interviews. The extra curricular activities are not given much consideration as Amazon focuses its recruitment procedure purely on the basis of your Technical Knowledge. Prepare a good resume
1. Prioritize your content
2. Put the most important information first (Academic Projects + Internship)
3. Proofread it twice
College Name: NIT JAIPUR

Interview Questionnaire 

8 Questions

  • Q1. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity
  • Ans. 

    The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.

    • Traverse the n-ary tree using a depth-first search (DFS) algorithm

    • Keep track of the count of 'B' occurrences

    • When the count reaches 3, return the current position

    • If the end of the tree is reached before the 3rd 'B', return -1

  • Answered by AI
  • Q2. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary
  • Ans. 

    Check if a given string is a composite of two words from a limited dictionary.

    • Create a hash set of all the words in the dictionary.

    • Iterate through all possible pairs of substrings in the given string.

    • Check if both substrings are present in the hash set.

    • If yes, return true. Else, return false.

  • Answered by AI
  • Q3. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3
  • Ans. 

    Switch adjacent nodes in a single linked list.

    • Traverse the linked list and swap adjacent nodes.

    • Keep track of previous node to update its next pointer.

    • Handle edge cases for first two nodes and last node.

    • Example: 1->2->3->4 becomes 2->1->4->3.

  • Answered by AI
  • Q4. Given a binary search tree. Traverse only the left sub-tree
  • Ans. 

    Traverse only the left sub-tree of a binary search tree.

    • Start at the root node

    • If the left child exists, visit it and repeat the process

    • If the left child does not exist, return to the parent node

    • Continue until all nodes in the left sub-tree have been visited

  • Answered by AI
  • Q5. Implementation of AVL tree. I told solution in nlogn. He asked me optimize further
  • Q6. Write a program to test whether a string and all strings that can be made using the characters of that string are palindrome or not Input Output mmo True yakak True travel False
  • Q7. Next, I was asked to design an efficient data structure for two lifts in a building of n floors
  • Ans. 

    Design an efficient data structure for two lifts in a building of n floors.

    • Use a priority queue to keep track of the floors each lift is heading to

    • Implement a scheduling algorithm to determine which lift to assign to a new request

    • Consider adding a weight limit to each lift to prevent overloading

    • Use a hash table to keep track of the current location of each lift

  • Answered by AI
  • Q8. Given a Integer, find the maximum number that can be formed from the digits. Input : 8754365 output : 8765543
  • Ans. 

    To find the maximum number that can be formed from the digits of an integer.

    • Convert the integer to a string

    • Sort the characters in descending order

    • Join the sorted characters to form the maximum number

  • Answered by AI

Interview Preparation Tips

Skill Tips: They were looking for really cool coders. High expectation on accurate answers. looking for deep understanding of algorithms and data structures.
Skills: Algorithms, Data structures
College Name: PSIT

Skills evaluated in this interview

Interview Questionnaire 

11 Questions

  • Q1. A String was given with a lot of words in it and I had to reverse all the words
  • Ans. 

    Reverse all the words in a given string

    • Split the string into an array of words

    • Loop through the array and reverse each word

    • Join the reversed words back into a string

  • Answered by AI
  • Q2. A String was given and I have to swap word by word from the beginning to the end
  • Q3. In question 2 when there are ‘n’ in the String whose position shouldn’t get affected during the swapping process
  • Ans. 

    Explaining how to handle 'n' in a string during swapping process

    • Identify the positions of 'n' in the string

    • Exclude those positions from the swapping process

    • Use a temporary variable to swap the characters

    • Ensure the swapped characters are not 'n'

    • Return the modified string

  • Answered by AI
  • Q4. Continuation was when more than 1 ‘n’ occur together
  • Q5. There is a big file containing numbers and we have to sort all of them
  • Ans. 

    We can use any sorting algorithm like quicksort, mergesort, heapsort, etc.

    • Choose the appropriate sorting algorithm based on the size of the file and the range of numbers

    • Implement the chosen algorithm in the programming language of choice

    • Read the numbers from the file into an array or list

    • Apply the sorting algorithm to the array or list

    • Write the sorted numbers back to the file

  • Answered by AI
  • Q6. How to implement word suggestions like that in Eclipse
  • Ans. 

    Word suggestions in Eclipse can be implemented using algorithms like Trie or N-gram models.

    • Use Trie data structure to store the dictionary of words

    • Implement auto-complete feature using Trie

    • Use N-gram models to suggest words based on context

    • Train the N-gram model on a large corpus of text data

    • Combine both approaches for better accuracy

    • Consider user's typing speed and frequency of words for better suggestions

  • Answered by AI
  • Q7. Given 2 integers a and b, the sequence which will be formed is a, b, a+b, a+2b…. i.e Current element = sum of the previous 2 elements. So now given a number k, how to figure out if it lies in the sequenc...
  • Ans. 

    To check if a number k lies in a sequence formed by adding previous 2 elements, start with a=0 and b=1 and iterate until k is found or exceeded.

    • Start with a=0 and b=1

    • Iterate through the sequence until k is found or exceeded

    • If k is found, return true. If exceeded, return false

  • Answered by AI
  • Q8. Given a Binary Tree, if it is a BST or not
  • Ans. 

    Check if a Binary Tree is a Binary Search Tree (BST)

    • A BST has the property that all nodes in the left subtree of a node have values less than the node's value, and all nodes in the right subtree have values greater than the node's value

    • We can traverse the tree in-order and check if the resulting sequence is sorted

    • Alternatively, we can recursively check if each node satisfies the BST property

  • Answered by AI
  • Q9. A stream of numbers are coming and I have to keep track of the kth largest number in it
  • Ans. 

    Keep track of kth largest number in a stream of numbers.

    • Use a min-heap of size k to keep track of kth largest number.

    • For each incoming number, compare it with the root of the heap.

    • If it is larger than the root, replace the root with the new number and heapify.

    • The root of the heap will always be the kth largest number.

  • Answered by AI
  • Q10. Summer Internship Project
  • Q11. Given an Infix expression, how to evaluate its answer
  • Ans. 

    Infix expression can be evaluated using the concept of operator precedence and associativity.

    • Convert the infix expression to postfix expression using stack data structure

    • Evaluate the postfix expression using stack data structure

    • Use operator precedence and associativity rules to determine the order of evaluation

    • Parentheses can be used to override the default order of evaluation

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 1 Written Test - (20 MCQ + 2 Coding Questions) on HackerRankAmazon visited our Campus on 28th July. In the morning the recruitment process started with the Written Test. It was taken on Hacker Rank which comprised of 20 MCQ Questions followed by 2 Programming Questions. MCQ Questions usually contain questions on C, DBMS, OS, and 4-5 Logical Questions. One should be aware that the Hacker Rank platform keeps record of how much time you have spent on each Question and after spending so much time did you attempt it or not. The 2 Coding Problems were quite easy. Only speed and accuracy was required to crack this round.Written Round Coding Question -1) A Linked List was given and we had to swap the ith node with (n-i+1)th node.2)(given some intervals), merge the common Intervals.I coded both the problems and passed all the test cases of the first question and half of the test cases of the 2nd Question. By the evening the results of the written round were declared and the Interview Process started. I rushed to the Design Centre and while I was arranging my grade sheets and my resume , something totally unexpected happened. One of the Amazon Employees who was also an Alumni of MNIT Jaipur walked up to me and told me that I have done very well in the Written Test and I was ranked 2nd based on the Written Test. He wished me ‘Best of Luck’ and told me to calm down and give my best. Talking to him really motivated me a lot. At the same time I was shocked that he still remembered my name even after an year, as we had talked only for a couple of minutes during my Internship Process in Amazon in which I was among the last 3 Students who went to the final round but was not selected. Apart from the students shortlisted from the written test, Amazon also shortlists around 5-6 more candidates based on their CGPA and some other factors. But it should be noted that at any time during the Recruitment Process, Cumulative scores can be considered.
Tips: CGPA above 8 should definitely be maintained.
Total Questions: 22

Round: Technical Interview
Experience: The Interview Process started with around 25 candidates. I was among the first few with whom the Interview had started which went on smoothly



Questions of Interview Round II –



1) A String was given with a lot of words in it and I had to reverse all the words
2) A String was given and I have to swap word by word from the  beginning to the end.
3) In question 2 when there are ‘n’ in the String whose position shouldn’t get affected during the swapping process
4) Continuation was when more than 1 ‘n’ occur together.



I was asked to code the above, and told them about the time and space complexities. Then he went through my resume and based on my projects he appreciated my interest in OS. and asked me a Question –


You have a large game and a small memory, so how will you play the game.
I told him the concept of Virtual Memory and how it makes it possible to run such a game. Then he asked me whether there is any limit or constraint on the size of the virtual memory. I explained to him if the amount of memory required at any particular moment of time to run the game, itself exceeds the available size in the RAM for the user, then we won’t be able to play. Then he asked “Suppose you have a 4 GB Ram then how much memory will be available to the user and what will happen to the other memory”. I explained that kernel occupies some memory and apart from that page tables and all are also stored in the memory. Then there were some discussions regarding my projects.
Tips: These is some Important stuff which one should not miss while preparing for the interviews :


Languages one should be knowing for Placements:
1) C : For most of the companies
2) C ++ - For Faster coding using Standard Template Libraries and for OOPS Concept3) Java – For some specific companies which are focused on Java


Operating System:
1) Galvin Text Book
2) Video Lectures by Prof. Kamakoti – IIT Bombay (Not available on NPTEL. You can get it from current student of IIT Bombay or take it from me. I have Video Lectures of 2013 Pass out Batch)
3) Good grasp on OS implementation on Linux and Pint OS.
4) Detail Knowledge of How Threading is implemented in JAVA


Computer Networks:
1) Video Lectures by Prof. Sujoy Ghosh – IIT Kharagpur (Available on NPTEL)
2) Good grasp on Linux Networking (Servers and Networking Commands)


DBMS :
1) SQL Queries.
2) Database Implementation in MY SQL (Using B trees)
3) Indexing and Hashing in DBMS
4) Drawbacks of SQL Database
5) No SQL Database – Graph and Document Type Database and how they solve the problems
6) Every minute detail of the Database you have created in your DBMS Project.


Data Structures and Algorithms:
1) Video Lectures on Data Structures by Prof Naveen Garg – IIT Delhi (Available on NPTEL)
2) Video Lectures on Data Structure and Algorithm by Prof. Charles Leiserson and Prof. Erik Demaine - MIT.
3) TextBook – “Data Structures and Algorithms made Easy” by Karumanchi
4) TextBook – “Cracking the Coding Interview” by Gayle Laakmann Founder and CEO, CareerCup.com
5) GeeksforGeeks6) Company Specific Preparation by Practicing Previous Interview Papers


Programming Practices:
1) Codechef or Any other Coding Website: Experience helps to increase your Programming Speed, definitely useful in qualifying Coding Round
2) Standard Template Library in C++ for faster Coding - Hacker Rank Tutorial


Other Stuff to Study:
1) Brain Teasers
2) Design Problems (asked by Companies like Adobe. Detailed Example in Karumanchi Textbook)
3) Logical And Aptitude Preparation – Arun Sharma TextBook
4) HR Interview preparation from Indiabix.com

Round: Other Interview
Experience: Around 17 students were shortlisted. The resumes of students and their academic projects were given importance while shortlisting for this round. It started at around 10PM.



Questions of Interview Round III –



1) There is a big file containing numbers and we have to sort all of them.



I mentioned the approach mentioned in GeeksforGeeks that for example the available RAM for this purpose is 100 MB. So we can break the File in chunks of 100 Mb and bring the chunks in Memory and first sort them individually. Then we can prepare a heap containing first elements from all chunks. And keep extracting min from heap and replace it by next smallest element of the chunk it belongs. Then he asked if the number of chunks being formed here are very large, that is the heap I am preparing won’t fit in 100MB, then what to do. I suggested some further modifications and finally he was satisfied with the solution.



2) How to implement word suggestions like that in Eclipse.



I explained that it can be done using Tree Data Structure or using some sort of multilevel hashing in combination with storing words in sorted form. He asked me time complexities and told me to think of further improvements. He wasn’t completely satisfied and moved onto the next question.



3) Given 2 integers a and b, the sequence which will be formed is a, b, a+b, a+2b….



i.e Current element = sum of the previous 2 elements.



So now given a number k, how to figure out if it lies in the sequence or not.



This Question is not as easy as it looks. Here a and b can be negative or positive so the Generated Sequence can contain all positive or all negative or alternate occurrence of positive and negative element in sequence. So till which point should we generate the sequence and decide that k can or cannot lie in the sequence. I wrote a code but he mentioned few test cases in which my code was failing. After a few modifications I was able to write a satisfactory code solving all the test cases.

Round: Other Interview
Experience: I answered both the questions and also mentioned  solution to kth largest if Deletion operation is also there and if it is not. Then he told me to write the code for Heapify Function. Again there were some discussion regarding my Projects.

Round: Other Interview
Experience: Questions of Interview Round V -
This round started with a detailed discussion about my Summer Internship Project in Wooqer. After that I was asked to introduce myself. Then he asked me -

1) Given an Infix expression, how to evaluate its answer.

I was asked to write the code for it covering all the cases and I was given half an hour to do it. I wrote it in about 15-20 minutes. Interview of 4th Round got over by about 9 PM, and the results were declared by 11PM.
Tips: Amazon mostly focuses on – Tries, Big Data, Hashing, Strings. Apart from my general preparation for the Interview, I had gone through around 60 Amazon Interview Papers available on GeeksforGeeks, so I was totally aware of the kind of Questions I would be facing in the Interview, and prepared myself accordingly. In this year’s Amazon Interviews mostly the questions asked were not directly from GeeksforGeeks. And few questions which were picked directly from GeeksforGeeks, the solution they were expecting for it was better than that mentioned in GeekforGeeks. But to guess such a solution, one should surely be aware of all the existing solutions in GeeksforGeeks.

General Tips: Self Projects have a very high weight age in one's selection because this is one of the many things that distinguishes you from other candidates sitting in the Interview. It also shows your capabilities and your field of Interest. Also, Summer Internship surely matters a lot in Companies like Amazon. There was a very detail discussion of my Internship at Wooqer during the Interview Process at Amazon so be prepared.
College Name: NIT JAIPUR

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Yahoo Interview FAQs

How many rounds are there in Yahoo Software Engineer interview?
Yahoo interview process usually has 1 rounds. The most common rounds in the Yahoo interview process are Coding Test.

Recently Viewed

INTERVIEWS

PolicyBazaar

No Interviews

SALARIES

SBI General Insurance

INTERVIEWS

Zolo

No Interviews

LIST OF COMPANIES

SBI General Insurance

Overview

INTERVIEWS

Regency Public School

No Interviews

INTERVIEWS

Jio

No Interviews

INTERVIEWS

Jio

No Interviews

INTERVIEWS

Jio

No Interviews

SALARIES

Carwale

SALARIES

Techcanopy Software Labs

No Salaries

Tell us how to improve this page.

Yahoo Software Engineer Interview Process

based on 2 interviews

Interview experience

3.5
  
Good
View more
Yahoo Software Engineer Salary
based on 11 salaries
₹7 L/yr - ₹16.4 L/yr
71% more than the average Software Engineer Salary in India
View more details

Yahoo Software Engineer Reviews and Ratings

based on 3 reviews

4.4/5

Rating in categories

3.5

Skill development

4.7

Work-life balance

4.0

Salary

4.2

Job security

4.5

Company culture

3.3

Promotions

3.8

Work satisfaction

Explore 3 Reviews and Ratings
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