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 1399 of 2109
Find alphabet in a Matrix which has maximum number of stars around it in C++
Suppose we have a matrix M. This is filled with stars and letters. We have to find which letter has maximum number of stars around it. So if the matrix is like below −Here A and C has 7 stars around it. this is maximum. As A is lexicographically smaller, so it will be the output.The approach is simple, we will count the characters, then when one character has found, then count the stars around it. Also store the value inside a map. From the map where the size is maximum that will be printed.Example#include #include #define MAX 4 ...
Read MoreFind duplicate rows in a binary matrix in C++
Suppose we a binary matrix. Here we will see how to find the duplicate rows in that matrix. Suppose the matrix is like −110101001001101100110101001001001001There are duplicate rows at position 3, 4, 5.To solve this, we will use the Trie. The Trie is an efficient data structure used for strong and retrieval of data where character set is small. The search complexity is optimal as the key length. So at first we will insert the binary trie. If the newly added row is already present, then that is duplicate.Example#include using namespace std; const int MAX = 100; class Trie { ...
Read MorePrint direction of moves such that you stay within the [-k, +k] boundary in C++
In this problem, we have to find a valid way to move positive direction or negative direction in such a way that we stay within a certain limit that is provided by the user.Here, We are given a certain maximum limit K, which is the maximum value to which we can move and an array of n positive values to move. We have to return the sequence i.e. positive or negative directions to move so that it never crosses K value.Let’s take an example to understand the topic better, Input : K = 56 and the array is [25 , ...
Read MorePrint an N x M matrix such that each row and column has all the vowels in it in C++
In this problem, we have to create a 2D matrix of size n X m. And in this matrix, we have to place only vowels in such a way that each row and column has all vowels in it.All vowels mean all a, e, i, o, u are present in each row and each column of the matrix. This makes the minimum number of rows and columns required is 5 i.e. the smallest matrix is of the size 5X5.Let’s take an example to understand the topic betterExample 1 −Input : N = 5 and M = 5. Output : a ...
Read MorePrint digit's position to be removed to make a number divisible by 6 in C++
In this problem, we are given number and we have to remove more digit from the number. So that the new number formed after removal is divisible by 6.Let’s take an example to learn the concept better −Input : 1324 Output : 4Explanation − on removing the 4th number we will get 132 which is divisible by 6.Here, we are given a number and we have to return the position from where the number is removed to make it divisible by 6.For solving this problem, we will try to create a logic that solves the problem. For this, we will ...
Read MorePrint alternate nodes of a linked list using recursion in C++
A linked list is a linear data structure that stores the element in non-contiguous memory locations. Every element contains a pointer to the next element of the linked list.Example −In this problem, we are given a linked list and we need to print the elements of this linked list but only alternate elements are to be printed. Let’s take an example to understand the problem better, Input : 2 -> 4 -> 1 -> 67 -> 48 -> 90 Output : 2 -> 1 -> 48Explanation − We will print alternate elements on the linked list. So first, third and ...
Read MorePrint concentric rectangular pattern in a 2d matrix in C++
In this problem, we have to print a rectangular pattern in a 2D matrix in such a way that they are concentric to each other.Let’s take an example to understand this problem better, For n=4 is : 4 4 4 4 4 4 4 4 3 3 3 3 3 4 4 3 2 2 2 3 4 4 3 2 1 2 3 4 4 3 2 2 2 3 4 4 3 3 3 3 3 4 4 4 4 4 4 4 4Here, we have to print the pattern as ...
Read MorePrint Concatenation of Zig-Zag String in n Rows in C++
In this problem, we are given a string that is a sequence of characters. And we are given the length of the zig-zag pattern and we have to print the concatenation string of this zig-zag string in n rows.Let’s see a few examples to understand the concept better, EXAMPLEInput : string = ‘STUVWXYZ’ n = 2. Output : SUWYTVXZExplanation − the zig-zag pattern for the string for a 2-row pattern is −S U W Y T V X ZThe concatenation of this zig-zag pattern is - SUWYTVXZ.ExampleInput : string = ABCDEFGH n = ...
Read MoreFind intersection point of lines inside a section in C++
Suppose we have set of lines in the form y = mx + c. There are sections made by this line and the vertical section. We have to find the intersection point present in the given section or not. Suppose the lines are like −L1 = y = x + 2L2 = y = -x + 7L3 = y = -3L4 = y = 2x - 7And the vertical section is given from x = 2 to x = 4.Here intersection points of L1 and L2 are present inside this section, so the answer will be true.To solve this problem, ...
Read MoreFind Maximum dot product of two arrays with insertion of 0's in C++
Suppose we have two arrays of positive integers of size m and n. The m > n. We have to maximize the dot product by inserting zeros in the second array. One thing we have to keep in mind that we will not change the ordering of the elements in the given arrays. Suppose the arrays are A = [2, 3, 1, 7, 8], and another array B = [3, 6, 7]. The output will be 107. We can maximize the dot product after inserting 0s at first and third position of the second array. So the product will be ...
Read More