You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
|[Reverse words in a given string / Palindrome Check](https://www.geeksforgeeks.org/reverse-words-in-a-given-string/)| Easy |[Problem Link](https://practice.geeksforgeeks.org/problems/reverse-words-in-a-given-string/0)|
5
+
|[Largest odd number in a string](https://www.geeksforgeeks.org/largest-odd-number-in-string/)| Easy |[Problem Link](https://practice.geeksforgeeks.org/problems/largest-odd-number-in-string/1)|
6
+
|[Longest Common Prefix](https://www.geeksforgeeks.org/longest-common-prefix-using-word-by-word-matching/)| Easy |[Problem Link](https://practice.geeksforgeeks.org/problems/longest-common-prefix-in-an-array/0)|
|[Check whether one string is a rotation of another](https://www.geeksforgeeks.org/check-if-a-string-is-rotation-of-another-string/)| Medium |[Problem Link](https://practice.geeksforgeeks.org/problems/check-if-string-is-rotated-by-two-places/0)|
9
+
|[Check if two strings are anagram of each other](https://www.geeksforgeeks.org/check-whether-two-strings-are-anagram-of-each-other/)| Medium |[Problem Link](https://practice.geeksforgeeks.org/problems/anagram-1587115620/1)|
|[Sort Characters by frequency](https://www.geeksforgeeks.org/sort-characters-by-frequency/)| Easy |[Problem Link](https://practice.geeksforgeeks.org/problems/sort-characters-by-frequency/1)|
4
+
|[Maximum Nesting Depth of Parenthesis](https://www.geeksforgeeks.org/maximum-nesting-depth-of-the-parentheses/)| Easy |[Problem Link](https://practice.geeksforgeeks.org/problems/maximum-nesting-depth/1)|
5
+
|[Roman Number to Integer and vice versa](https://www.geeksforgeeks.org/roman-number-to-integer-and-vice-versa/)| Easy |[Problem Link](https://practice.geeksforgeeks.org/problems/roman-number-to-integer-and-vice-versa/1)|
6
+
|[Implement Atoi](https://www.geeksforgeeks.org/implement-atoi/)| Medium |[Problem Link](https://practice.geeksforgeeks.org/problems/implement-atoi/1)|
7
+
|[Count Number of Substrings](https://www.geeksforgeeks.org/count-number-of-substrings-with-exactly-k-distinct-characters/)| Medium |[Problem Link](https://practice.geeksforgeeks.org/problems/count-number-of-substrings/1)|
8
+
|[Longest Palindromic Substring (Do it without DP)](https://www.geeksforgeeks.org/longest-palindromic-substring-set-2/)| Hard |[Problem Link](https://practice.geeksforgeeks.org/problems/longest-palindromic-substring/0)|
9
+
|[Sum of Beauty of all substrings](https://www.geeksforgeeks.org/sum-of-beauty-of-all-substrings-of-a-string/)| Medium |[Problem Link](https://practice.geeksforgeeks.org/problems/sum-of-beauty-of-all-substrings/1)|
10
+
|[Reverse Every Word in A String](https://www.geeksforgeeks.org/reverse-words-in-a-given-string/)| Easy |[Problem Link](https://practice.geeksforgeeks.org/problems/reverse-words-in-a-given-string/0)|
0 commit comments