“ I got offers from Amazon and Ebay. InterviewBit was pretty much my only resource for data structures and algorithms. Two months of timed interview questions and you get used to being under pressure. Editorial answers help you improve your coding style. The questions are organized logically, so that once you have finished it, you can be sure you have covered all necessary topics. Cracking tech interviews became cake walk after solving questions on InterviewBit. ”

--Saurabh Maurya

--Saurabh Maurya

“ InterviewBit dramatically changed the way my full-time software engineering interviews went. Just 30 minutes on the site every day will help you tremendously. The problems here are very similar to those you will be asked interviewing for tech companies and the structure of InterviewBit really facilitates learning. If you want a software engineering position, there is no better way to prepare than using InterviewBit. Practice every day and there is no job that is unobtainable :) ”

--Julia Cochran

--Julia Cochran

“ InterviewBit has been really helpful because the question available on this website are exact in the same form that are asked in technical interviews and coding round, even the coding environment is same as that we face in coding round of placement process. I will recommend InterviewBit to get an extra edge over other candidates. ”

--Utkarsh Trivedi

--Utkarsh Trivedi

“ The coding problems are divided into categories, which makes it very easy to prepare for any job interview. Moreover, they are extensive and cover almost all the general/most important questions asked by companies. Programming problems are maintained and extremely up to date. Practicing on interviewbit really helped me in cracking Amazon's interview. ”

--Sreejan Shrivastava

--Sreejan Shrivastava

“ InterviewBit provided a platform for writing code without IDE, within time limit and with multiple hints; which helped me to prepare for and stay confident in interview.
It covers all the topics and subtopics of Data Structures and Algorithms with famous problems asked in interviews, in a particular order which ensures that one doesn't skip any prerequisite for next topic.
InterviewBit was one of the most useful resources I used, and would recommend to anyone preparing for interview
or willing to improve programming skills.
Really looking forward for other topics such as Databases, Operating Systems to be included. ”

--Rajan Waliya

--Rajan Waliya

**2-4 Coding interviews**which focus on basic problem solving and data structures. The less experienced you are, the more the number of coding rounds for you.**1 Design interview**which involve coming up with high level design architectures for real life products as well as OOPS based design of components. This round might be scrapped for you if you are interviewing for an entry level software engineering role.**1 Hiring manager round**which tests for cultural fit based on attitude and previous work experience. In depth knowledge of previous tech used is paramount here.**An optional bar raiser round**which is a combination of all of the above. The idea is here to judge if you are technically better than an average person in a particular Amazon team.

**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 Amazon'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.

Gas Station

There are N gas stations along a circular route, where the amount of gas at station i is gas[i].
You have a car with an unlimited gas tank and it cost...

Longest Increasing Subsequence

Find the longest increasing subsequence of a given sequence / array.
In other words, find a subsequence of array in which the subsequence’s elements a...

Max Product Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest product.
Return an integer corresponding to the max...

Ways to Decode

A message containing letters from A-Z is being encoded to numbers using the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Given an en...

Best Time to Buy and Sell Stocks II

Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may comple...

Best Time to Buy and Sell Stocks III

Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may comple...

Best Time to Buy and Sell Stocks I

Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction...

Max Sum Path in Binary Tree

Given a binary tree, find the maximum path sum.
The path may start and end at any node in the tree.
Example :
Given the below binary tree,
1...

Palindrome Partitioning II

Given a string s, partition s such that every substring of the partition is a palindrome.
Return the minimum cuts needed for a palindrome partitioning...

Min Sum Path in Matrix

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
...

Min Jumps Array

Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maxim...

Edit Distance

Given two words A and B, find the minimum number of steps required to convert A to B. (each operation is counted as 1 step.)
You have the following 3 ...

Unique Binary Search Trees II

Given A, how many structurally unique BST’s (binary search trees) that store values 1...A?
Example :
Given A = 3, there are a total of 5 unique BST’s...

Jump Game Array

Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maxim...

Stairs

You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl...

Swap List Nodes in pairs

Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1-...

Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL and k = 2,
ret...

Reorder List

Given a singly linked list
L: L0 → L1 → … → Ln-1 → Ln,
reorder it to:
L0 → Ln → L1 → Ln-1 → L2 → Ln-2 → …
You must do this in-place wit...

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...

Add Two Numbers as Lists

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single d...