Given an array with positive and negative numbers, find the maximum average subarray of given length.
In simple QuickSort algorithm, we select an element as pivot, partition the array around pivot and recur for subarrays on left and right of pivot.
ZoomCar Interview experience: Few weeks ago, I got a mail from Zoomcar HR saying that the CTO of the company wanted to have In-person interview with me.I was a bit shocked and confused, Since Zoomcar is now mid-size startup ,having a tech-team of 50+ people.But since the CTO directly called me for the interview so… Read More »
Find the n’th term in Look-and-say (Or Count and Say) Sequence. The look-and-say sequence is the sequence of below integers: 1, 11, 21, 1211, 111221, 312211, 13112221, 1113213211, …
Given a dictionary, and two words ‘start’ and ‘target’ (both of same length). Find length of the smallest chain from ‘start’ to ‘target’ if it exists, such that adjacent words in the chain only differ by one character and
Given a list of contacts containing username, email and phone number in any order. Identify the same contacts (i.e., same person having many different contacts) and output the same contacts together.
Given an array of distinct elements, rearrange the elements of array in zig-zag fashion in O(n) time. The converted array should be in form a < b > c < d > e < f.
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example: Input: Root of below tree
Given a matrix of characters. Find length of the longest path from a given character, such that all characters in the path are consecutive to each other, i.e., every character in path is next to previous in alphabetical order.
Given two strings A and B, the task is to convert A to B if possible. The only operation allowed is to put any character from A and insert it at front.
Given an array of integers, find the length of the longest sub-sequence such that elements in the subsequence are consecutive integers, the consecutive numbers can be in any order.
Round 1(Written): There was a technical online test in the first round. 20 questions were to be done in 30 minutes.Questions were basically from data structures, DBMS, operating systems.
Recently VMware visited our campus for full time and intern positions. There was a CGPA cut off of 7/10 for attending VMware’s hiring process.
I recently had interviews with Amazon.com, Bangalore. Here’s my interview experience Written round: 1) Insert a number at its correct position in a sorted circular linked list.
Round 1: Written Test Duration: 75 minutes Around 250 students attended the written test. There were 9 descriptive questions; we have to write the answer on sheet. No negative marking.
Around 400 students from our university were eligible to attend the interview process conducted by PayPal Pvt. Ltd., The selection criteria was based on the CGPA till 4th semester. Luckily I was one among them! Round 1: (Online Test) The Online Test was held on their own interface and consisted of about 20 MCQs questions… Read More »
Paypal visited our campus in the mid of August.Students of only CS and IT were asked to attend. First Round-(Online Round):
Online Round (Aptitude+Coding) : (2:00 hrs) Students of all branches were allowed to appear in the online round.
Company : EXL Data Analytics ——————————————- profile Offered : Report Analyst (Intern ), Business Analyst (Full Time Job)
Interview was for position of MEAN Stack Developer. First Round 5 Questions. Relatively Easy ones just required use of if and for.
1. ONLINE TEST: 15 APTITUDE QUESTIONS (HIGH LEVEL) FOR 30 MINUTES 1 CODING QUESTION FOR 60 MINUTES ( Q: FIND NUMBER OF CYCLES IN A GIVEN DIRECTED GRAPH – ADJACENCY MATRIX WOULD BE PASSED AS A INPUT)
Round 1 : (Online round : 2:30 hours) Five sections : Logical, Aptitude, Verbal, Technical and 2 coding questions.
I was recently interviewed by OLA, I could not make it after the last round. All rounds I had were telephonic, in the last round i was asked to code on collabedit.
Round-1: Online test There were 2 sections – Aptitude and Coding Section A- 20 MCQ’s on General Aptitude.
Here’s my interview experience: Round 1: Technical 1) A bot has to go from point A to point B. Every time the bot moves, it can take either 1 or 2 or 3 steps. Find the total number of ways in which this can be done.