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

Add no repeat icon to title text

Read and write Strings Printf() and Scanf() - Compare 2 strings, 'Concatenate Strings' and copy one string to another & perform various 'string manipulation operations'. We perform such operations using 'pre-defined' functions

Structure is A Compound Data Type that - To store Student details like student 'name', student 'roll num', 'student age'. You have 2 ways to do it, one way is to create different variables for each data, but the downfall of

C Display the Characters in Prime Position - Take a string as input and store it in the array str[]. "Store the Length" of the input string in the variable 'k'. Use "two Loops" to divide the numbers "upto the value" of k. Increment the

C Coding Replace Lowercase to Uppercase - Accepts the sentence and replaces lowercase characters by uppercase and vice-versa. Take an an English sentence as input and store it in the array "sentence[]". Copy the Last Letter's

Count Number of Words in the given Text - Program takes a string as input and count the number of words in the input string. Take the string as input, store it in the array 's[]'. Using for loop search for a space ' ' in the string and

Implement Hash Tables by Linear Probing - Insert Element at a key. Search Element at a key. Remove Element at a key. Enter element to be inserted. Enter key at which element to be inserted. And Enter key of the element to

C Language program Print Pascal Triangle - C program print pascal triangle up to n rows. Pascal triangle is a triangular number pattern named after famous mathematician Pascal. Where n is row number and k is term of that

Find Maximum Numbers of Edge Disjoint - C++ program displays the maximum number of edge disjoint paths present between two vertices. 'Maximum number' of edge disjoint paths refers to the maximum flow or shortest