Skip to content

Tag Archives: Hike

Two strings str1 and str2 are called isomorphic if there is a one to one mapping possible for every character of str1 to every character… Read More
First Round Written Test(75 minutes) 1. 20 MCQ questions based on DBMS, OS, Outputs, Data Structure. 2. Two coding questions : a. Minimum Number of… Read More
How to design a system that takes big URLs like “https://www.geeksforgeeks.org/count-sum-of-digits-in-numbers-from-1-to-n/” and converts them into a short 6 character URL. It is given that URLs… Read More
Profile: Automation Testing/Manual Testing Process: Written Test (90 Minutes) + 2 Technical Interviews. Round 1 (Written Test) It consists of 50 questions (including 2 programming… Read More
I was interviewed for windows developer. Round 1 – telephonic About yourself Work done on windows platform What is mvvm What is data binding Difference… Read More
Hi, Recently I was interviewed by Hike. I have 4 years of experience. Round 1 Machine Coding round to create an android application to take… 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
I was interviewed for Android Developer. Round 1 : Discussion about Android basics and Java. Optimized technique to fetch ListViews from database v(assuming you have… Read More
Written round : We all were required to write a code for LRU implementation with proper Locks and synchronization so as it is thread safe.… Read More
Given the arrival and departure times of all trains that reach a railway station, the task is to find the minimum number of platforms required… Read More
Written round : We all were required to write a code for LRU implementation with proper Locks and synchronization so as it is thread safe.… Read More
Round 1 (Written Test ) Duration – 90 mins Section 1 ( Technical objective questions) – 25 mcq’s mainly focusing on c , c++ ,… Read More
First Round Written Test 3 sections in all. To be done in 90 minutes Section A: – 10 aptitude questions (you can find almost every… Read More
  Given a binary tree, print level order traversal in a way that nodes of all levels are printed in separate lines.For example consider the… Read More