Server Side Programming Articles - Page 1542 of 2650

Suppose we have a binary tree which contains unique values and we also have another value k, we have to find the number of k-length unique paths in the tree. The paths can go either from parent to child or from child to parent. We will consider two paths are different when some node appears in one path but not the other.So, if the input is likek = 3, then the output will be 4, as the paths are [12, 8, 3], [12, 8, 10], [8, 12, 15], [3, 8, 10].To solve this, we will follow these steps−Define a function ... Read More

Suppose we have a number n, we have to find the number of bit 1 present in the binary representation of that number.So, if the input is like 12, then the output will be 2To solve this, we will follow these steps −count := 0while n is non-zero, docount := count + (n AND 1)n := floor of (n / 2)return countLet us see the following implementation to get better understanding −Example Live Democlass Solution:    def solve(self, n):       count = 0       while (n):          count += n & 1          n >>= 1       return count ob = Solution() print(ob.solve(12))Input12Output2

Suppose we have a number n, we have to find the nth Fibonacci term. As we know the ith Fibonacci term f(i) = f(i-1) + f(i-2), the first two terms are 0, 1.So, if the input is like 15, then the output will be 610To solve this, we will follow these steps −first := 0, second := 1for i in range 2 to n, dotemp := first + secondfirst := secondsecond := tempreturn secondLet us see the following implementation to get better understanding −Example Live Democlass Solution:    def solve(self, n):       first = 0       second ... Read More

Suppose we have a number n representing a chessboard of size n x n. We have to find the number of ways we can place n rooks, such that they cannot attack each other. Here two ways will be considered different if in one of the ways, some cell of the chessboard is occupied, and another way, the cell is not occupied. (We know that rooks can attack each other if they are either on the same row or on the same column).So, if the input is like 3, then the output will be 6To solve this, we will follow ... Read More

Suppose we have a BST, and we also have left and right bounds l and r, we have to find the count of all nodes in root whose values are present in between l and r (inclusive).So, if the input is likel = 7, r = 13, then the output will be 3, as there are three nodes: 8, 10, 12.To solve this, we will follow these steps−stack := a stack and insert root at first, count := 0while stack is not empty, donode := top element of stack, and pop elementif node is not null, thenif l

Suppose we have a number n; we have to check whether it is equal to the sum of the digits of n to the power of the number of digits.So, if the input is like 9474, then the output will be True as 9^4 + 4^4 + 7^4 + 4^4 = 6561 + 256 + 2401 + 256 = 9474.To solve this, we will follow these steps −s := a list of digits in of nreturn true if n is same as sum of x*(size of s) for all x in s, otherwise falseLet us see the following implementation to ... Read More

Suppose we have a list of numbers called nums, we have to sort the array by maintaining following criteriaEven numbers are sorted in ascending orderOdd numbers are sorted in descending orderThe relative positions of the even and odd numbers should not be changed.So, if the input is like [9, 14, 12, 91, -4, 5], then the output will be [91, -4, 12, 9, 14, 5]To solve this, we will follow these steps −evens := list of even terms in nums arrayodds := list of odd terms in nums arraysort the list evenseven_i := 0, odd_i := 0for index in range ... Read More

Suppose we have a list of numbers called nums of size n where all numbers in the list are present in the interval [1, n] some elements may appear twice while others only once. We have to find all of the numbers from [1, n] such that they are not in the list. We have to return the numbers sorted in ascending order. We have to try to find a solution that takes linear time and constant space.So, if the input is like [4, 4, 2, 2, 6, 6], then the output will be [1, 3, 5].To solve this, we ... Read More

Suppose we have a list of numbers called nums, we have to check whether there is an element whose frequency in the list is same as its value or not.So, if the input is like [2, 4, 8, 10, 4, 4, 4], then the output will be TrueTo solve this, we will follow these steps −res := a new map to store value wise frequencyfor each key value pair (k, v) in res, doif k is same as v, thenreturn Truereturn FalseLet us see the following implementation to get better understanding −Example Live Democlass Solution:    def solve(self, nums):     ... Read More

Suppose we have a list of numbers called nums, we have to find the minimum cost to sort the list in any order (Ascending or Descending). Here the cost is the sum of differences between any element's old and new value.So, if the input is like [2, 5, 4], then the output will be 2.To solve this, we will follow these steps −temp:= copy the array numssort the list tempc1:= 0, c2:= 0n:= size of numsfor i in range 0 to n, doif nums[i] is not same as temp[i], thenc1 := c1 + |nums[i]-temp[i]|if nums[i] is not same as temp[n-1-i], ... Read More