“Reverse an Array” is an elementary problem for beginners based on array data structure. Here, we are given an array containing ‘n’ elements and our task is to reverse given array. Example: INPUT ARRAY: Array[5] = {1, 2, 3, 4, 5} OUTPUT ARRAY: Array[5] = {5, 4, 3, 2, 1}...
“Find First Non-Repeating Character of the String” is a very important and popular problem asked in many technical interviews of product-based companies. Here, we are given a string of length ‘n’ and our task is to find the first non-repeating character of the string. Example: Input: COMPUTERSCIENCE Output: The first...
“Check Pangram String” is a very popular and basic problem of string data structure, asked in many technical interviews. Here, we are given a string of length ‘n’ and our task is to check whether given string is panagram string or not. Panagram String: A string is called Panagram String...
“Print all Palindromic Substrings of the given string” is a basic problem of string data structure asked in many technical interviews. Here, we are given a string of length ‘n’ and our task is to write a program to print all palindromic substrings of the given string. Palindromic Substring are...
“Check Whether String is Palindromic Anagram or Not” is popular interview problem asked in many technical and algorithmic interviews. Here, we are given a string and our task is to write a program to check whether string is Palindromic Anagram or not. A palindrome Anagram string is a string which can be...
“check if two strings are rotations of each other” is a popular interview problem based on string data structure. Here, we are given two strings str1 and str2 and our task is to check whether these two strings are in rotation of each other or not. Example: INPUT: String 1:...
“Check whether two strings are anagram of each other” is a very important and one of the most asked technical interview problems based on string data structure. Here, we are given two strings and our task is to check whether two strings are anagram of each other or not. Two...
“Find Longest Palindromic Substring” is an important and one of the interview favourite problem of string data structure. Here, we are given a string and our task is to write a program to find the longest palindromic substring in the given string. Longest Palindromic Substring: Longest Palindromic Substring of the given string...
“Print all substrings of a String” is a popular technical interview problem asked in many interviews. Here, we are given a string of length ‘n’ and our task is write a program to count and print all substrings of a string. Example: INPUT: ABCD OUTPUT: No of substring: 10 Substrings:...
“Reverse Each Word in a String” is a popular problem of string data structure. Here, we are given a string of words and our task is to write a program to reverse each word in a string. Example: INPUT: HelpMeStudyBro is an Emerging Website OUTPUT: orBydutSeMpleH si na gnigremE etisbeW ...