Happy Codings - Programming Code Examples
Html Css Web Design Sample Codes CPlusPlus Programming Sample Codes JavaScript Programming Sample Codes C Programming Sample Codes CSharp Programming Sample Codes Java Programming Sample Codes Php Programming Sample Codes Visual Basic Programming Sample Codes


HTML & CSS Web Design

Html Css > Code Examples

Span tag text-transform uppercase lowercase capitalize





Find the Frequency of Substring in Strings - Take a string and a substring as input. Store it in the arrays 'str[] & str1[]' respectively. Using For Loop to 'compare' str1[] with the str[]. Do step2 until the end of main string. During the

C Finds a Year is Leap or not is a bit Tricky - C Program Code we generally assume that if a year number is evenly divisible by 4 is leap year. But it is not the only case. A year is a leap year if it is evenly divisible by 100. If it is

C Finds Maximum Between Two Numbers - Finding maximum in general is comparison of two numbers. In C language we compare two quantities using relational operator. We using either > or < operator to compare 2 numbers

Fisher-Yates Algorithm & Array Shufflings - Program to "shuffle array" using Fisher-Yates algorithm. This algorithm for "generating" a 'Random Permutation' of a finite set-in plain terms, for randomly shuffling the set. Variant

Find First Capital Letter in a String without - Program using iteration, finds the first capital letter that exists in a string. We have included ctype.h in order to make use of int "isupper()" C Function that's Defined inside the "ctype.h"

C Mirror Image of Right Angled Triangles - 'Pyramid program' in C Programming. Mirror image of right angled triangle. "space_count" variable is used as 'Subscript Variable' used in for loop. 'noofspaces' variable is used to keep

C Coding Check the Character is Alphabet - If the ASCII value of the character entered by the user lies in the range 97 to 122 or from 65 to 90, that number is an alphabet. 'a' is used instead of 97 and 'z' is used instead of 122. 'A'

Undirected Graph contains a Eulerian Path - Check if this graph is Eulerian or not. Check if all non-zero degree vertices are connected. If graph has no "odd degree vertex", there is at least one Eulerian Circuit. And if graph as two