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
Articles by Nishu Kumari
Page 7 of 9
C++ Program to Calculate Power of a Number
In this article, we'll show you how to calculate the power of a number in C++. Calculating a power means multiplying the base by itself as many times as the exponent indicates. For example, 2 raised to the power of 3 (2^3) means multiplying 2 by itself three times: 2 * 2 * 2, which gives 8. In C++, there are different ways to calculate the power of a number. Below are the approaches we cover: Using a Loop Using Recursion Using the pow() Function ...
Read MoreC++ Program to Check Whether a character is Vowel or Consonant
In this article, we'll show you how to write a C++ program to check if a given character is a vowel or a consonant. Vowels are the letters 'a', 'e', 'i', 'o', 'u'(both uppercase and lowercase), and all other alphabetic characters are consonants. For example, if we input the character 'a', the program will output 'vowel'. If we input 'b', it will output 'consonant'. In C++, there are different ways to check if a character is a vowel or consonant. Below are the common methods: Using an if-else statement ...
Read MoreC/C++ Pointers vs Java references\\n
In this article, we will show you the difference between C/C++ pointers and Java references. C/C++ use pointers to manually control how memory is used and accessed. Java, on the other hand, does not support pointers and uses references instead, which manage memory automatically. Pointer in C/C++ A pointer is a variable that holds the address of another variable in memory. It gives you direct access to that memory, which is powerful but can lead to errors if not used carefully. Syntax Here's the syntax where we declare a pointer with an asterisk(*) ...
Read MoreHow to deallocate a 2D array in C++
In this article, we will learn how to deallocate a 2D array in C++. A 2D array is an array of arrays, where each element points to another array. When you dynamically allocate a 2D array, memory is reserved for each row and the main array on the heap. Deallocating memory means freeing the memory that was previously allocated for the 2D array so it can be reused. In C++, this involves deleting each row first and then deleting the main array. Deallocating a 2D Array in C++ In C++, a 2D array can be dynamically allocated in ...
Read MoreReduce a given array by replacing all subarrays with values less than a given number K by their sum
In this article, we will learn how to reduce a given array by replacing all subarrays with values less than a given number K by their sum. This process simplifies the array by merging smaller values. Given an array of integers and a value K, we need to find all contiguous subarrays whose values are less than K and replace them with their sum. After performing this reduction, the resulting array will have fewer elements, as the smaller subarrays will be combined into one. Let's consider an example. Given the array: [1, 2, 3, 5, 1, 4, 6, ...
Read MoreFind the longest prefix in a string that has the highest frequency across the string.
In this article, we'll discuss the problem of finding the longest prefix in a string that has the highest frequency (appears most often) across the string. We'll break it down step-by-step and show how to efficiently solve this problem. Given a string, we need to find the longest prefix (the starting sequence) that appears most often in the string. A prefix is simply a substring that begins at the start of the string and includes one or more characters. Let's understand with an example. For the string 'abcabc', the prefixes are: a ...
Read MoreHow to resolve a name conflict in C++
In C++, a name conflict occurs when two or more identifiers, such as variables, functions, or classes, share the same name within the same scope. This creates ambiguity because the compiler may struggle to distinguish between them, leading to compilation errors. In this article, we will discuss name conflicts in C++ and also ways to resolve them, ensuring your code remains clear and error-free. Name Conflict Error in C++ Name conflicts typically occur when the same name is used for different variables, functions, or classes in conflicting or overlapping scopes, or when they are declared globally or within the ...
Read MoreHow to pass an array into a lambda function in C++
In this article, we will learn how to pass an array into a lambda function in C++. A lambda function is a small, anonymous function that doesn't have a name and can access variables from the surrounding code. Passing an array to a lambda function is a bit different from passing a single value because you need to define how the array will be handled inside the lambda. Let's see how to do that. Passing an Array into a Lambda Function We will cover four main methods to pass arrays into lambda functions in C++: ...
Read MoreHow to initialize multi-set with custom comparator in C++
In this article, we will learn how to initialize a std::multiset with a custom comparator in C++. A multiset is similar to a set, except that it allows duplicate elements. It stores elements in a sorted order based on a comparison function. By default, elements are compared using the < (less-than) operator. However, with a custom comparator, we can define how elements should be compared. For example, if we define a custom comparator that sorts elements in descending order and insert the following elements into the multiset: Input: 3 12 5 8 1 7 9 4 6 Output: {12, 9, ...
Read MoreCount maximum number of disjoint pairs having one element not less than k times the other in C++
In this article, we will discuss how to count the maximum number of disjoint pairs in an array, where for each pair (x, y), one element is not less than K times the other. The goal is to find the number of such valid pairs in the array using C++. Given an array of integers, the task is to find all pairs (i, j) such that: arr[i] > K * arr[j] or arr[j] > K * arr[i] holds true for a given constant K. The condition is that no element ...
Read More