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 sudhir sharma
Page 22 of 98
Program to calculate Bitonicity of an Array
The bitonicity of an array is a measure that indicates how much the array deviates from a monotonic sequence. It starts at 0 and increases by 1 when an element is greater than the previous one, decreases by 1 when smaller, and remains unchanged when equal. Syntax int calculateBitonicity(int arr[], int n); Algorithm The bitonicity calculation follows this logic − Bitonicity = 0 (initially) For i from 1 to n-1: if arr[i] > arr[i-1]: Bitonicity = Bitonicity + 1 if arr[i] < arr[i-1]: Bitonicity ...
Read MoreProgram to build DFA that starts and ends with 'a' from the input (a, b)
DFA stands for Deterministic Finite Automata. It is a finite state machine that accepts or rejects a string based on its transition rules and final states. Here, we are going to make a DFA that accepts a string that starts and ends with 'a'. The input alphabet is from the set {a, b}. Let's discuss some valid and invalid cases that are accepted by this DFA. Strings accepted by DFA: "ababba", "aabba", "aa", "a" Strings not accepted by DFA: "ab", "b", "aabab" Syntax // Check if string starts and ends with 'a' if (str[0] ...
Read MorePerforming DataBase Operations in XAMPP
Navigating through database operations in XAMPP can be challenging, particularly for beginners. Realizing this complexity, over 15 million active monthly users have turned to XAMPP for its ease of use and flexibility. This article offers a step−by−step guide on performing basic database operations in XAMPP, from data insertion to deletion. Let's take the first stride towards mastering your XAMPP database management skills together! Basic Database Operations in XAMPP Basic Database Operations in XAMPP include performing CRUD operations such as select, insert, update, and delete statements on a MySQL database using PHP. ...
Read MoreMaximum Sum Increasing Subsequence using DP in C++ program
In this problem, we are given an array arr[] of size n. Our task is to create a program to find the maximum Sum Increasing Subsequence using DP in C++.Problem Description − To find the maximum sum increasing subsequence, we will be creating a subsequence in which the next element is greater than the current element.Let’s take an example to understand the problem, Inputarr[] = {4, 2, 3, 6, 5, 9}Output20ExplanationIncreasing subsequence with maximum sum: {2, 3, 6, 9} = 2 + 3 + 6 + 9 = 20Solution ApproachTo solve the problem using a dynamic Program Approach. We will ...
Read MoreFind number of subarrays with even sum in C++
In this problem, we are given an array arr[] consisting of N elements. Our task is to find the subarray with even sum.Let’s take an example to understand the problem,Inputarr[] = {2, 1, 3, 4, 2, 5}Output28ExplanationThe subarrays are −{2}, {4}, {2}, {2, 4}, {2, 2}, {1, 3}, {1, 5}, {3, 5}, {4, 2}, {2, 1, 3}, {2, 1, 5}, {2, 3, 5}, {2, 4, 2}, {1, 3, 4}, {1, 3, 2}, {1, 4, 5}, {1, 2, 5}, {3, 4, 5}, {3, 2, 5}, {2, 1, 3, 4}, {2, 1, 3, 2}, {2, 3, 4, 5}, {2, 3, 2, 5}, {2, 4, 2, 5}, {1, 3, 4, 2}, {1, 4, 2, 5}, {3, 4, 2, 5}, {2, 1, 3, 4, 2}, {2, 1, 3, 4, 2, 5}Solution ApproachA simple solution to the problem is using the direct method which is by calculating all subarray and their sums. And the increase count for the subarray with even sum. And at last return count.Program to illustrate the working of our solution,Example#include using namespace std; int countEvenSumSubArray(int arr[], int n){ int evenSumCount = 0, sum = 0; for (int i=0; i
Read MoreFind maximum possible stolen value from houses in C++
In this problem, we are given n houses with some values in them. Our task is to Find the maximum possible stolen value from houses.Problem Description − We have an array houses[] that consist of the values that are in each house. A thief robs the houses but he cannot steal from two adjacent houses as neighbours know about the theft. We need to find the maximum possible value that can be stolen by the thief from the house without getting caught.Let’s take an example to understand the problem, Inputhouses[] = {5, 2, 1, 6, 7, 9, 4, 3}Output23ExplanationThe max ...
Read MoreFind maximum value of Sum( i*arr[i]) with only rotations on given array allowed in C++
In this problem, we are given an array arr[] consisting of n elements. We need to Find maximum value of Sum( i*arr[i]) with only rotations on a given array allowed. For find the maximum sum of (i*arr[i]), we can perform any number of rotations.Let’s take an example to understand the problem, Inputarr[] = {4, 1, 3, 7, 2}Output43ExplanationWe will rotate the array once to get the maximum value, After rotation array will be {2, 4, 1, 3, 7}Sum = 0*2 + 1*4 + 2*1 + 3*3 + 4*7 = 0 + 4 + 2 + 9 + 28 = 43Solution ...
Read MoreFind maximum XOR of given integer in a stream of integers in C++
In this problem, we are given Q queries each of which is one of the following type, Type 1 − insertion (1, i) to add the element with value i, in your data structure.Type 2 − findXOR (2, i), to find the XOR of all elements of the data structure with the element i.The data structure should contain only 1 element initially which will be 0.Let’s take an example to understand the problem, InputQueries: (1, 9), (1, 3), (1, 7), (2, 8), (1, 5), (2, 12)Output15 15ExplanationSolving each query, (1, 9) => data structure => {9} (1, 3) => data ...
Read MoreFind Maximum XOR value of a sub-array of size k in C++
In this problem, we are given an array arr[] consisting of n elements and an integer k. Our task is to find the Maximum XOR value of a sub-array of size k.Let’s take an example to understand the problem, Inputarr[] = {3, 1, 6, 2 ,7, 9} k = 3Output12ExplanationAll subarray and the xor of all element of size k, {3, 1, 6} = 4 {1, 6, 2} = 5 {6, 2, 7} = 3 {2, 7, 9} = 12Solution ApproachA simple solution to the problem is by using two loops. One to iterate over the array and other to ...
Read MoreWrite a Program to Find the Maximum Depth or Height of a Tree in C++
In this problem, we are given a binary tree. Our task is to write a program to find the maximum depth or height of the given tree.Let’s take an example to understand the problem, The height of the tree is 3.To find the maximum height of a tree, we will check the heights of its left and right subtree and add one to the maximum of both. This is a recursive process that will continue this the last node is of the tree is found and one is added progressively to find the height of the sub-trees.Above example solved using ...
Read More