Skip to content

Tag Archives: Zoho

We are given two sorted arrays. We need to merge these two arrays such that the initial numbers (after complete sorting) are in the first… Read More
Given a 2D grid of characters and a word, find all occurrences of the given word in the grid. A word can be matched in… Read More
Given a string, that contains a special character together with alphabets (‘a’ to ‘z’ and ‘A’ to ‘Z’), reverse the string in a way that… Read More
Given an array, find an element before which all elements are smaller than it, and after which all are greater than it. Return the index… Read More
Given a string of odd length, print the string X format.Examples :  Input: 12345 Output: 1 5 2 4 3 2 4 1 5 Input:… 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,… Read More
Here is my experience in zoho campus drive. It was a two day process Day 1:Hey geek! It's time to become a success story instead… Read More
Zoho visited our campus in the month of July. First round: 15 apti and 15 c output questions. No negative marking and no multiple options.… Read More
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… Read More
Given a matrix, clockwise rotate elements in it. Examples:Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA… Read More
Round 1: Questions based on aptitude (10) and c program output (20) Time 2hr. Round 2: 5 problem given we have to solve at least… Read More
Given an unsorted array of n integers that can contain integers from 1 to n. Some elements can be repeated multiple times and some other… Read More
Given two dates, find total number of days between them. The count of days must be calculated in O(1) time and O(1) auxiliary space.  Examples: Attention… Read More
Round one: Note: They have two patterns, for me they asked programming pattern, which is really tough. Time: 2.15 hrs 40 Questions full of programming,… Read More
Given an unsorted array of integers, sort the array into a wave like array. An array ‘arr[0..n-1]’ is sorted in wave form if arr[0] >=… Read More