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 circles (center points, and the radius values), we have to check one circle is fit inside another circle or not. There are three possible causes.The smaller circle lies completely inside the bigger one, without touching each other. In this case, the sum of the distance between the centers, and the smaller radius, is lesser than a bigger radius. So the smaller one will be inside the bigger one.The second case is the smaller circle is inside the bigger ones, but also touches the circumference of the bigger circle.The third case is, some part of the smaller ... Read More
Suppose we have a binary string. Our task is to check whether the string has consecutive same characters or not. If there are consecutive same characters, then that is invalid, otherwise valid. Then the string “101010” is valid, but “10111010” is invalid.To solve this problem, we will traverse from left to right, if two consecutive characters are the same, then return false, otherwise true.Example Live Demo#include #include using namespace std; bool isConsecutiveSame(string str){ int len = str.length(); for(int i = 0; i
Generally, system administrators check the performance problems and related issues using various monitoring tools. nload is one of the most useful app to monitor network throughput on the command line interface. It is a console application which monitors network traffic and bandwidth usage in real time. It visualizes the traffic using two graphs and provides additional info like total amount of transferred data and min/max network usage.This article describes “how to monitor network traffic and bandwidth usage in Cent OS”.Installing nloadBefore installing nload on Cent OS, EPEL package is required and it should be enabled by default.To install EPEL package, ... Read More
Suppose we have three numbers a, b, c, we have to check whether a + b = c, after removing all 0s from the numbers or not. Suppose the numbers are a = 102, b = 130, c = 2005, then after removing 0s, the numbers will be a + b = c : (12 + 13 = 25) this is trueWe will remove all 0s from a number, then we will check after removing 0s, a + b = c or not.Example Live Demo#include #include using namespace std; int deleteZeros(int n) { int res = 0; ... Read More
GNOME is a totally intuitive and user friendly desktop environment for CentOS and RHEL 7.x based system. The latest version of GNOME Desktops are GNOME 2 to GNOME 3 and the GNOME Shell desktop. Most of the users who prefer traditional desktop environments can get it via GNOME’s classic mode. It is also fully configurable with extensions. If you have done basic installation, this article will give insights on – how to install Gnome GUI on a CentOS 7 or RHEL 7 using a command line options.Installing Gnome GUITo install Gnome GUI, use the following commands-$ yum grouplistThe sample output ... Read More
Here we will see whether a number is sandwiched between primes or not. A number is said to be sandwiched between primes when the number just after it, and just below it is prime numbers. To solve this, check whether n-1 and n+1 are prime or not.Example Live Demo#include #include #define N 100005 using namespace std; bool isPrime(int n) { if (n == 0 || n == 1) return false; for (int i=2;i
Here we will see one program, that can check whether a number is magic number or not. A number is said to be magic number, when the recursive sum of the digits is 1. Suppose a number is like 50311 = 5 + 0 + 3 + 1 + 1 = 10 = 1 + 0 = 1, this is magic number.To check whether a number is magic or not, we have to add the digits until a single-digit number is reached.Example Live Demo#include using namespace std; int isMagicNumber(int n) { int digit_sum = 0; while (n > ... Read More
Suppose we want to find the result after multiplying two numbers A and B. We have to check whether the multiplied value will exceed the 64-bit integer or not. If we multiply 100, and 200, it will not exceed, if we multiply 10000000000 and -10000000000, it will overflow.To check this, we have to follow some steps. These are like below −Steps −If anyone of the numbers is 0, then it will not exceedOtherwise, if the product of two divided by one equals to the other, then it will not exceedFor some other cases, it will exceed.Example Live Demo#include #include ... Read More
We have the sum and gcd of two numbers a and b. We have to find both numbers a and b. If that is not possible, return -1. Suppose the sum is 6 and gcd is 2, then the numbers are 4 and 2.The approach is like, as the GCD is given, then it is known that the numbers will be multiples of it. Now there following stepsIf we choose the first number as GCD, then the second one will be sum − GCDIf the sum of the numbers is chosen in the previous step is the same as the ... Read More
We have a string with three colors (G, B, Y). We have to find the resulting color based on these relations −B * G = YY * B = GG * Y = BSuppose the string is “GBYGB” is B. If the string is “BYB”, then it will be Y.The approach is simple; we will take the string. Compare each alphabet with adjacent characters, using the given condition, find the color.Example Live Demo#include using namespace std; char combination(string s) { char color = s[0]; for (int i = 1; i < s.length(); i++) { ... Read More