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
Articles by AYUSH MISHRA
Page 6 of 12
C++ Program to Rotate Array Left by One Position
Rotating an array means shifting the elements of an array in a specific direction while maintaining their relative order. For example, if the array {6, 12, 18, 24, 30} is rotating it left once will result in {12, 18, 24, 30, 6}. In this article, we are given an array and need to shift all elements one step to the left, with the first element moving to the last position. Example Here is an example of left rotation of elements in array by one place. Input: array = {5, 10, 15, 20, 25} Output: array = {10, 15, ...
Read MoreC++ Program to Find Sum of Leaf Node in Binary Tree
We can find the sum of leaf nodes in a binary tree using an iterative and a recursive approach. This problem has many real-life applications, such as analyzing hierarchies, calculating final results in decision trees, or summing final nodes in various kinds of trees used in computer algorithms. In this article, we are going to learn how can find the sum of all leaf nodes in a binary tree in the C++ language. What are Leaf Nodes in a Binary Tree? The leaf nodes of a binary tree are the nodes that do not have any children. Both the ...
Read MoreKth largest Element in a 2D matrix where each row and column is sorted in C++
Finding the Kth largest element in a 2D matrix where each row and column is sorted is a common problem in computer science. This problem has many real-life applications, such as a ranking system, where we need to find the Kth highest score in a sorted dataset. In this article, we are going to discuss how we can find the Kth largest element in a 2D matrix e where each row and column is in sorted order in the C++ language. What is the Kth Largest Element? The Kth largest element refers to an element that is placed at ...
Read MoreSwap all odd and even bits using C++
We can swap all odd and even bits in a given integer. Swapping of odd and even bits means changing the bits present at odd positions with the bits at even positions in a binary representation of a number. One real-life application is optimizing data storage or modifying data patterns in memory. In this article, we are going to learn how we can swap all odd and even bits of a number in C++ using different approaches. Formula for Swapping Odd and Even Bits Extract all even-positioned bits using a bit mask and shift ...
Read MoreCheck if all the 1s in a binary string are equidistant or not in C++
In this problem, we are given a binary string, and we have to check if all the 1s present in the binary string are at an equivalent distance from each other. Example 1 Input: binaryString = "10101010" Output: Yes Explanation The positions of 1s in the given string are 1, 3, 5, and 7.Here, the difference between consecutive 1s is 2 (as 7-5 equals 5-3 equals 3-1), so all 1s are at an equivalent distance from each other. Example 2 Input: binaryString = ...
Read MoreC++ program for finding nth term of H.P.
What is Harmonic Progression? A Harmonic Progression is a sequence of numbers formed by the reciprocal of an Arithmetic progression sequence. If a given sequence a1, a2, a3, a4... is in Arithmetic progression, then 1/a1, 1/a2, 1/a3, 1/a4... forms a Harmonic Progression. Formula for the nth term of Harmonic Progression? The formula for the nth term of a Harmonic Progression is: Tn = 1 / (1/a1 + (n - 1) * d) where: a1 is the first term of the Harmonic Progression. d is the common difference of the corresponding Arithmetic ...
Read MorePython Program to Rearrange an array such that arr[i] = i
In this problem, we are given an array and we have to rearrange the elements of the array such that for each index i, arr[i] = i. We have to rearrange the elements so that each element is in the position corresponding to its value. Scenario 1 Input: [3, 0, 2, 1] Output: [0, 1, 2, 3] Element 3 is the largest, so it is moved to the last index, 0 is the smallest element, so itismoved to the first index, 2 is moved to the third index, and 1 is moved to the second index. Scenario 2 ...
Read MoreMinimum sum of differences with an element in an array
Problem Statement In this problem, we are given an array of integers, and we have to select a particular element from the array such that the sum of absolute differences between that element and all other elements is minimized. Example 1 Input: arr = [3, 1, 2, 5, 4] Output: 6 Explanation: If we select 3 as the element, the sum of differences is: |3-1| + |3-2| + |3-3| + |3-4| + |3-5|= 2 + 1 + 0 + 1 + 2 = 6 ...
Read MoreCheck if two numbers are coprime using Python
In this article, we are going to learn how we can check whether two given numbers are co-prime in Python using different approaches. What are Co-prime Numbers? Two numbers are said to be co-prime numbers if they have no common factors other than 1. Checking if two numbers are co-prime We can check if two given numbers are co-prime numbers by finding their GCD (Greatest Common Factor). GCD is also known as HCF (Highest Common Factor). If the GCD of two numbers is 1, then those numbers are co-prime numbers; otherwise, they are not co-prime numbers. Below are the examples ...
Read MoreC++ Program to count the number of days in a given month of a year
There are a total of 365 days in a normal year and 366 days in a leap year. In this article, we are going to learn how we can find the number of days in a month of a given particular year. Here, we will learn about different approaches for calculating the number of days in a given month using C++. How to Find the Number of Days in a Given Month? There are a total of 12 months in a year. The number of days in a given month from 1 to 12 in a given leap or non-leap ...
Read More