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 …
Problem Statement In this problem we are given a column title as appear in an Excel sheet, we have to return the column number that corresponds to that column title in Excel as shown below. Example #1 “AB” 28 #2 “ZY” 701 Approach To find column number for a particular …
The problem Increasing Decreasing String Leetcode Solution states that we are given a string as input. We need to modify the input. Or as the question states, we need to sort it. The term sort here does not necessarily mean simply sorting the characters. We will sort the string in …
The problem Number of Steps to Reduce a Number to Zero Leetcode Solution states that given an integer. Find the minimum number of steps to convert the given integer to 0. You can perform either of the two steps, either subtract 1 or divide the integer by 2. The problem …
The problem Remove Palindromic Subsequences Leetcode Solution states that you are given a string. The string consists of only two characters ‘a’ or ‘b’. You are required to erase the whole string. There is a restriction that you can delete only a palindromic subsequence in one move. Find the minimum …