Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
In this article, we will be discussing a program to find the parity of a given number N.Parity is defined as the number of set bits (number of ‘1’s) in the binary representation of a number.If the number of ‘1’s in the binary representation are even, the parity is called even parity and if the number of ‘1’s in the binary representation is odd, the parity is called odd parity.If the given number is N, we can perform the following operations.y = N ^ (N >> 1)y = y ^ (y >> 2)y = y ^ (y >> 4)y = ... Read More
In this article, we will be discussing a program to find the number of triangles that can be formed by joining the intersection points of the given horizontal and vertical line segments.For example, let us say we had been given the following line segments. In this we have 3 intersection points. So the number of triangles that can be formed using these points will be 3C2. | ---|--------|-- | | | --|---| | |We will be following the Sweep Line Algorithm. We will be storing all the values of the line ... Read More
In this article, we will be discussing a program to find the first digit in the product of the elements of the given array.For example, let us say we have been given an array.arr = {12, 5, 16}Then the product is of these elements would be 12*5*16 = 960. Therefore, the result i.e the first digit of the product in this case would be 9.Example Live Demo#include using namespace std; int calc_1digit(int arr[], int x) { long long int prod = 1; for(int i = 0;i < x; i++) { prod = prod*arr[i]; } ... Read More
In this article, we will be discussing a program to find the best fit rectangle that covers a given point.In this problem, we are given we the coordinates of a point (x, y) and a ratio of length/breadth = l/b (say). We have to find the coordinates of a rectangle which contains the given point and whose dimensions follow the given ratio. In case of multiple rectangle existing, we have to choose the one having the shortest distance between its euclid’s center and the given point.To solve this, first we would minimize the ratio l/b. After that, we find the ... Read More
In this article, we will be discussing a program to find the sum of digits of a number until the sum itself becomes a single digit and cannot be done summation of further.For example, take the case of a number 14520. Adding the digits of this number we get 1 + 4 + 5 + 2 + 0 = 12. Since this is not a single digit number, we would further add the digits of the number received. Adding them we get, 1 + 2 = 3.Now, 3 is the final answer because it is a single digit number itself ... Read More
In this article, we will be discussing a program to find the minimum vertex cover size of a given graph using binary search.Minimum vertex cover is a set of vertices of the given graph such that every edge in the graph is incident of either of the vertices in that set.For example, take the graph2 ---- 4 ---- 6 | | | | | | 3 ---- 5Here, the minimum vertex cover involves vertices 3 and 4. All the edges of the graphs are incident on either 3 or 4 ... Read More
In this article, we will be discussing a program to find the first digit in the factorial of a given number.The basic approach for this is to find the factorial of the number and then get its first digit. But since factorials can end up being too large, we would make a small tweak.At every point we would check for any trailing zeroes and remove if any exists. Since trailing zeroes isn’t having any effect on the first digit; our result won’t change.Example Live Demo#include using namespace std; int calc_1digit(int n) { long long int fact = 1; ... Read More
In this article, we will be discussing a program to find the first collision point i.e the first point that both of the series have.In this, we would be given with five variables ‘a’, ‘b’, ‘c’, ‘d’ and ‘n’. We have to create two arithmetic progression series from these having n digits eachb, b+a, b+2a, ….b+(n-1)a d, d+c, d+2c, ….. d+(n-1)cAnd then find the first common point that both of the given series has.To solve this, we would create the numbers in the first series. And for each number we would check if it is greater than or equal to ... Read More
In this article, we will be discussing a program to find the cabs near about (less than 50km) using the Great Circle Distance formula.Let us suppose we have been given a JSON file which contains the name and coordinates of the people who need a cab and also the coordinates of the all the cabs available.To solve this, we would convert the GPS coordinates into double. From the double form, we would finally convert them in degrees to radians. Then we can ultimately apply the Great Circle Distance formula to find the cabs available in 50km from the user’s position.Note ... Read More
In this article, we will be discussing a program to find an integer ‘k’, such that its modulus with each element of a given array is the same.For example, let us suppose we have been given with an array, arr = {12, 22, 32}Then we have the output value of k = 1, 2, 5, 10.Take the case of two values in the array ‘x’ and ‘y’ (x>y). Then we have (y+difference)%k = y%k. Solving this we get, difference%k = 0So, we will find all the divisors to the difference of the maximum and minimum element in the array and ... Read More