<\/p>\n\n\n\n
Given a string S of lowercase English characters \u2018a\u2019 – \u2018z\u2019. The task is to sort the string.<\/p>\n\n\n\n
Examples:<\/strong><\/p>\n\n\n\n The most basic approach to solve this problem is to simply use the inbuilt sorting algorithms of the respective languages.<\/p>\n\n\n\n A quick observation is that the string will contain the utmost 26 unique characters. Therefore, the idea is to count the frequency of each character using a map or similar data structure. Each index of the map will represent the characters from \u2018a\u2019 – \u2018z\u2019. Therefore for each index, we can print the total number of times the given character is present.<\/p>\n\n\n\n Algorithm<\/strong><\/p>\n\n\n\nApproach 1: Using inbuilt sort<\/h2>\n\n\n\n
C++ Code Implementation<\/span><\/h3>\n\n\n\n
void sortString(string &str){\n sort(str.begin(), str.end());\n cout << str;\n}<\/pre>\n\n\n\nJava Code Implementation<\/span><\/h3>\n\n\n\n
static void sortString(String str) {\n char []arr = str.toCharArray();\n Arrays.sort(arr);\n System.out.print(String.valueOf(arr));\n }<\/pre>\n\n\n\nPython Code Implementation<\/span><\/h3>\n\n\n\n
def sortString(str) :\n str = ''.join(sorted(str))\n print(str)<\/pre>\n\n\n\n
Approach 2: Hashing<\/h2>\n\n\n\n
C++ Code Implementation<\/h3>\n\n\n\n
const int MAX_CHAR = 26;\n \nvoid sortString(string & str) {\n int charCount[MAX_CHAR] = {\n 0\n };\n for (int i = 0; i < str.length(); i++)\n charCount[str[i] - 'a']++;\n \n for (int i = 0; i < MAX_CHAR; i++)\n for (int j = 0; j < charCount[i]; j++)\n cout << (char)('a' + i);\n}<\/pre>\n\n\n\nJava Code Implementation<\/h3>\n\n\n\n
public class SortString {\n static final int MAX_CHAR = 26;\n \n static void sortString(String str) {\n \n int letters[] = new int[MAX_CHAR];\n for (char x: str.toCharArray()) {\n letters[x - 'a']++;\n }\n for (int i = 0; i < MAX_CHAR; i++) {\n for (int j = 0; j < letters[i]; j++) {\n System.out.print((char)(i + 'a'));\n }\n }\n }\n}<\/pre>\n\n\n\nPython Code Implementation<\/h3>\n\n\n\n
MAX_CHAR = 26\n \n \ndef sortString(str):\n charCount = [0 for i in range(MAX_CHAR)]\n for i in range(0, len(str), 1):\n charCount[ord(str[i]) - ord(\"a\")] += 1\n \n for i in range(0, MAX_CHAR, 1):\n for j in range(0, charCount[i], 1):\n print(chr(ord(\"a\") + i), end=\"\")<\/pre>\n\n\n\n