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 Arnab Chakraborty
Page 254 of 377
C++ code to find out if everyone will get ice cream
Suppose, there are three groups of people coming to a party. The first group of people likes butterscotch ice cream and do not like any other flavors of ice cream, the second group of people only dislikes strawberry ice cream and like every other flavor, and the third group likes all kinds of ice cream. Now, there are x people of the first group, y people of the second group, and z people of the third group are coming to a party, and everyone should have at least one icecream of their liking. The party organizers have brought a packs ...
Read MoreC++ code to find out if a grid is fully accessible
Suppose, we are given a grid that has 2 rows and n columns. A robot is at position (0, 0) in the grid and wants to visit (1, n - 1) by visiting adjacent and corner cells to its current location. We are given the grid in an array of strings, a cell is blocked if it is marked '#' and it is accessible if it is marked '.'. We have to find out if the robot can visit cell (1, n - 1) from the cell (0, 0).So, if the input is like n = 4, grid = {".##.", ...
Read MoreC++ code to find total elements in a matrix
Suppose, we are given a matrix of n rows and m columns. We have to find out the number of elements present in it. We find out the value and display it as output.So, if the input is like n = 20, m = 15, then the output will be 300.StepsTo solve this, we will follow these steps −return n * mExampleLet us see the following implementation to get better understanding −#include using namespace std; #define N 100 int solve(int n, int m) { return n * m; } int main() { int n = 20, m = 15; cout
Read MoreC++ code to count maximum hay-bales on first pile
Suppose we have an array A with n elements and another value d. A farmer has arranged n haybale piles on the firm. The ith pile contains A[i] hay-bales. Every day a cow can choose to move one hay-bale in any pile to an adjacent pile. The cow can do this on a day otherwise do nothing. The cow wants to maximize the hay-bales in first pile in d days. We have to count the maximum number of hay-bales on the first pile.So, if the input is like d = 5; A = [1, 0, 3, 2], then the output ...
Read MoreC++ code to find name with O's on Fibonacci positions
Suppose we have a number n. Amal wants to give a name to his pet. He will follow an algorithm. The name will be n characters long. The name will contain uppercase and lowercase letters 'O's and 'o's. The algorithm suggests the i-th letter of the name should be 'O' (uppercase) if i is a member of Fibonacci sequence, and 'o' (lowercase) otherwise. The letters in the name are numbered from 1 to n.So, if the input is like n = 10, then the output will be "OOOoOooOoo", because first fibonacci numbers are 1, 2, 3, 5 and so on.StepsTo ...
Read MoreC++ code to find position of students after coding contest
Suppose we have an array A with n elements. In a coding contest, in total n students will participate, and before the start, every one of them has some positive rating (integer). A[i] represents the rating of ith student. After the contest ends, every student will end up with some positive integer position. We are expecting the students will take places according to their ratings. If student A has rating strictly lower than student B, A will get strictly greater position than B. We have to find the position at the end of the contest.So, if the input is like ...
Read MoreC++ code to find tree height after n days
Suppose we have an array A with n elements. A has elements either 0 or 1. There is a tree. In consecutive n days, if A[i] is 0 it is not watered, if it is 1 then it is watered, the flower grows in the following manner −If the tree is not watered for consecutive two days, it diesIf the tree is watered on ith day, it grows 1 cmIf the tree is watered on ith and (i+1)th day consecutively, it grows 5 cm instead of 1 cm.If it is not watered on ith day, it will not grow.At the ...
Read MoreC++ code to find minimum different digits to represent n
Suppose we have a number n. We want to split it into some non-zero digits whose sum is n. We want to find a solution with minimum possible number of different digits.So, if the input is like n = 13, then the output will be [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]StepsTo solve this, we will follow these steps −for initialize i := 0, when i < n, update (increase i by 1), do: print 1ExampleLet us see the following implementation to get better understanding −#include using namespace std; void solve(int n){ for (int i = 0; i < n; i++) printf("1, "); } int main(){ int n = 13; solve(n); }Input13Output1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
Read MoreC++ code to check all bulbs can be turned on or not
Suppose we have a number m and a nested list A with n sub-lists. Consider there are m bulbs, initially all are turned off. There are n buttons and each of them is connected to some set of bulbs. So A[i] is the set of bulbs that can be turned on by pressing ith switch. We have to check whether we can lit up all the bulbs or not.So, if the input is like A = [[1, 4], [1, 3, 1], [2]]; m = 4, then the output will be True, because by pressing all switches we can turn on ...
Read MoreC++ code to count order collected when client calls
Suppose we have three numbers n, m and z. An office receives calls in every n minutes, and some deliveries come to office in every m minutes. Office is open for z minutes. We have to count the minimum number of orders are collected so there are no pending orders when client calls. Consider taking orders and talking with clients take exactly 1 minutes.So, if the input is like n = 1; m = 2; z = 5, then the output will be 2, because we need to collect orders which comes in second and fourth minutes.StepsTo solve this, we ...
Read More