Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
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
In Software development life cycle (SDLC), tracking bugs is one of the critical area and without this step, SDLC process cannot be completed. Developers are generally required to track bugs using bug tracking software in development projects. There are certain bug tracking system providers in the market which are specialized into tracking bugs and managing of full software projects.After a detailed research, I have listed down the Top 5 open source bug tracking systems for Linux.BugzillaBugzilla is an open source bug tracking system. It is used to manage software development which is also helpful to get a handle on software ... 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
WordPress is a free content management system (CMS) and well-known across the globe. It is an open source CMS based on MySQL and PHP. Beginners generally begin with WordPress on localhost. Here’s how we start with WordPress on localhost using XAMPP.TerminologyContent Management System (CMS) − A CMS has a central interface that is used to publish, edit, modify, and maintain content. Some well know CMS include, WordPress, Drupal, and Joomla.WordPress− It is an open source content management system founded by Matt Mullenweg and Mike Little. It was initially released in the year 2003 and its current version is WordPress 4.4.Xampp− ... 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
Do you know “How to take screenshots in Linux operating system”? then this article is for you! There are many tools, which are available for Linux operating systems but one of the most reputed tool for screenshots which I would recommend is Shutter. It is an open source program and is written in perl. It is designed extremely well, offering an easy way to take screenshots of the entire screen, a region of the screen, a specific window, or even a website with a click of a button.Features of ShutterThe main attributes of the shutter tool are listed below –It ... 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
Here we will see one program, that can check whether a number is divisible by 23 or not. Suppose a number 1191216 is given. This is divisible by 23.To check the divisibility, we have to follow this rule −Extract the last digit of the number/truncated number every timeadd 7 * (last digit of the number calculated previous) to the truncated numberRepeat these steps as long as necessary.17043, so 1704 + 7*3 = 1725 1725, so 172 + 7 * 5 = 207 207, this is 9 * 23, so 17043 is divisible by 23.Example Live Demo#include #include using namespace ... Read More
Here we will see how to check a number is Krishnamurty number or not. A number is Krishnamurty number, if the sum of the factorial of each digit is the same as the number. For example, if a number is 145, then sum = 1! + 4! + 5! = 1 + 24 + 120 = 145. So this is a Krishnamurty number, The logic is simple, we have to find the factorial of each number, and find the sum, then if that is the same as a given number, the number is Krishnamurty number. Let us see the code ... Read More