Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
C++ Articles
Page 17 of 597
Difference between two given time periods in C++
Given two time periods in HH:MM:SS format where HH represents hours, MM represents minutes, and SS represents seconds, find the difference between them in the same format. The approach uses borrowing (similar to subtraction in arithmetic) when seconds or minutes of the smaller time are greater. Worked Example Time period 1 = 8:06:02 Time period 2 = 3:09:03 Step 1: Seconds: 02 < 03, borrow 1 minute → 62 - 03 = 59 seconds Step 2: Minutes: 05 < 09, borrow 1 hour → 65 - 09 = 56 minutes Step 3: Hours: ...
Read MoreDifference between float and double in C/C++
In C/C++, float and double are data types used to represent floating-point numbers (numbers with a decimal part). The key difference is precision − double has twice the precision of float, which means it can represent numbers with more decimal digits of accuracy. Precision and Storage float uses 32 bits (1 sign bit, 8 exponent bits, 23 mantissa bits) and provides about 6–7 significant decimal digits of precision. double uses 64 bits (1 sign bit, 11 exponent bits, 52 mantissa bits) and provides about 15–16 significant decimal digits of precision. Key Differences Feature float ...
Read MoreC++ Program to Find GCD
The Greatest Common Divisor (GCD) of two numbers is the largest number that divides both of them without leaving a remainder. For example, let's say we have two numbers 45 and 27 − 45 = 5 * 3 * 3 27 = 3 * 3 * 3 The common factors are 3 and 3, so the GCD of 45 and 27 is 9. Using Euclidean Algorithm (Modulo Method) The Euclidean algorithm finds the GCD by repeatedly replacing the larger number with the remainder of dividing the two numbers, until the remainder becomes 0. At that point, the other ...
Read MoreC++ Program to Find All Roots of a Quadratic Equation
A quadratic equation is in the form ax2 + bx + c = 0. The roots of the quadratic equation are given by the following formula − x = −b ± √ b² − 4ac 2a The value b2 − 4ac is called the discriminant. It determines the nature of the roots. There are three cases − b2 > 4ac − The roots are real and different. b2 = 4ac − The roots are real and both roots are the same. b2 ...
Read MoreHow to wrap python object in C/C++?
To wrap existing C or C++ functionality in Python, there are number of options available, which are: Manual wrapping using PyMethodDef and Py_InitModule, SWIG, Pyrex, ctypes, SIP, Boost.Python, and pybind1. Using the SWIG Module Let’s take a C function and then tune it to python using SWIG. The SWIG stands for “Simple Wrapper Interface Generator”, and it is capable of wrapping C in a large variety of languages like python, PHP, TCL etc. Example Consider simple factorial function fact() in example.c file. /* File : example.c */ #include // calculate factorial int fact(int n) { ...
Read MoreMaximum Sum Increasing Subsequence using DP in C++ program
In this problem, we are given an array arr[] of size n. Our task is to create a program to find the maximum Sum Increasing Subsequence using DP in C++.Problem Description − To find the maximum sum increasing subsequence, we will be creating a subsequence in which the next element is greater than the current element.Let’s take an example to understand the problem, Inputarr[] = {4, 2, 3, 6, 5, 9}Output20ExplanationIncreasing subsequence with maximum sum: {2, 3, 6, 9} = 2 + 3 + 6 + 9 = 20Solution ApproachTo solve the problem using a dynamic Program Approach. We will ...
Read MoreFind Maximum XOR value of a sub-array of size k in C++
In this problem, we are given an array arr[] consisting of n elements and an integer k. Our task is to find the Maximum XOR value of a sub-array of size k.Let’s take an example to understand the problem, Inputarr[] = {3, 1, 6, 2 ,7, 9} k = 3Output12ExplanationAll subarray and the xor of all element of size k, {3, 1, 6} = 4 {1, 6, 2} = 5 {6, 2, 7} = 3 {2, 7, 9} = 12Solution ApproachA simple solution to the problem is by using two loops. One to iterate over the array and other to ...
Read MoreFind maximum possible stolen value from houses in C++
In this problem, we are given n houses with some values in them. Our task is to Find the maximum possible stolen value from houses.Problem Description − We have an array houses[] that consist of the values that are in each house. A thief robs the houses but he cannot steal from two adjacent houses as neighbours know about the theft. We need to find the maximum possible value that can be stolen by the thief from the house without getting caught.Let’s take an example to understand the problem, Inputhouses[] = {5, 2, 1, 6, 7, 9, 4, 3}Output23ExplanationThe max ...
Read MoreFind maximum value of Sum( i*arr[i]) with only rotations on given array allowed in C++
In this problem, we are given an array arr[] consisting of n elements. We need to Find maximum value of Sum( i*arr[i]) with only rotations on a given array allowed. For find the maximum sum of (i*arr[i]), we can perform any number of rotations.Let’s take an example to understand the problem, Inputarr[] = {4, 1, 3, 7, 2}Output43ExplanationWe will rotate the array once to get the maximum value, After rotation array will be {2, 4, 1, 3, 7}Sum = 0*2 + 1*4 + 2*1 + 3*3 + 4*7 = 0 + 4 + 2 + 9 + 28 = 43Solution ...
Read MoreFind maximum XOR of given integer in a stream of integers in C++
In this problem, we are given Q queries each of which is one of the following type, Type 1 − insertion (1, i) to add the element with value i, in your data structure.Type 2 − findXOR (2, i), to find the XOR of all elements of the data structure with the element i.The data structure should contain only 1 element initially which will be 0.Let’s take an example to understand the problem, InputQueries: (1, 9), (1, 3), (1, 7), (2, 8), (1, 5), (2, 12)Output15 15ExplanationSolving each query, (1, 9) => data structure => {9} (1, 3) => data ...
Read More