The Build an Array With Stack Operations Leetcode Solution problem provides us with an integer sequence and an integer n. The problem states that we are given a sequence of integers from 1 to n. Then we use a stack to produce an integer sequence that is given to us …
The problem Destination City Leetcode Solution provides us with some relations between cities. The input is given as line separated pair of cities. Each line in input denotes a direct road from the starting point to the endpoint. It is given in the problem, that the cities do not form …
The problem Maximum Score After Splitting a String Leetcode Solution provided us with a string. The given string contains only 0 and 1. So one can also consider it as a binary sequence. The problem then asked us to find the maximum score achievable after splitting the string. After splitting …
Problem Statement In this problem, we are given three stones at positions a, b and c. We have to make them consecutive by performing the following step one or more times. In each step, We will pick a left stone or a right stone and put somewhere in the between …
Problem Statement In this problem, we are given a non-negative integer. We have to convert the integer in a such a format, in which there will be some dots which separates all thousands, i.e. there are dots after each 3 places from right. Example #1 n = 987 “987” #2 …
Problem Statement In this problem, we are given n people labelled from 1 to n. We are also given a 2d array trust[][] shows that trust[i][0]th people trusts trust[i][1]th people for each 0 <= i < trust.length. We have to find a person “town judge” who does not trust any …
Problem Statement In this problem we have to find out how many trailing zeroes will be there in n! Given n as input. Like there is one trailing zero in 5! 5! = 5*4*3*2*1 = 120 Example n = 3 0 Explanation: 3! = 6, no trailing zero n = 0 0 Explanation: 0! …
The problem Find the Distance Value Between Two Arrays Leetcode Solution provides us two arrays arr1 and arr2. Along with the two arrays, we are provided with an integer n. Then the problem asks us to find the relative distance between the given two arrays. The relative distance is defined …
Problem Statement In this problem, we are keep tracking of our position in a folder system. We are initially at the root folder or the main folder of this system. We have basically 3 kind of commands here. The commands are in the form of string in which each string …
Problem Statement In this problem a positive integer is given which represents a column number of an Excel sheet, we have to return its corresponding column title as appear in an Excel sheet. Example #1 28 “AB” #2 701 “ZY” Approach This problem is the reverse of the problem in …