# Category Archives: Data Structures

Technical Round 1 (1hrs) Note: expected production-level codeDSA Round: Following questions were asked find x to power y.(later asked me to write down the code… Read More
Given a very large number N, [1 ≤ length of digit of N (n) ≤ 106], the task is to find some positive integer of… Read More
Given an N*M matrix Mat[][] containing all distinct integers, the task is to find the minimum area of the matrix (r*c, where 1 ≤ r… Read More
What variable stack size is and how does it affect computer networks? A variable stack depth (VSD) means that the maximum number of frames the… Read More
Given two integers N and K and a range [L, R], the task is to build an array whose elements are unique and in the… Read More
Software developers are regarded as the unknown heroes who design, execute, deploy and manage software programs. It is indeed a lucrative career option that promises… Read More
What is a Map? Before learning the data structure used by a map, let us have an overlook of map. Map is the part of… Read More
An array is a linear data structure. In an array, the operation to fetch a value takes constant time i.e., O(1).  Let us see why… Read More
Given a string S representing a Morse Code, the task is to check is the code is valid or not. A Morse code is valid… Read More
Given a string S of length N, the task is to find the maximum possible product of the first and the last character of the… Read More
Given an array of N strings, the task is to find if it is possible to make all the strings equal by performing the following… Read More
Given an integer N, the task is to generate a perfect binary tree with height N such that each node has a value that is… Read More
Given a string S and a list of strings subs[] that stores the substrings of S and all the substrings are present only once, the… Read More
Every great programmer, like you, works to develop code that is as efficient as possible and produces the best results. So the main goal of… Read More
Given a set of cities and the distance between every pair of cities, the problem is to find the shortest possible route that visits every… Read More