Imagine yourself in a situation where you are having trouble coming up with a solution to your initial issue. What if I told you that a small part of the problem is simpler to solve and that you can use this answer to find the answer to the larger one? Interesting? The decrease and conquer strategy achieves just this. A problem-solving strategy known as "Decrease and Conquer" involves slicing the size of the input at every stage of the solution procedure. Identical to divide-and-conquer as it breaks the problem down into smaller sub-problems, decrease-and-conquer reduces the size of the ... Read More

In this article, we take the challenge to determine whether or not the given binary number's decimal form can be divided by 20. The base-2 numeral system, often known as the binary numeral system, is a way of expressing numbers in mathematics that employs just two symbols, commonly "0" (zero) and "1." (one). For instance, the decimal number 4 is represented as 100 in binary form. The binary form of the decimal number 6 is 110. The binary representation is 11100 for the decimal number 28. Now think how the decimal number 1, 23, 45, 687 can be represented as ... Read More

This is the problem based on stringstream class present in C++ “sstream” header file. Here, we have to find those strings whose lengths are greater than “k”. This task will be performed by using stringstream class. The concept is to partition the string and then iterate through the defined words. The value of length k has to be specified to obtain the words which are larger than k whereas the length of the words which are smaller than k will not be displayed in the output. In this article, we will understand how to find words which are greater than ... Read More

In this problem, our task is to find the length of the longest possible subsequence present in two strings such that every letter of the subsequence must be a vowel. With the help of the recursive algorithm and iterative algorithm, the given problem statement can be solved. In English Alphabet, there exist five vowels named 'A', 'E', 'I', 'O', 'U'. Subsequence Vs. Substring: In Subsequence, we may take characters in a non-continuous way, but in Substring, we can take only continuous characters. Ex: In String “TutorialsPoint”: “tri” is a subsequence but not a substring. While “tor” is both subsequence ... Read More

In mathematics, a Stella Octangula number is a figurate number based on the Stella Octangula, of the form n(2n2 − 1). Stella Octangula numbers which are perfect squares are 1 and 9653449. Problem Statement Given a number n, check whether it is the Stella Octangula number or not. The sequence of Stella Octangula numbers is 0, 1, 14, 51, 124, 245, 426, 679, 1016, 1449, 1990 Example1 Input x = 14 Output Yes Explanation $$\mathrm{For\: n = 2, expression \:n\lgroup 2n^2 – 1\rgroup is\: 14}$$ Example2 Input n = 22 Output No Explanation $$\mathrm{There \:is\: no\: ... Read More

According to Nicomachus’ Theorem, the sum of the cubes of the first n integers is equal to the square of the nth triangular number. Or, we can also say − The sum of cubes of first n natural numbers is equal to square of sum of first natural numbers. Putting it algebraically, $$\mathrm{\displaystyle\sum\limits_{i=0}^n i^3=\lgroup \frac{n^2+n}{2}\rgroup^2}$$ Theorem $$1^3 = 1$$ $$2^3 = 3 + 5$$ $$3^3 = 7 + 9 + 11$$ $$4^3 = 13 + 15 + 17 + 19\vdots$$ Generalizing $$n^3 =\lgroup n^2−n+1\rgroup+\lgroup n^2−n+3\rgroup+⋯+\lgroup n^2+n−1\rgroup$$ Proof By Induction For all n Ε Natural ... Read More

Problem Statement For an index and an arr[]. Check if the array[] can be partitioned into two disjoint sets, excluding arr[index] such that the sum of both sets has equal value. Example 1 Input arr[] = {4, 3, 1, 2}, Index = 1 Output No Explanation We have to exclude arr[1] = 3 All possible sets are − Set 1: (4), Set 2: (2, 1), sum = 4≠3 Set 1: (4, 1), Set 2: (2), sum = 5≠2 Set 1: (4, 2), Set 2: (1), sum = 6≠1 No combination satisfies the conditions. Example 2Input arr[] ... Read More

In this problem, our task is to remove all the duplicate characters present in the string other than the first occurrence of every character. Also, it's required to solve the problem without using any extra space, and the Space complexity must be O(1). Various approaches are used in this article. The Boolean array is defined in one approach to determine the repetition of the characters where the index of Boolean array is mapped to each alphabet. In the second approach, the concept of the Bit manipulation is used to remove the repeated characters from the resultant string. Let's explore ... Read More

A square triangular number, also referred to as a triangular square number, is a number that is both a triangular number and a perfect square. Square triangular numbers have an unlimited number of possible values; the first few are − 0, 1, 36, 1225, 41616... A triangular number or triangle number counts objects arranged in an equilateral triangle. The nth triangular number is the number of dots in the triangular arrangement with n dots on each side and is equal to the sum of the n natural numbers from 1 to n. The sequence of triangular numbers, ... Read More

Introduction Missing data is a common issue in data analysis and can occur due to various reasons. In Python, missing values are often represented as NaN (Not a Number) or None. Missing data can cause inaccurate analysis results and lead to biased conclusions if not handled properly. Therefore, handling missing data is an essential part of any successful data analysis project. Causes of Missing Data in Python Missing data is a common challenge that data analysts and scientists often encounter in their work. In Python, there are various reasons why data may be missing. Understanding these causes can help analysts ... Read More