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 1330 of 2109
Intersection of Two Arrays in C++
Suppose we have two arrays; we have to find their intersections.So, if the input is like [1, 5, 3, 6, 9], [2, 8, 9, 6, 7], then the output will be [9, 6]To solve this, we will follow these steps −Define two maps mp1, mp2Define an array resfor x in nums1(increase mp1[x] by 1)for x in nums2(increase mp2[x] by 1)for each key-value pair x in mp1cnt := 0cnt := minimum of value of x and mp2[key of x]if cnt > 0, then −insert key of x at the end of resreturn resExample Let us see the following implementation to get a ...
Read MoreTiling a Rectangle with the Fewest Squares in C++
Suppose we have a rectangle of size n x m. We have to find the minimum number of integers sided square objects that can tile the rectangles.So, if the input is like n = 2 and m = 3,then the output will be 3, as we need three blocks.To solve this, we will follow these steps −Define one map mres := infDefine a function dfs(), this will take n, m, an array h, cnt,if cnt >= res, then −returnisFull := truepos := -1, minH := inffor initialize i := 1, when i
Read MoreGuess Number Higher or Lower in C++
Suppose we are playing the Guess Game. The properties of this game is as follows −Player 1 will pick a number from 1 to n. player2 have to guess which number I picked. Every time player2 guess wrong, player1 will tell player2 whether the number is higher or lower.We can use the function guess(num) which will return 3 possible results as follows −-1 − Player1's number is lower1 − Player1's number is higher0 − Number is matchedSo, if the input is like n = 10, pick = 5, then the output will be 5.To solve this, we will follow these ...
Read MoreFind the Difference in C++
Suppose we have two strings s and t which consist of only lowercase letters. Now, string t is generated by random shuffling string s and then add one more letter at a random index. We have to find the letter that was added in t.So, if the input is like "mnopq", "pqmnot", then the output will be "t", this is the extra letter.To solve this, we will follow these steps −sSum := 0, tSum := 0for initialize i := 0, when i < call length() of s, update (increase i by 1), do −sSum := sSum + s[i]for initialize j ...
Read MoreConvert a Number to Hexadecimal in C++
Suppose we have an integer; we have to devise an algorithm to convert it to hexadecimal. For negative numbers we will use the two’s complement method.So, if the input is like 254 and -12, then the output will be fe and fffffff4 respectively.To solve this, we will follow these steps −if num1 is same as 0, then −return "0"num := num1s := blank stringwhile num is non-zero, do −temp := num mod 16if temp
Read MoreLongest Palindrome in C++
Suppose we have a string which consists of lowercase or uppercase letters, we have to find the length of the longest palindromes that can be built with those letters. Now the string is case sensitive, so "Aa" is not considered a palindrome here.So, if the input is like "abccccdd", then the output will be 7, as one longest palindrome that can be built is "dccaccd", whose length is 7.To solve this, we will follow these steps −Define one map mpfor each character i in s(increase mp[i] by 1)ma := 0, c := 0, ans := 0for each key-value pair i ...
Read MoreThird Maximum Number in C++
Suppose we have a non-empty array of integers; we have to find the third maximum number in this array. If there is no 3rd max number, then return the maximum one. The challenge is, we have to solve this using linear time complexity.So, if the input is like [5, 3, 8, 9, 1, 4, 6, 2], then the output will be 6.To solve this, we will follow these steps −initialize a, b, c with NULLfor initialize i := 0, when i < size of nums, update (increase i by 1), do −if a is null or nums[i] >= value of ...
Read MoreNumber of Segments in a String in C++
Suppose we have a string s. We have to count the number of segments in a string, where a segment is defined to be a contiguous sequence of characters (no whitespace).So, if the input is like "Hello, I love programming", then the output will be 4, as there are 4 segments.To solve this, we will follow these steps −n := 0for initialize i := 0, when i < size of s, update (increase i by 1), do −if s[i] is not equal to white space, then −(increase n by 1)while (i < size of s and s[i] is not equal ...
Read MoreMinimum Moves to Equal Array Elements in C++
Suppose we have an array of size n, we have to find the minimum number of moves required to make all array elements the same, where a move means incrementing n - 1 elements by 1.So, if the input is like [3, 2, 3, 4], then the output will be 4.To solve this, we will follow these steps −n := size of numsif n is same as 0, then −return 0sort the array numsans := 0for initialize i := 0, when i < n, update (increase i by 1), do −ans := ans + nums[i] - nums[0]return ansExample Let us see ...
Read MoreConstruct the Rectangle in C++
Suppose we have a specific rectangular web page area, our job is to design a rectangular web page, whose length L and width W that satisfies the following requirements −The area of the web page must equal to the given target area.The width W should not be larger than the length L, and L >= W.The difference between L and W should be as small as possible.So, if the input is like 4, then the output will be [2, 2], as the target area is 4, and all the possible ways to construct it are [1, 4], [2, 2], [4, ...
Read More