**1 Written interview**comprises two sections: Aptitude and Technical. Technical questions are mostly related to Data-Structures, Algorithms, Networking, DBMS.**4 Technical Interviews**once the written round is cleared, there would be a series of Technical interviews. Candidates need to be strong with their basics. Questions expected in this round are usually related to OS and Computer Networking, candidates would also be expected to work on codes as well as be interviewed on data present in one's resume.**1 HR Interview**normally features questions from your resume, brief explanations about one's self, one's strength and weakness and reasoning behind interviewing for Yahoo.

**Coding rounds:**Material in the programming section of InterviewBit is pretty comprehensive. For your reference, the section below has some of the questions which are frequently asked in Yahoo's Interview. Make sure to try and solve most of them.**Design rounds:**InterviewBit System Design prep has you covered here. Make sure to go through some frequently asked interview problems listed on the page.**Cultural fit rounds:**In most cases, this should not be an issue. However, go through Cultural Fit Interview Guidelines to make sure you don't make common mistakes.

Majority Element

Given an array of size n, find the majority element. The majority element is the element that appears more than floor(n/2) times.
You may assume that ...

Longest Increasing Subsequence

Find the longest increasing subsequence of a given array of integers, A.
In other words, find a subsequence of array in which the subsequence’s elemen...

Interleaving Strings

Given A, B, C, find whether C is formed by the interleaving of A and B.
Input Format:*
The first argument of input contains a string, A.
The second a...

Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list.
The new list should be made by splicing together the nodes of the first two lists, and shou...

Evaluate Expression

Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Valid operators are +, -, *, /. Each operand may be an integer or another e...

Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
push(x) – Push element x onto stack.
pop...

Max Sum Contiguous Subarray

Find the contiguous subarray within an array, A of length N which has the largest sum.
Input Format:
The first and the only argument contains an inte...

Array 3 Pointers

You are given 3 arrays A, B and C. All 3 of the arrays are sorted.
Find i, j, k such that :
max(abs(A[i] - B[j]), abs(B[j] - C[k]), abs(C[k] - A[i])) ...

Number of 1 Bits

Write a function that takes an unsigned integer and returns the number of 1 bits it has.
Example:
The 32-bit integer 11 has binary representation
0...

Sorted Insert Position

Problem DescriptionGiven a sorted array A and a target value B, return the index if the target is found. If not, return the index where it would be if ...