Oops!! It seems some javascript files did not load. Please hard reload(SHIFT + reload) your page.

“ InterviewBit has been extremely helpful in my preparation. All the questions in my coding interview were similar to the ones asked here. InterviewBit has done an amazing job of clearing up my programming concepts and landing me a job I wished for.
InterviewBit is one of the best initiatives to help people in preparing for Tech Rounds. Don't miss out people ! ”

--Lakshay Thareja

--Lakshay Thareja

“ I had already studied most of algorithms and data structures in my first and second year, but I had become rusty. I needed to revise all of those so I could be confident in the interviews for software internships.
Normally, I would have to go through a lot of websites (spoj.com, codechef.com), books, blogs, etc. to revise all the material. But I only had a few weeks to prepare. Luckily I found about InterviewBit.
The level-wise progression of topics, the hints, the solution approaches helped a lot. The game-like design helped me maintain my streak and not be bored. As a result, doing problems on InterviewBit was very interesting.
By the time I completed the course, I was confident about approaching the interviews, and they were quite easy. And I got selected for an internship at Adobe Systems.
I highly recommend InterviewBit to anyone who wants to prepare for the interviews. Thank you, InterviewBit! ”

--Sachin Kelkar

--Sachin Kelkar

What to expect at Adobe Interview?

Be able to discuss the big-O complexity of your approaches. Don't forget to brush up on your data structures like lists, arrays, hash tables, hash maps,
stacks, queues, graphs, trees, heaps. Also sorts, searches, and traversals(BFS, DFS). Also review recursion and iterative approaches.

Use the programming language you're best at. It's important to write your solution correctly and in time, so use the language you are most familiar with.

Find and fix the bugs by yourself: Don't wait for the interviewer to find them for you.

Use the hints you are given: Usually, the interviewer knows the question well enough to know which hints will help you next if you get stuck.

Find and fix the bugs by yourself: Don't wait for the interviewer to find them for you.

Use the hints you are given: Usually, the interviewer knows the question well enough to know which hints will help you next if you get stuck.

Solve Interview Problems asked at Adobe

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

Grid Unique Paths

A robot is located at the top-left corner of an A x B grid (marked ‘Start’ in the diagram below).
The robot can only move either down or right at an...

Combination Sum

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeat...

Permutations

Given a collection of numbers, return all possible permutations.
Example:
[1,2,3] will have the following permutations:
[1,2,3]
[1,3,2]
[2,1,3]
[2,...

Combinations

Given two integers n and k, return all possible combinations of k numbers out of 1 2 3 ... n.
Make sure the combinations are sorted.
To elaborate,
...

Merge Two Sorted Lists II

Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note: You have to modify the array A to contain the merge of A and B. ...

Valid Number

Validate if a given string is numeric.
Examples:
"0" => true
" 0.1 " => true
"abc" => false
"1 a" => false
"2e10" => true
...

Atoi

Implement atoi to convert a string to an integer.
Example :
Input : "9 2704"
Output : 9
Note: There might be multiple corner cases here. Clarify a...

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

Least Common Ancestor

Find the lowest common ancestor in an unordered binary tree given two values in the tree.
Lowest common ancestor : the lowest common ancestor (LCA)...