Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Suppose we have two strings S and T of same length, we have to check whether it is possible to cut both strings at a common point so that the first part of S and the second part of T form a palindrome.So, if the input is like S = "cat" T = "pac", then the output will be True, as If we cut the strings into "c" + "at" and "d" + "ac", then "c" + "ac" is a palindrome.To solve this, we will follow these steps −n := size of ai := 0while i < n and a[i] ... Read More
Suppose we have a 2D matrix where matrix[i] represents the list of prerequisite courses needed to enroll course i. Now, we have to check whether it is possible to take all courses or not.So, if the input is like matrix = [[1], [2], []], then the output will be True, as we can take course 2, then course 1, and then course 0.To solve this, we will follow these steps −Define a function dfs(). This will take iif vis[i] is true, thenreturn falseif chk[i] is true, thenreturn Truevis[i]:= Truefor each j in matrix[i], doif dfs(j) is false, thenreturn Falsevis[i]:= Falsechk[i]:= ... Read More
Suppose we have a list of numbers called nums, we have to find the number of sublists where the first element and the last element are same.So, if the input is like nums = [10, 15, 13, 10], then the output will be 5, as the sublists with same first and last element are: [10], [15], [13], [10], [10, 15, 13, 10].To solve this, we will follow these steps −num_sublists := size of numsd := an empty mapfor each n in nums, dod[n] := d[n] + 1for each number k and corresponding frequency v of elements in d, doif v ... Read More
Suppose we have a list of numbers called nums of length n + 1. These numbers are picked from range 1, 2, ..., n. As we know, using the pigeonhole principle, there must be a duplicate. We have to find that and return it.So, if the input is like [2, 1, 4, 3, 3], then the output will be 3To solve this, we will follow these steps −l := size of numstemp := l*(l-1) /2temp_sum := sum of all elements in numsreturn (temp_sum - temp)Let us see the following implementation to get better understanding −Example Live Democlass Solution: def solve(self, ... Read More
Suppose we have a number n, this is representing programmers looking to enter a convention, and we also have a list of number, convention 1 represents a programmer and 0 represents empty space. Now the condition is no two programmers can sit next to each other, we have to check whether all n programmers can enter the convention or not.So, if the input is like n = 2, convention = [0, 0, 1, 0, 0, 0, 1], then the output will be TrueTo solve this, we will follow these steps −for i in range 0 to size of conv, doa:= ... Read More
Suppose we have a positive number n, where n is representing the amount of cents we have, we have to find the formatted currency amount.So, if the input is like n = 123456, then the output will be "1, 234.56".To solve this, we will follow these steps −cents := n as stringif size of cents < 2, thenreturn '0.0' concatenate centsif size of cents is same as 2, thenreturn '0.' concatenate centscurrency := substring of cents except last two digitscents := '.' concatenate last two digitwhile size of currency > 3, docents := ', ' concatenate last three digit of ... Read More
Suppose we have a number n, we have to find the nth (0-indexed) row of Pascal's triangle. As we know the Pascal's triangle can be created as follows −In the top row, there is an array of 1.Subsequent row is made by adding the number above and to the left with the number above and to the right.So few rows are as follows −So, if the input is like 4, then the output will be [1, 4, 6, 4, 1]To solve this, we will follow these steps −if n is same as 0, thenreturn [1]if n is same as 1, ... Read More
Suppose we have a list of positive numbers nums, we have to find the number of valid pairs of indices (i, j), where i < j, and nums[i] + nums[j] is an odd number.So, if the input is like [5, 4, 6], then the output will be 2, as two pairs are [5, 4] and [5, 6], whose sum are odd.To solve this, we will follow these steps −e := a list by taking only the even numbers in numsreturn (size of nums - size of e) * size of eLet us see the following implementation to get better understanding ... Read More
Suppose we have a strings older and another string newer. These two are representing software package versions in the format "major.minor.patch", we have to check whether the newer version is actually newer than the older one.So, if the input is like older = "7.2.2", newer = "7.3.1", then the output will be TrueTo solve this, we will follow these steps −older := a list of major, minor, patch code of oldernewer:= a list of major, minor, patch code of newerfor i in range the size of list older, do:= older[i], n := newer[i]if n > o, thenreturn Trueotherwise when n ... Read More
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