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 24 of 597
Find minimum possible digit sum after adding a number d in C++
In this problem, we are given two numbers n and d. Our task is to Find the minimum possible digit sum after adding a number d.Problem Description − we need to minimise the digits sum by adding kth multiple of d to n.Let’s take an example to understand the problem, Inputn = 5230, d = 54Output1ExplanationThe number will be 5230 + (2*54) = 5338Solution ApproachA simple approach to solve the problem would be to check all multiples of d from 1 to 8, as at 9th multiple the sum of digits will repeat. This is based on modulo 9, which ...
Read MoreFind minimum speed to finish all Jobs in C++
In this problem, we are given an array arr[] consisting of n elements and an integer h. Each element of the array arr[] contains the number of pending jobs for the person and H is the time left to complete the jobs (in Hours). Our task is to Find minimum speed to finish all Jobs.Problem Description: We need to find the number of jobs the person needs to complete in one hour in order to complete all the jobs given in the array in H hours. If he can complete all specified at arr[i] in less than an hour, we ...
Read MoreFind mirror image of a point in 2-D plane in C++
In this problem, we are given a point P in a 2-D plane and the points a, b, c of the equation ax + by + c = 0. Our task is to find a mirror image of a point in 2-D plane.Let’s take an example to understand the problem, InputP = (2, 1), a = 1, b = -1, c = 0Output(1, 2)ExplanationThe plane looks like, Solution ApproachTo solve the problem, we need to find the equation point P' with coordinates (x', y'). So, we have R, the midpoint where the line form P - P' intersects the mirror ...
Read MoreFind modular node in a linked list in C++
In this problem, we are given a singly linked list LL and a number k. Our task is to Find modular node in a linked list.Problem Description − we need to find the last node of the linked list for which the index is divisible by k i.e. i % k == 0.Let’s take an example to understand the problem, Inputll = 3 -> 1 -> 9 -> 6 -> 8 -> 2, k = 4Output6ExplanationThe element 6 has index 4, which is divisible by 4.Solution ApproachA simple solution to the problem is by creating a counter to count the ...
Read MoreFind Multiples of 2 or 3 or 5 less than or equal to N in C++
In this problem, we are given a number N. Our task is to Find Multiples of 2 or 3 or 5 less than or equal to N.Problem Description − We will be counting all elements from 1 to N that are divisible by 2 or 3 or 5.Let’s take an example to understand the problem, InputN = 7Output5ExplanationAll the elements from 1 to 7 are : 1, 2, 3, 4, 5, 6, 7. Elements divisible by 2/3/5 are 2, 3, 4, 5, 6Solution ApproachA simple approach to solve the problem is by traversing all numbers from 1 to N and ...
Read MoreFind N % (Remainder with 4) for a large value of N in C++
In this problem, we are given a string num representing a large integer. Our task is to Find N % (Remainder with 4) for a large value of N.Problem Description − we will be finding the remainder of the number with 4.Let’s take an example to understand the problem, Inputnum = 453425245Output1Solution ApproachA simple solution to the problem is by using the fact that the remainder of the number with 4 can be found using the last two digits of the number. So, for any large number, we can find the remainder by dividing the number’s last two digits by ...
Read MoreFind n positive integers that satisfy the given equations in C++
In this problem, we are given three values A, B and N. Our task is to Find n positive integers that satisfy the given equations.Problem Description − We need to find the N positive values that satisfy both the equations, x12 + x22 + … xn2 ≥ A x1 + x2 + … xn ≤ BPrint n values if present, otherwise print -1.Let’s take an example to understand the problem, InputN = 4, A = 65, B = 16Output1 1 1 8ExplanationThe equations are −12 + 12 + 12 + 82 = 1 + 1 + 1 + 64 = ...
Read MoreFind n-th element in a series with only 2 digits (and 7) allowed in C++
In this problem, we are given an integer N, denoting a series of numbers consisting of 4 and 7 only.The series is 4, 7, 44, 47, 74, 77, …The task is to find the n-th element in a series with only 2 digits (and 7) allowed.Let’s take an example to understand the problem, InputN = 4, Output47ExplanationThe series is: 4, 7, 44, 47, ….Solution ApproachA simple solution to the problem is creating the series till Nth number. It’s simple, if the current number’s last digit is 7. Then the last digit of previous and next numbers is 4.So, we will ...
Read MoreFind n-th node in Postorder traversal of a Binary Tree in C++
In this problem, we are given a binary tree and an integer N. The task is to find the n-th node in Postorder traversal of a Binary Tree.A binary tree has a special condition that each node can have a maximum of two children.Traversal is a process to visit all the nodes of a tree and may print their values too.Let’s take an example to understand the problem, InputN = 6Output3ExplanationPost order traversal of tree − 4, 5, 2, 6, 7, 3, 1Solution ApproachThe idea is to use the post order traversal of the binary tree which is done by ...
Read MoreFind n-th node of inorder traversal in C++
In this problem, we are given a binary tree and an integer N. The task is to find the n-th node in inorder traversal of a Binary Tree.A binary tree has a special condition that each node can have a maximum of two children.Traversal is a process to visit all the nodes of a tree and may print their values too.Let’s take an example to understand the problem, InputN = 6Output3Explanationinorder traversal of tree : 4, 2, 5, 1, 6, 3, 7Solution ApproachThe idea is to use the in-order traversal of the binary tree which is done by using recursive ...
Read More