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 on Trending Technologies
Technical articles with clear explanations and examples
Find the Number of Subarrays with Odd Sum using C++
Subarrays are the contiguous part of an array. For example, we consider an array [5, 6, 7, 8], then there are ten non-empty subarrays like (5), (6), (7), (8), (5, 6), (6, 7), (7, 8), (5, 6, 7), (6, 7, 8) and (5, 6, 7, 8).In this guide, we will explain every possible information to find the number of subarrays with odd sums in C++. For finding the number of subarrays with the odd sum, we can use different approaches, so here is a simple example for it −Input : array = {9, 8, 7, 6, 5} Output : 9 ...
Read MoreFind the Number Of Subarrays Having Sum in a Given Range using C++
In this article, we will solve the number of subarrays having sum in a given range using the C++ program. We have an array arr[] of positive integers, and a range {L, R} and we have to calculate the total number of subarrays having sum in the given range form L to R. So here is the simple example for the problem −Input : arr[] = {1, 4, 6}, L = 3, R = 8 Output : 3 The subarrays are {1, 4}, {4}, {6}. Input : arr[] = {2, 3, 5, 8}, L = 4, ...
Read MoreFind the Number of Subarrays with m Odd Numbers using C++
If you have ever used C ++, you must know what subarrays are and how useful they are. As we know that, in C++, we can solve multiple mathematical problems easily. So in this article, we will explain the complete information on how we can find M odd numbers with the help of these subarrays in C++.In this problem, we need to find many subarrays formed with the given array and integer m where each subarray contains exactly m odd numbers. So here is the simple example of this approach −Input : array = { 6, 3, 5, 8, 9 ...
Read MoreFind the Number of Subarrays whose Minimum and Maximum are Same using C++
In this article, we will solve the problem of finding the number of subarrays whose maximum and minimum elements are the same using C++. Here is the example for the problem −Input : array = { 2, 3, 6, 6, 2, 4, 4, 4 } Output : 12 Explanation : {2}, {3}, {6}, {6}, {2}, {4}, {4}, {4}, {6, 6}, {4, 4}, {4, 4} and { 4, 4, 4 } are the subarrays which can be formed with maximum and minimum element same. Input : array = { 3, 3, 1, 5, 1, 2, 2 } Output : 9 ...
Read MoreFind the Number of subarrays having sum of the form k^m, m >= 0 using C++
In this article, we will explain everything about solving the number of subarrays having the sum of the form k^m, m >= 0 in C++. Given an array arr[] and an integer K, we need to find the number of subarrays having sum in the form of K^m where m is greater than equal to zero, or we can say we need to find the number of subarrays having sum equal to some non-negative power of K.Input: arr[] = { 2, 2, 2, 2 } K = 2 Output: 8 Sub-arrays with below indexes are valid: [1, 1], ...
Read MoreHow to solve triangular matrix equations using Python SciPy?
The linear function named scipy.linalg.solveh_triangular is used to solve the banded matrix equation. In the below given example we will be solving the triangular system ax = b where −$$\mathrm{a} = \begin{bmatrix} 3 & 0 & 0 & 0\ 2 & 1 & 0 & 0\ 1 &0 &1 &0 \ 1& 1& 1& 1 \end{bmatrix};\; \mathrm{b} =\begin{bmatrix} 1\ 2\ 1\ 2 \end{bmatrix}$$Examplefrom scipy.linalg import solve_triangular import numpy as np a = np.array([[3, 0, 0, 0], [2, 1, 0, 0], [1, 0, 1, 0], [1, 1, 1, 1]]) b = np.array([1, 2, 1, 2]) x = solve_triangular(a, b, lower=True) print (x)Outputarray([ 0.33333333, 1.33333333, 0.66666667, -0.33333333])
Read MoreWhat is Reinforcement Learning? How is it different from supervised and unsupervised learning?
In reinforcement learning methods, a trained agent interacts with a specific environment and takes actions based upon the current state of that environment.The working of reinforcement learning is as follows −First you need to prepare an agent with some specific set of strategies.Now leave the agent to observe the current state of the environment.Based on the agent's observation, select the optimal policy, and perform suitable action.Based on the action taken, the agent will get reward or penalty.Update the set of strategies used in step 1, if needed. Repeat the process from step1-4 until the agent learns and adopts the optimal ...
Read MoreWhat are the different learning styles in machine learning algorithms?
There are four learning styles in machine learning algorithms. Let’s have a look at them −Supervised LearningSupervised learning, one of the most used methods in ML, takes both training data (also called data samples) and its associated output (also called labels or responses) during the training process. The major goal of supervised learning methods is to learn the association between input training data and their labels. For this it performs multiple training data instances.Based on machine learning based tasks, we can divide supervised learning algorithms in two classes namely Classification and Regression.Unsupervised LearningUnsupervised learning methods, (opposite to supervised learning methods) ...
Read MoreFind the Number of subarrays having sum less than K using C++
In this article, we will find out the number of subarrays having a sum less than K using C++. In this problem, we have an array arr[] and an integer K. So now we have to find subarrays that have a sum less than K. Here is the example −Input : arr[] = {1, 11, 2, 3, 15} K = 10 Output : 4 {1}, {2}, {3} and {2, 3}Approach to Find SolutionNow we will use two different methods to solve the given problem −Brute ForceIn this approach, we will iterate through all the subarrays and calculate their sum and ...
Read MoreFind the Number Of Subarrays Having Sum in a Given Range in C++
In this article, we will solve the number of subarrays having sum in a given range using the C++ program. We have an array arr[] of positive integers, and a range {L, R} and we have to calculate the total number of subarrays having sum in the given range form L to R. So here is the simple example for the problem −Input : arr[] = {1, 4, 6}, L = 3, R = 8 Output : 3 The subarrays are {1, 4}, {4}, {6}. Input : arr[] = {2, 3, 5, 8}, L = 4, ...
Read More