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 Prateek Jangid
Page 11 of 17
C++ Rearrange a string in sorted order followed by the integer sum
Discuss a problem to rearrange a string of alphabets in sorted order and add all the integers present in the string, for exampleInput : str = “adv4fc3” Output : “ acdfv7” Explanation: all the letters have been sorted to “acdfv” followed by the sum of integers 4 and 3. Input: str = “ h2d7e3f ” Output: “ defh12” Explanation: all the letters have been sorted to “defh” followed by the sum of integers 2, 7, and 3.Approach to Find the SolutionWe have two tasks to perform in this problem, one is sorting the string, and the other is adding ...
Read MoreC++ Ratio of Mth and Nth Terms of an A. P. with Given Ratio of Sums
Discuss a problem where we are given a ratio of sums of m and n terms of A.P. We need to find the ratio of mth and nth terms.Input: m = 8, n = 4 Output: 2.142 Input: m = 3, n = 2 Output: 1.666 Input: m = 7, n = 3 Output: 2.6Approach to Find the SolutionTo find the ratio of mth and nth terms using code, we need to simplify the formula. Let Sm be the sum of first m terms and Sn be the sum of the first n terms of the A.P.a - ...
Read MorePython - Ranking Rows of Pandas DataFrame
To add a column that contains the ranking of each row in the provided data frame that will help us to sort a data frame and determine the rank of a particular element, for example −Our DataframeName Play Time (in hours)Rate0Call Of Duty45Better than Average1Total Overdose46Good2GTA352Best3Bully22AverageOutputName Play Time (in hours)Rate ranking0Call Of Duty45Better than Average3.01Total Overdose46Good2.02GTA352Best1.03Bully22Average4.0Now, as you can see in the above example, our rankings are the whole numbers but have a decimal beside it, so that means we can have ranking in real numbers also, and that happens when more and one element have the same rank in ...
Read MoreC++ Range Sum Queries and Update with Square Root
Given an array and several queries. Also, there are two types of query, i.e., update[ L, R ] means update elements from L to R with their square roots, and query[ L, R ] means to calculate the sum of elements from L to R.We are assuming a 1-based indexed array, for exampleInput: nums[ ] = { 0, 9, 4, 1, 5, 2, 3 }, Query[ ] = { {1, 1, 3}, {2, 1, 2}, {1, 2, 5}, { 1, 4, 5}} Output: 14 10 7 1st element of 1st query is 1 means we need to calculate range sum ...
Read MoreC++ Rat in a Maze with Multiple Steps or Jump Allowed
Given a n*n grid maze. Our rat is present in the top left corner of the grid. Now rats can only move down or forward, and if and only if the block has a non-zero value to it now in this variation rat is allowed to have multiple jumps. The maximum jump that the rat can take from the current cell is the number present in the cell, and now you are tasked to find if the rat can reach the bottom right corner of the grid, for example −Input : { { {1, 1, 1, 1}, {2, 0, 0, ...
Read MoreC++ Range Sum Query Using Sparse Table
Sparsh Table is a data structure, which is used to give results of range queries. It provides the result of most range queries in O(logN) complexity. For maximum range queries, it can also compute the result in O(1).This tutorial will discuss the problem of a range sum query using a sparse table where we are given an array. We need to find the sum of all elements in range L and R, for example.Input: arr[ ] = { 2, 4, 1, 5, 6, 3 } query(1, 3), query(0, 2), query(1, 5). Output: 10 7 19 Input: arr[ ] ...
Read MoreC++ Queries to Answer the Number of Ones and Zeros to the Left of Given Index
Discuss a problem to answer queries to the given array. For each query index, we need to find the number of ones and zeros to the left of the index, for example.Input: arr[ ] = { 0, 1, 1, 1, 0, 0, 0, 1, 0, 0}, queries[ ] = { 2, 4, 1, 0, 5 } Output: query 1: zeros = 1, ones = 1 query 2: zeros = 1, ones = 3 query 3: zeros = 1, ones = 0 query 4: zeros = 0, ones = 0 query 5: zeros = 2, ones = 3 Input: arr[ ...
Read MoreC++ Queries on XOR of Greatest Odd Divisor of the Range
Given an array of N integers and Q queries of ranges. For each query, we need to return the XOR of the greatest odd divisor of each number in the range.The greatest odd divisor is the greatest odd number which can divide number N, e.g . The greatest odd divisor of 6 is 3, for example.Input: nums[ ] = { 3, 6, 7, 10 }, query[ ] = { { 0, 2 }, { 1, 3 } } Output: query1: 7 query2: 1 Explanation: greatest odd divisors of nums array are { 3, 3, 7, 5 }. For query ...
Read MoreFind the Number of Unique Permutations Starting with 1 of a Binary String using C++
In the given problem, we are given a string consisting of 0’s and 1’s; we are required to find the total number of permutations such that the string starts with 1’s. As the answer can be a vast number, so we print as a mod with 1000000007.Input : str ="10101001001" Output : 210 Input : str ="101110011" Output : 56We will solve the given problem by applying some combinatorics and building up some formulas to solve this problem.Approach to find The SolutionIn the approach, we will calculate the number of 0's and 1's. Now let's suppose n is the ...
Read MoreFind the Number of Unique Pairs in an Array using C++
We require the appropriate knowledge to create several unique pairs in an array syntax in C++. In finding the number of unique pairs, we count all unique pairs in a given array, i.e., all possible pairs can be formed where each pair should be unique. For example −Input : array[ ] = { 5, 5, 9 } Output : 4 Explanation : The number of all unique pairs are (5, 5), (5, 9), (9, 5) and (9, 9). Input : array[ ] = { 5, 4, 3, 2, 2 } Output : 16Approach to find The SolutionThere are Two ...
Read More