Programming Articles - Page 2375 of 3363

Given an array arr[n] where n is some size of an array, the task is to find out that the array is palindrome or not using recursion. Palindrome is a sequence which can be read backwards and forward as same, like: MADAM, NAMAN, etc.So to check an array is palindrome or not so we can traverse an array from back and forward like −In recursion also we have to change the start and end value till they are equal or when the values as start and end are not equal then exit and return false that the given array is ... Read More

Given a number n we have to check whether the sum of its digits divide the number n or not. To find out we have to sum all the numbers starting from the unit place and then divide the number with the final sum.Like we have a number “521” so we have to find the sum of its digit that will be “5 + 2 + 1 = 8” but 521 is not divisible by 8 without leaving any remainder.Let’s take another example “60” where “6+0 = 6” which can divide 60 and will not leave any remainder.ExampleInput: 55 Output: ... Read More

Given n number of points we have to check that whether the point is parallel to x-axis or y-axis or no axis according to a graph. A graph is a figure which is used to show a relationship between two variables each measured along with axis at right angles. Parallel are the same lines which are having same distance at all points, like railway tracks are parallel to each other.So, we have to find whether the points are parallel to x-axis or y-axis means the distance between the coordinates and the axis are same at all points.What is an axisThe ... Read More

Given two strings str1 and str2 we have to check whether the two strings are same or not. Like we are given two stings “hello” and “hello” so they are identical and same.Identical are the strings which seems equal but are not equal like : “Hello” and “hello”, and same are the strings which are exactly same like : “World” and “World”.ExampleInput: str1[] = {“Hello”}, str2[] = {“Hello”} Output: Yes 2 strings are same Input: str1[] = {“world”}, str2[] = {“World”} Output: No, 2 strings are not sameThe approach used below is as follows −We can use strcmp(string2, string1).strcmp() string ... Read More

Given a number n, we have to replace a digit x from that number with another given number m. we have to look for the number whether the number is present in the given number or not, if it is present in the given number then replace that particular number x with another number m.Like we are given with a number “123” and m as 5 and the number to be replaced i.e. x as “2”, so the result should be “153”.ExampleInput: n = 983, digit = 9, replace = 6 Output: 683 Explanation: digit 9 is the first digit ... Read More

Given a string str, our task is to print its reversed pattern. The Pattern will be incremental in reversed order, and when the string is completed fill ‘*’ in the remaining places.Like we enter a string “abcd”, now in first line we have to print “a” then in next line we have to print “cb” and then in third line we will print “**d”.ExampleInput: str[] = { “abcd” } Output: a c b * * dExplanation −In first line print 1 characterIn second line print 2 characters in reverse orderIn third line Print 3 characters in reverse order, if the ... Read More

Given an array arr[] of any size n, our task is to find out that the array is palindrome or not. Palindrome is a sequence which can be read backwards and forward as same, like: MADAM, NAMAN, etc.So to check an array is palindrome or not so we can traverse an array from back and forward like −ExampleInput: arr[] = {1, 0, 0, 1} Output: Array is palindrome Input: arr[] = {1, 2, 3, 4, 5} Output: Array is not palindromeApproach used below is as follows −We will traverse the array from starting as well as from the end until ... Read More

Given a number x with n number of digits, our task is to check whether the given number’s Plus Perfect number or not. In order to check that the number is Plus Perfect Number we find the nth power of every digit d (d^n) and then sum all the digits, if the sum is equal to n then the number is Plus Perfect Number. Plus Perfect number is similar like finding an Armstrong of any number.Like In the given example below −ExampleInput: 163 Output: Number is not a perfect_number Explanation: 1^3 + 6^3 + 3^3 is not equal to 163 ... Read More

Here we will see one problem, that can tell that whether a string or a number is a concatenation of 1, 14 or 144 only. Suppose a string is “111411441”, this is valid, but “144414” is not valid.The task is simple, we have to fetch a single digit, double-digit and triple-digit number from the last, and check whether they match with any of these three (1, 14 and 144), if we get one match, divide the number with it, and repeat this process until the entire number is not exhausted.Example#include #include using namespace std; bool checkNumber(long long number) ... Read More

Here we will see one program, that can check whether a number is divisible by 41 or not. Suppose a number 104413920565933 is given. This is divisible by 41.To check the divisibility, we have to follow this rule −Extract the last digit of the number/truncated number every timesubtract 4 * (last digit of the number calculated previous) to the truncated numberRepeat these steps as long as necessary.30873, so 3087 - 4*3 = 3075 3075, so 307 - 4 * 5 = 287 287, so 28 – 4 * 7 = 0 So, 30873 is divisible by 41.Example Live Demo#include #include ... Read More