This repository contains a collection of C programs designed to tackle various string manipulation challenges. The programs use a combination of algorithms, including recursion, to solve problems involving substrings, character manipulation, and other string operations.
Counts the number of occurrences of the substring "hi" in a given string.
Counts the number of vowels in a given string.
Checks if two given strings are anagrams of each other.
Checks if a given string is a pangram (contains every letter of the alphabet at least once).
Calculates the length of a string using pointers.
Sorts a list of strings in lexicographical order.
Removes all occurrences of the character 'x' from a given string.
Removes leading zeros from a given string representing a number.
Replaces all occurrences of the substring "xy" with another string in the given string.
Replaces all occurrences of the substring "pi" with "3.14" in a given string.
Reverses a given string and checks if it is a palindrome.
Extracts and prints the substring between two specified characters in a given string.
Moves all occurrences of the character 'x' to the end of the string.
- Recursion: Many programs in this repository utilize recursion to simplify and solve complex string manipulation problems.
- Substrings and Characters: The programs cover a variety of string operations, including substring extraction, character replacement, and more.