Skip to content

Tag Archives: GreyOrange

There were supposed to be 4 rounds. 1 coding and 3 face-to-face. 1st Round: Hackerrank, 4 coding questions and 1 hour limit. Not necessary to… Read More
Two rounds on Hacker Rank for shortlisting candidates Round 1: 4 programming questions in 1 hour. Program 1: Playlist: Give a string array, containing playlist… Read More
Question: Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return… Read More
There were 5 rounds. 2 coding and 3 interviews. Both coding rounds on hackerrank platform: First Coding round : 1) A matrix containing 0’s and… Read More
A binary search tree (BST) is a node based binary tree data structure which has the following properties. • The left subtree of a node contains… Read More