The direction property is used to set the text direction. Possible values are ltr or rtl.ExampleYou can try to run the following code to set the text direction with CSS: This text will be renedered from right to left
The word-spacing property is used to add or subtract space between the words of a sentence. Possible values are normal or a number specifying space. ExampleYou can try to run the following code to implement word-spacing property. Asia is a continent.
The text-align property is used to align the text of a document. Possible values are left, right, center, justify.ExampleYou can try to run the following code to align text: Asia is a continent. Asia is a continent.
The text-indent property is used to indent the text of a paragraph. Possible values are % or a number specifying indent space.ExampleYou can try to run the following code to implement a text-indent property in CSS: This text will have first line indented by 2cm and this line will remain at its actual position this is done by CSS text-indent property.
To add or subtract space between the letters that make up a word, use the letter-spacing property.ExampleYou can try to run the following code to implement letter-spacing property: Asia is a continent.
You can find it in %SystemRoot%\system32\drivers\etc where %SystemRoot% is generally your C:\ drive.To modify this file, you can right-click and open this file in Edit mode in Notepad. To perform this you should have Administrator rights in the system.
Problem statementGiven two sorted arrays such the arrays may have some common elements. Find the sum of the maximum sum path to reach from beginning of any array to end of any of the two arrays. We can switch from one array to another array only at common elements. Note that the common elements do not have to be at same indexes.Expected time complexity is O(m+n) where m is the number of elements in arr1[] and n is the number of elements in arrs2[]ExampleIf given input is then output is 35 arr1[] = {2, 3, 7, 10, 12} ar2[] = ... Read More
Problem statementConsider a n*n matrix. Suppose each cell in the matrix has a value assigned. We can go from each cell in row i to a diagonally higher cell in row i+1 only [i.e from cell(i, j) to cell(i+1, j-1) and cell(i+1, j+1) only]. Find the path from the top row to the bottom row following the aforementioned condition such that the maximum sum is obtainedExampleIf given input is: { {5, 6, 1, 17}, {-2, 10, 8, -1}, { 3, -7, -9, 4}, {12, -4, 2, 2} }the maximum sum is (17 + 8 + 4 ... Read More
Problem statementGiven a right triangle of numbers, find the largest of the sum of numbers that appear on the paths starting from the top towards the base, so that on each path the next number is located directly below or below-and-one-place-to-the-rightExampleIf given input is: 3 4 5 1 10 7 Then maximum sum is 18 as (3 + 5 + 10).AlgorithmThe idea is to find largest sum ending at every cell of last row and return maximum of these sums.We can recursively compute these sums by recursively considering above two cellsSince there are overlapping sub-problems, we use dynamic programming to ... Read More
Problem statementGiven an array of N numbers, the task is to find the maximum sum that can be obtained by adding numbers with the same number of set bitsExampleIf input array is {2, 5, 8, 9, 10, 7} then output would be 14 −Number of set bits in 2 is 1Number of set bits in 5 is 2Number of set bits in 8 is 1Number of set bits in 9 is 2Number of set bits in 10 is 2Number of set bits in 7 is 3Then sum of (5 + 9 + 10) is 24 whose number of set bits ... Read More
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP