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 Narendra Kumar
180 articles
C/C++ Ternary Operator
The ternary operator (?:) in C/C++ is a shorthand for an if-else statement. It is the only operator in C/C++ that takes three operands, which is why it is called "ternary". Syntax (expression-1) ? expression-2 : expression-3 This operator returns one of two values depending on the result of an expression. If expression-1 evaluates to Boolean true, then expression-2 is evaluated and its value is returned as the final result. Otherwise, expression-3 is evaluated and its value is returned. Ternary Operator Flow condition ? ...
Read MoreDeep Copy of Struct Member Arrays in C
In C, when you assign one structure variable to another, a shallow copy is typically performed. However, there is an important exception: if a structure member is an array, the compiler automatically performs a deep copy of that array. This means the array contents are copied element by element, creating independent copies in memory. Syntax struct_type destination = source; // Assignment copies all members Example: Deep Copy of Array Members The following example demonstrates how array members within structures are deep copied automatically − #include #include typedef struct ...
Read MoreC Program to Minimum and Maximum prime numbers in an array
In C programming, finding the minimum and maximum prime numbers in an array requires two key steps: identifying prime numbers efficiently and tracking the smallest and largest primes found. This problem uses the Sieve of Eratosthenes algorithm for efficient prime number generation. Problem Statement Given an array of n positive integers, we need to find the prime numbers with minimum and maximum values. If the given array is − arr[] = {10, 4, 1, 12, 13, 7, 6, 2, 27, 33} then minimum prime number is 2 and maximum prime number is 13 ...
Read MoreMaximum sum two non-overlapping subarrays of given size in C++
In this problem, we are given an array of positive integers and a number k. Our task is to create a program that will find the maximum sum of two nonoverlapping subarrays of the given size(k).So, basically we have two print two non-overlapping (distinct) subarrays that have the maximum sum and are of size k.Let’s take an example to understand the problem, Input −array = {7, 1, 6, 9, 2} , k = 2Output −{7, 1} , {6, 9}Explanation −all subarrays of size 2. {7, 1} : sum = 7+1 = 8 {1, 6} : sum = 1+6 = 7 ...
Read MoreMaximum Unique Element in every subarray of size K in c++
In this problem, we are given an array of integers and a integers K. our task is to create a program that will find the maximum unique element in every subarray of size K with no duplicates.Let’s take an example to understand the problem, Input −array = {4, 1, 1, 3, 3} k = 3Output −4 3 1Explanation −Sub-array of size 3 Subarray {4, 1, 1}, max = 4 Subarray {1, 1, 3}, max = 3 Subarray {1, 3, 3}, max = 1To solve this problem, one simple method is to run two loops and create subarrays and find distinct ...
Read MoreMaximum value of |arr[0] – arr[1] - + |arr[1] – arr[2] - + ... +|arr[n – 2] – arr[n – 1] - when elements are from 1 to n in C++
In this problem, we are given an array of n integers of range [1, n]. Our task is to create a program that will find the maximum value of |arr[0] – arr[1] - + |arr[1] – arr[2] - + … +|arr[n – 2] – arr[n – 1].Let’s take an example to understand the problem, Input − array= {1, 2, 3}Output − 3Explanation −max sum is |1-3|+|2-1| = 3To solve this problem, a simple approach is to create all permutations from the array. And find the maximum value of all the values from permutation. A more effective method is to generalize ...
Read MoreMaximum value of |arr[i] – arr[j] - + |i – j| in C++
In this problem, we are given an array of n integers. Our task is to create a program that will find the maximum value of |arr[i]-arr[j]| + |i-j|.Let’s take an example to understand the problem, Input − array = {4, 1, 2}Output − 4Explanation −|arr[0] - arr[1]|+|0-1| = |4-1| + |-1| = 3+1 = 4 |arr[0] - arr[2]|+|0-2| = |4-2| + |-2| = 2+2 = 4 |arr[1] - arr[2 ]|+|1-2| = |1-2| + |1-2| = 1+1 = 2To solve this problem, a simple approach will be using the brute force approach which will be using two loops and finding the ...
Read MoreMaximum value of arr[i] % arr[j] for a given array in C++
In this problem, we are given an array of n elements. Our task is to create a program that will find the maximum value of arr[i]%arr[j] for a given array.So, basically we need to find the value of the maximum remainder while dividing two elements of the array.Let’s take an example to understand the problem, Input − array{3, 6, 9, 2, 1}Output − 6Explanation −3%3 = 0; 3%6 = 3; 3%9 = 3; 3%2 = 1; 3%1 = 0 6%3 = 0; 6%6 = 0; 6%9 = 6; 6%2 = 0; 6%1 =0 9%3 = 0; 9%6 = 3; 9%9 ...
Read MoreMaximum value of XOR among all triplets of an array in C++
In this problem, we are given an array of integers. Our task is to create the maximum value of XOR among all triplets of an array.Let’s take an example to understand the problem, Input − array = {5, 6, 1, 2}Output − 6Explanation −All triplets are: 5^6^1 = 2 5^6^2 = 1 5^1^2 = 6 6^1^2 = 5To solve this problem, a direct approach will be to find the XOR of all possible triplets and print the maximum of all triplets. This will not be effective if we work with an array with a huge number of elements in the ...
Read MoreMaximum weight path ending at any element of last row in a matrix in C++
In this problem, we are given an integer n and a matrix of size n X n which contains the weight of the cell. Our task is to create a program that will find the maximum weight path ending at any element of the last row in a matrix. While finding the path the traversal will start from top-left (0, 0) and the valid moves will be down and diagonal, no left move is allowed.Let’s take an example to understand the problem, Input −n = 3 Mat[3][3] ={ {4, 3, 1} {5, 8, 9} {6, 7, 2}}Output ...
Read More