Lately, I had an on campus interview with Arista Networks. Here are the details of the company’s written and interview process. Round 1 (Written, On… Read More

Given a number n find the number of valid parentheses expressions of that length. Examples : Input: 2 Output: 1 There is only possible valid expression… Read More

It’s not often that you come across a story which is so motivating and inspiring that telling the story to your audience is what you… Read More

The selection procedure consisted of an online round followed by two Personal Interviews. Online Round: The first round had 20 mcq consisting of 3-4 questions… Read More

Adobe procedure consisted of two online rounds back to back. First Online Round- It was Aptitude Test of about 50 minutes and 40-45 Questions were… Read More

Given an array of positive and negative numbers, arrange them in an alternate fashion such that every positive number is followed by negative and vice-versa… Read More

The selection procedure consisted of an online round followed by two Personal Interviews. Online Round: The first round had 20 MCQs and two coding questions.… Read More

Given an array of random numbers, find the longest monotonically increasing subsequence (LIS) in the array.If you want to understand the O(NlogN) approach, it’s explained… Read More

Given a natural number ‘n’, print squares of first n natural numbers without using *, / and -. Examples : Input: n = 5 Output: 0… Read More

We have discussed space efficient implementation of 2 stacks in a single array. In this post, a general solution for k stacks is discussed. Following… Read More

Multiple Choice Questions Questions ranging from give the output of following C program to some theoretical concepts of OS etc. Coding 1. Give maximum subarray… Read More

Propose a data structure for the following: The data structure would hold elements from 0 to n-1. There is no order on the elements (no… Read More

Just want to share my interview experience @ Bankbazaar.com so that its helpful for the aspiring ones. Total Rounds – 6 ( 2 Telephonic Technical… Read More

A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph… Read More

Given a directed and two vertices ‘u’ and ‘v’ in it, find shortest path from ‘u’ to ‘v’ with exactly k edges on the path.… Read More

Featured Articles

View All