Skip to content

nitin100994/data-structures-algorithms

Repository files navigation

data-structures-algorithms

Q1 Check Anagram

Check whether two strings are anagram of each other Write a function to check whether two given strings are anagram of each other or not. An anagram of a string is another string that contains same characters, only the order of characters can be different. For example, “abcd” and “dabc” are anagram of each other

Q2 Remove Spaces

Remove spaces from a given string Given a string, remove all spaces from the string and return it.

Input: " Nit in " Output: "Nitin"

Q3 Array Rotation

Program for array rotation Write a function rotate(ar[], d, n) that rotates arr[] of size n by d elements.

Example left rotation by 2

	1,2,3,4,5,6,7
			
	3,4,5,6,7,1,2	

Here d is no of rotaions.

Q4 Pangram Checking Given a string check if it is Pangram or not. A pangram is a sentence containing every letter in the English Alphabet.

Examples : The quick brown fox jumps over the lazy dog ” is a Pangram [Contains all the characters from ‘a’ to ‘z’] “The quick brown fox jumps over the dog” is not a Pangram [Doesn’t contains all the characters from ‘a’ to ‘z’, as ‘l’, ‘z’, ‘y’ are missing]

Q5 Remove duplicate from a string.

Q6 Reverse an array without affecting special characters.

Releases

No releases published

Packages

No packages published

Languages