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
Server Side Programming Articles
Page 1197 of 2109
Fill array with 1's using minimum iterations of filling neighbors in C++
In this problem, we are given an array arr consisting of n elements that are either 0 or 1. Our task is to fill array with 1’s using minimum iterations of filling neighbors. Let’s take an example to understand the problem, Input: arr[] = {0, 1, 1, 0, 0, 1}Output: 1Solution Approach −To solve the problem, we need to know the fact that if 1 is present in a position it can convert two neighbouring 0’s to 1.If, arr[i] is 1.Then, arr[i-1] and arr[i+1] will be converted to 1.Using this, the ...
Read MoreFind if given number is sum of first n natural numbers in C++
In this problem, we are given a number num. Our task is to find if the given number is the sum of first n natural numbers. Problem Description: Here, we need to check whether the given number is the sum of first n natural numbers.Let’s take an example to understand the problem, Input: num = 55Output: yes, 10Explanation:55 is the sum of the first 10 natural numbers, 1+2+3+4+5+6+7+8+9+10.Solution Approach: A simple approach to solving the problem is finding the sum of n natural numbers until it becomes equal to or greater than num.If the sum is equal to num, return n.If at any value of ...
Read MoreFind if k bookings possible with given arrival and departure times in C++
In this problem, we are given two arrays consisting of N values denoting arrival and departure at hotel and an integer k. Our task is to find if k bookings are possible with given arrival and departure times. Problem Description: Here, we need to check if the hotel with k rooms is able to accommodate all arrivals and departures.Let’s take an example to understand the problem, Input: Arrivals : {1 4 5 7}Departures : {3 5 6 9} K = 1Output: YesSolution approach:To solve the problem, we will store arrival and departure for ...
Read MoreFind if there is a pair in root to a leaf path with sum equals to root's data in C++
In this problem, we are given a Binary Tree. And we need to find if there is a pair in root to a leaf path with sum equals to root’s data. We need to check if there exists a pair of nodes that lies between root node to leaf nodes such that the sum of values of pairs is equal to the root node’s value.Let’s take an example to understand the problem, Input:Output: YesExplanation: Root node value 7Pairs with sum value equal to root node, (2, 5), (1, 6).Solution Approach: We need to traverse the tree and find the pairs using hashing.For this we ...
Read MoreFind index of an extra element present in one sorted array in C++
In this problem, we are given two sorted arrays arr1 and arr2 of size n and n+1 with all elements the same except the extra element. Our task is to find index of an extra element present in one sorted array. Problem Description: We need to find the index of an element from the n+1 size array which is not present in an array of size n.Let’s take an example to understand the problem, Input: arr1[n] = {3, 5, 7, 8, 9, 12} arr2[n+1] = {3, 4, 5, 7, 8, 9, ...
Read MoreFind integers that divides maximum number of elements of the array in C++
In this problem, we are given an array arr[] of n integers.Our task is to find integers that divides maximum number of elements of the array. Problem Description: We need to find a number p which can divide the maximum number of elements of the array. In case, there are more than one such element we will return the smaller one.Let’s take an example to understand the problem, Input: arr[] = {4, 5, 6, 7, 8}Output: 2Explanation: The element 2 divides {4, 6, 8}.Solution ApproachA simple solution to the problem is by looping through the array and then for each element of the array, divide each ...
Read MoreFind largest sum of digits in all divisors of n in C++
In this problem, we are given an integer n. Our task is to find the largest sum of digits in all divisors of n. Problem Description: Here, we will find the divisor of the number n whose sum of digits in largest.Let’s take an example to understand the problem, Input: 18Output: 9Explanation: All divisors of 18 are 1, 2, 3, 6, 9, 18.The maximum digits sum is 9.Solution ApproachFind all divisors of the number N. And then find the sum of digits of each divisors and then return the value with the largest sum.Program to illustrate the working of our solution, Example#include using namespace ...
Read MoreHow to create a random sample of months in R?
Random samples can be created by using sample function and months in a year can be generated with the help of month.name function. Therefore, if we want to create a random sample of months then month.name can be used with sample function as sample(month.name) and if the size of the sample is larger than 12 then replace=TRUE argument should be used.Examplesx1
Read MoreHow to convert 12-hour time scale to 24-hour time in R?
Dealing with time data is not an easy task, it is sometimes difficult even in built-in analytical softwares, thus it won’t be easy in R as well. Mostly, we record time on a 12-hour time scale but in some situations, we need 24-hour time scale. Therefore, if we want to convert 12-hour time scale to 24-hour time scale then format function can be used with as.POSIXct. Look at the below examples, to understand it better.Example1Time1
Read MoreHow to find the position of minimum value in a vector that contains integers as strings in R?
If integer vector is read as strings and we want to find the position of the minimum value in that vector then we need to use as.numeric along with the vector to read it as a numeric vector then use which function for finding the position of the minimum value. For example, if we have a vector x that contains first ten integers as strings then to find the position of the minimum we can use which(as.numeric(x)==min(as.numeric(x))).Example1x1
Read More