Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
The HTML DOM Ul Object in HTML represents the element.Creating a elementvar ulObject = document.createElement(“UL”)Here, “ulObject” can have the following properties but are not supported in HTML5 −PropertyDescriptioncompactItsets/returns whether the unordered list should be displayedsmaller than usualtypeItsets/returns the value of the type attribute of an unordered listLet us see an example of unordered list element −Example Live Demo Ul item() form { width:70%; margin: 0 auto; text-align: center; } * { padding: 2px; margin:5px; } input[type="button"] ... Read More
Suppose we have a string; we have to find the first character that is repeated. So is the string is “Hello Friends”, the first repeated character will be l. As there are two l’s one after another.To solve this, we will use the hashing technique. Create one hash table, scan each character one by one, if the character is not present, then insert into a hash table, if it is already present, then return that character.Example Live Demo#include #include using namespace std; char getFirstRepeatingChar(string &s) { unordered_set hash; for (int i=0; i
In this section, we will see how to find factorial of a number using the PL/SQL. In PL/SQL code, some group of commands is arranged within a block of the related declaration of statements.Factorial of a number is basically multiplication of all integers from 1 to n, where n is the given number. So n! = n * (n – 1) * (n – 2) * … * 2 * 1.Example (PL/SQL) Live DemoDECLARE fact number :=1; n number := &1; BEGIN while n > 0 loop fact:=n*fact; n:=n-1; end loop; dbms_output.put_line(fact); END;OutputConsider 5 has given 120
In this section, we will see how we can get the sum of all odd prime factors of a number in an efficient way. There is a number say n = 1092, we have to get all factors of this. The prime factors of 1092 are 2, 2, 3, 7, 13. The sum of all odd factors is 3+7+13 = 23. To solve this problem, we have to follow this rule −When the number is divisible by 2, ignore that factor, and divide the number by 2 repeatedly.Now the number must be odd. Now starting from 3 to square root ... Read More
The HTML DOM Underline Object in HTML represents the element.Creating a elementvar uObject = document.createElement(“U”)Let us see an example of Underline element −Example Live Demo HTML DOM Underline form { width:70%; margin: 0 auto; text-align: center; } * { padding: 2px; margin:5px; } input[type="button"] { border-radius: 10px; } HTML-DOM-Underline Warning: This is a Demo Example var uObject = document.getElementById("Underline"); function getBetterDisp() { uObject.style.backgroundColor = '#DC3545'; uObject.style.color = '#FFF'; } OutputBefore clicking show button −After clicking show button −
In this section, we will see how we can get the sum of all even prime factors of a number in an efficient way. There is a number say n = 480, we have to get all factors of this. The prime factors of 480 are 2, 2, 2, 2, 2, 3, 5. The sum of all even factors is 2+2+2+2+2 = 10. To solve this problem, we have to follow this rule −When the number is divisible by 2, add them into the sum, and divide the number by 2 repeatedly.Now the number must be odd. So we will ... Read More
This program is used to find all the even factors and calculate the sum of these even factors and display it as output.Example −Input : 30 Even dividers : 2+6+10+30 = 48 Output : 48For this, we will find all the factors. Find the even of them and find the sum, Else, we will use the formula to find the sum of factors using the prime factors, Sum of divisors = (1 + d11 + d12 ... d1a1) *(1 + d21 + d22 ... d2a2) *...........................* (1 + dk1 + dk2 ... dkak) Here di = prime factors ; ai ... Read More
The HTML DOM UiEvent Object represents an event which incurs on user’s interaction with HTML elements.Here, “UiEvent” can have the following properties and methods −Property/MethodDescriptiondetailItreturns a number with details about the eventviewItreturns a reference to the Window object where the event occurredLet us see an example of Event detail property −Example Live Demo HTML DOM UiEvent detail form { width:70%; margin: 0 auto; text-align: center; } * { padding: 2px; margin:5px; } input[type="button"] { border-radius: ... Read More
Let us consider we have an array of integers, that array is encrypted array, Suppose the array is A = [10, 14, 12, 13, 11], the original array is B = [5, 1, 3, 2, 4], we can see that each element at index I of A follows this rule: A[i] = sum of all elements at position j in B[j], where I ≠ j. Our task is to find an original array from the encrypted one.The task is based on arithmetic observation. Suppose the array is of size 4, original array B has four elements B = [a, b, ... Read More
Suppose we have two strings S and T, the length of S is n, and the length of T is n + 1. The T will hold all characters that are present in S, but it will hold one extra character. Our task is to find the extra character using some efficient approach.To solve this problem, we will take one empty hash table, and insert all characters of the second string, then remove each character from the first string, the remaining character is an extra character.Example Live Demo#include #include using namespace std; char getExtraCharacter(string S, string T) { unordered_map char_map; ... Read More