AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Yahoo Software Engineer Interview Questions and Answers
Yahoo Software Engineer Interview Experiences
1 interview found
Anonymous
Selected
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
Got a leetcode easy question
Interview Preparation Tips
Interview questions from similar companies
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Hard
This was an online coding round where we were supposed to solve 2 questions under 90 minutes . Both the questions in my set were related to Graphs and were quite tricky and heavy to implement.
- Q1.
Path Counting in Directed Graph
Given a directed graph with a specified number of vertices
Vand edgesE, your task is to calculate the total number of distinct paths from a given source nodeSto all ot... - Ans.
Calculate the total number of distinct paths from a given source node to all other nodes in a directed graph.
Use dynamic programming to keep track of the number of paths from the source node to each node in the graph.
Consider using modular arithmetic to handle large numbers and prevent overflow.
Start by initializing the number of paths from the source node to itself as 1.
Iterate through the edges of the graph and updat...
- Q2.
Course Schedule II Problem Statement
You are provided with a number of courses 'N', some of which have prerequisites. There is a matrix named 'PREREQUISITES' of size 'M' x 2. This matrix indicates that fo...
- Ans.
Given courses with prerequisites, determine a valid order to complete all courses.
Use topological sorting to find a valid order of courses.
Create a graph with courses as nodes and prerequisites as edges.
Start with courses that have no prerequisites and remove them from the graph.
Continue this process until all courses are taken or there are no valid courses left.
If there is a cycle in the graph, it is impossible to com
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a Data Structures and Algorithms round with some standard questions . I was expected to come up with an
efficient approach and code it as well .
- Q1.
Merge Intervals Problem Statement
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
- Ans.
Merge overlapping intervals and return sorted list of merged intervals.
Sort the intervals based on start times.
Iterate through intervals and merge overlapping intervals.
Return the merged intervals in sorted order.
- Q2.
Longest Route Problem Statement
Given a 2-dimensional binary matrix called
Matof size N x M that consists solely of 0s and 1s, find the length of the longest path from a specified source cell to a destina... - Ans.
Find the length of the longest path from a source cell to a destination cell in a binary matrix.
Use depth-first search (DFS) to explore all possible paths from source to destination.
Keep track of visited cells to avoid revisiting them.
Return the length of the longest path found, or -1 if no path exists.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
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.
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
- Ans.
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
- Q2.
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array
ARRof size 'N' and an integer 'K', determine the index at which 'K' is present in the array.Note:
1. If 'K' is not present... - Ans.
Given a rotated sorted array, find the index of a given integer 'K'.
Use binary search to find the pivot point where the array is rotated.
Then perform binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was also a DSA round with 2 questions of Medium to Hard difficulty . I was expected to follow some clean code and OOPS principles to write the code in this round .
- Q1.
Rank from Stream Problem Statement
Given an array of integers
ARRand an integerK, determine the rank of the elementARR[K].Explanation:
The rank of any element in
ARRis defined as the number of elem... - Ans.
Given an array and an index, find the number of elements smaller than the element at that index appearing before it in the array.
Iterate through the array up to index K and count the number of elements smaller than ARR[K].
Return the count as the rank of ARR[K].
Handle edge cases like empty array or invalid index K.
- Q2.
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1.
get(key)- Return the value of the key if it exists in the cache; otherw... - Ans.
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of recently used keys.
Use a hashmap to store key-value pairs for quick access.
Update the order of keys in the linked list on get and put operations.
Evict the least recently used key when the cache reaches its capacity.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Sumit Singh
I appeared for an interview before Sep 2016.
Interview Questionnaire
5 Questions
- Q1. Search an element in sorted rotated array.
- Ans.
Search an element in sorted rotated array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle the cases where the target element is at the pivot point or not present in the array.
- Q2. Kth largest element in an array.
- Ans.
Find the Kth largest element in an array.
Sort the array in descending order and return the element at index K-1.
Use a max heap to find the Kth largest element efficiently.
Implement a quickselect algorithm to find the Kth largest element in linear time.
- Q3. Reverse a linked list in group of n element.
- Ans.
Reverse a linked list in groups of n elements.
Divide the linked list into groups of n elements.
Reverse each group individually.
Connect the reversed groups to form the final linked list.
Handle cases where the number of elements is not a multiple of n.
Example: 1->2->3->4->5->6->7->8, n=3 -> 3->2->1->6->5->4->8->7
- Q4. Median of two sorted array.
- Ans.
Find the median of two sorted arrays.
Merge the two arrays into one sorted array and find the median.
Use binary search to find the median in O(log(min(m, n))) time complexity.
Handle edge cases like empty arrays or arrays of different lengths.
- Q5. It was a DP question. In a matrix, I have to count number of paths from (0, 0) to (m, n) while crossing through some indexes were not allowed.
- Ans.
Count number of paths from (0, 0) to (m, n) in a matrix while crossing through some indexes were not allowed.
Use dynamic programming to solve the problem
Create a 2D array to store the number of paths
Traverse the matrix and update the array based on the allowed paths
Return the value at the last index of the array
Interview Preparation Tips
Experience: Interviewer was mainly focused on problem solving skill.
College Name: KIIT University
Skills evaluated in this interview
I appeared for an interview in Aug 2017.
Interview Preparation Tips
Experience: Platform: Hackerearth
20 MCQs with negative marking, topics included OS, DS-Algo, Networking.
2 Programming Problems.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: 3 DS-Algo problems were asked. Made to written codes on paper.
Round: Technical Interview
Experience: 2 DS-Algo problems were asked. Made to written codes on paper.
Few OS questions were also asked.
Skills: Data Structures and Algorithms, Operating Systems
College Name: IIT (BHU)
Anuj Gupta
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
- 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.
- 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.
- 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.
Interview Preparation Tips
Duration: 90 minutes
Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL
Skills evaluated in this interview
Interview Preparation Tips
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
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
- 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.
- 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.
- 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
- 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
- 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
Interview Preparation Tips
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
- 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
- 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
- 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
- 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
- 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
- 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.
- 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
Interview Preparation Tips
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
I applied via Referral
Interview Questionnaire
6 Questions
- Q1. Design the most optimal data structures for an LRU cache
- Ans.
Design optimal data structures for LRU cache
Use a doubly linked list to keep track of recently used items
Use a hash table to store key-value pairs for quick access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and hash table
- Q2. Convert a sorted array to balanced binary search tree
- Ans.
Convert a sorted array to balanced binary search tree
Find the middle element of the array and make it the root of the tree
Recursively construct the left subtree using the left half of the array
Recursively construct the right subtree using the right half of the array
Repeat until all elements are added to the tree
- Q3. Reverse a singly linked list in groups of k inplace
- Ans.
Reverse a singly linked list in groups of k inplace
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
- Q4. Design the most optimal data structure for storing a word and its meaning. Note that a word could have multiple meanings
- Ans.
Optimal data structure for storing words and their meanings
Use a hash table with the word as the key and a list of meanings as the value
Each meaning can be stored as a string or an object with additional information
Consider using a trie data structure for efficient prefix search
Implement a search function that can handle partial matches and synonyms
- Q5. Write a recursive routine to calculate a ^ n
- Ans.
A recursive routine to calculate a ^ n
The base case is when n is 0, in which case the result is 1
For any other value of n, the result is a multiplied by the result of a^(n-1)
The recursive function should call itself with a^(n-1) as the new input
- Q6. Design the most optimal data structure for a never ending stream of numbers. It should be optimized for insertion, deletion, searching, finding kth largest and kth smallest
- Ans.
Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.
Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.
Maintain two heaps, one for kth largest and one for kth smallest.
For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.
Alternatively, use a...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Yahoo Interview FAQs
Tell us how to improve this page.
Yahoo Interviews By Designations
- Yahoo Technical Lead Interview Questions
- Yahoo Software Developer Interview Questions
- Yahoo Production Engineer Interview Questions
- Yahoo Software Engineer Interview Questions
- Yahoo District Manager Interview Questions
- Yahoo AD Operations & Sales Interview Questions
- Yahoo Software Trainee Interview Questions
- Yahoo Legal Counsel Interview Questions
- Show more
Yahoo Software Engineer Interview Process
based on 2 interviews
Interview experience
Software Engineer Interview Questions from Similar Companies
Fast track your campus placements
Yahoo Software Engineer Reviews and Ratings
based on 3 reviews
Rating in categories
|
AD Operations Specialist
18
salaries
|  ₹3.8 L/yr - ₹8.8 L/yr |
|
Software Developer
12
salaries
| ₹11 L/yr - ₹31.8 L/yr |
|
Software Engineer
11
salaries
| ₹7 L/yr - ₹16.4 L/yr |
|
Technical Lead
11
salaries
| ₹9.3 L/yr - ₹32 L/yr |
|
Associate Manager
10
salaries
| ₹13.5 L/yr - ₹25 L/yr |
Amazon
Udaan
- Home >
- Interviews >
- Yahoo Interview Questions >
- Yahoo Software Engineer Interview Questions
