Skip to content

Tag Archives: Hike

Round 1: Online Coding Round 5 Programming Questions, Duration: 75 minutes Given two coordinates (a, b) and (c, d), check if (a, b) can be… Read More
I have recently attend Hike Hiring Drive for iOS Developer in Delhi office. Candidates are  0-2, 2-4 and 4+ years of experience . I have… Read More
Recently, I visited Hike Campus for SDET profile interview process. The first round started with following written test consisting of 4 coding problem as follows,… Read More
Design a data structure for LRU Cache. It should support the following operations: get and set. get(key) – Get the value (will always be positive)… Read More
Round 1 (telephonic) Design a system wherein users are sharing images. You need to track the top trending images Design an event system wherein… Read More
Given a singly linked list and a number k, write a function to find the (n/k)-th element, where n is the number of elements in… Read More
Given a set of n nuts of different sizes and n bolts of different sizes. There is a one-one mapping between nuts and bolts. Match… Read More
Round I 1.Implement expiry cache system : every page in cache have id and expiry time (TTL of few seconds). After page expires it behaves… Read More
Given an array of integers, our task is to write a program that efficiently finds the second largest element present in the array. Example: Input: arr[]… Read More
Given two binary trees. The problem is to check whether the two binary trees are mirrors of each other or not. Mirror of a Binary Tree:… Read More
Given a Binary Tree, print the nodes level wise, each level on a new line.  Output: 1 2 3 4 5 Recommended: Please solve it… Read More
Given two Binary Trees, write a function that returns true if two trees are mirror of each other, else false. For example, the function should… Read More
Given an array of integers, and a number ‘sum’, find the number of pairs of integers in the array whose sum is equal to ‘sum’.… Read More
Hi, I was recently Ignite world visited our college for MTS Round -1 Aptitude test which consisted of around 50 MCQS ,out of which 30… Read More
Given a binary tree, we need to check it has heap property or not, Binary tree need to fulfill the following two conditions for being… Read More