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
Articles on Trending Technologies
Technical articles with clear explanations and examples
Set a fixed element and scroll another - jQuery
Let’s say the following is our fixed element div − Fixed The CSS style to fix the above element −.fixedElement { position: fixed; background-color: skyblue; top: 0; left: 0; right: 0; }Following is our element, which will be scrolled − David Miller Now, use the window.scrollTo().ExampleLet us see the complete code − Document .fixedElement { position: fixed; background-color: skyblue; top: 0; left: 0; right: 0; ...
Read MoreSimplified Fractions in C++
Suppose we have an integer n, we have to find a list of all simplified fractions between 0 and 1 (exclusive) such that the denominator
Read MoreCount Good Nodes in Binary Tree in C++
Suppose we have a binary tree, a node X in the tree is named good when in the path from root to X there are no nodes whose value is greater than X. Here we have to find the number of good nodes in the binary tree.So, if the input is like, then the output will be 4, the colored nodes are good node.To solve this, we will follow these steps −Define a function dfs(), this will take node, val, if node is null, then −returnret := ret + (1 when val left){ if(val != NULL) ...
Read MoreRearrange Words in a Sentence in C++
Suppose we have a string with different words, that string is called sentence, and this is in the following format −First letter is in upper case.Each word in text are separated by a single space character.We have to rearrange the words in text such that all words are rearranged in increasing order of their lengths. If two words have the same length, arrange them in their original order.Then finally return the string by applying these rules.So, if the input is like "I love to code in cpp", then the output will be "I to in cpp love code"To solve this, ...
Read MorePeople Whose List of Favorite Companies Is Not a Subset of Another List in C++
Suppose we have an array called favorite companies where favoriteCompanies[i] is the list of favorites companies of the ith person. We have to find the indices of people whose list of favorite companies is not a subset of any other list of favorites companies.So, if the input is like favoriteCompanies = [["TCS", "google", "facebook"], ["google", "microsoft"], ["google", "facebook"], ["google"], ["amazon"]], then the output will be [0, 1, 4], this is because person with index=2 has ["google", "facebook"] which is a subset of favoriteCompanies[0]= ["TCS", "google", "facebook"] corresponding to the person with index 0.Now person with index=3 has ["google"] which is ...
Read MoreMaximum Number of Vowels in a Substring of Given Length in C++
Suppose we have a string s and an integer k. We have to find the maximum number of vowel letters in any substring of s with length k.So, if the input is like s = "abciiidef", k = 3, then the output will be 3To solve this, we will follow these steps −cnt := 0Define one set mfor each vowel v, doinsert v into mret := 0for initialize i := 0, when i < k, update (increase i by 1), do −cnt := cnt + (1 when s[i] is in m, otherwise 0)ret := maximum of ret and cntn := ...
Read MoreHow to find the absolute distance between columns of an R data frame?
The absolute distance can be found by calculating the difference between column values. And if we want the distance to be absolute then we would be need to use abs function. For example, suppose we have a data frame df that contain columns x and y then the absolute distance can be found by using df$Absolute_Distance set.seed(274) > x1 y1 df1 df1Output x1 y1 1 6 11 2 1 4 3 4 2 4 7 12 5 4 5 6 6 10 7 6 14 8 6 8 9 2 11 10 3 8 11 3 8 12 2 6 ...
Read MorePseudo-Palindromic Paths in a Binary Tree in C++
Suppose we have a binary tree where node values are digits from 1 to 9. One path in the binary tree is said to be pseudo-palindromic when at least one permutation of the node values in the path is a palindrome. We have to find the number of pseudo-palindromic paths going from the root node to leaf nodes.So, if the input is likethen the output will be 2, this is because there are three paths going from the root node to leaf nodes − red path follows [2, 3, 3], the green path follows [2, 1, 1], and the path ...
Read MoreHow to find the mean of very small numbers in numeric form that are represented with scientific notation in R?
If we find the mean of scientific numbers then the result will be also in scientific notation. We can get rid of this problem by using options(scipen=999), once we will use this code in R console all the inputs that are in scientific notation will be converted to normal numeric form, including any calculation and if we want to go back to the scientific notation then options(scipen=0) can be used.Example> x1 mean(x1)Output[1] 4.436267e-22Example> options(scipen=999) > mean(x1)Output[1] 0.0000000000000000000004436267Example> x2 x2Output[1] 0.000000000000000000000000000000000000001010964 [2] 0.000000000000000000000000000068291679999999998 [3] 0.000000000000000000000000006026013000000000181 [4] 0.000000000000000000000000002702241000000000107 [5] 0.000000000000000000000042258669999999998179163 [6] 0.000000000000000000000000000000091949710000000 [7] 0.000000000000000000000000000000000000107406400 [8] 0.000000000000000000000000000000091949710000000 [9] 0.000000000000000000000003463124999999999951636 [10] 0.000000000000000000004305051000000000103323794 [11] 0.000000000000000000000001542657000000000059366 ...
Read MoreCourse Schedule IV in C++
Suppose there are a total of n courses we can to take, the courses are labeled from 0 to n-1.Some courses may have direct prerequisites, as example, to take course 0 we have first to take course 1, which is expressed as a pair: [1, 0].So, if we have a number of courses n, a list of direct prerequisite pairs and a list of queries pairs.You should find the answer for each queries[i] whether the course queries[i][0] is a prerequisite of the course queries[i][1] or not. Finally, we have to return a list of boolean, the answers to the given ...
Read More