Added sort chars by frequency problem and some refactoring

Author: mandliya

CMakeCache.txt

@@ -28,4 +28,3 @@ foreach( sourcefile ${SOURCES} )
             continue()
 		endif()
 endforeach( sourcefile ${SOURCES} )
-

CMakeLists.txt

@@ -229,5 +229,6 @@ Include contains single header implementation of data structures and some algori
 | The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, calculate the Hamming distance.| [hamming_distance.cpp](leet_code_problems/hamming_distance.cpp)|
 | Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.| [merge_trees.cpp](leet_code_problems/merge_trees.cpp)|
 | Write a function that takes a string as input and reverse only the vowels of a string.|[reverse_vowels.cpp](leet_code_problems/reverse_vowels.cpp)|
+| Given a string, sort it in decreasing order based on the frequency of characters.For example: <ul><li>Input: cccbbbbaa Output: bbbcccaa</li></ul>| [sortCharByFrequency.cpp](leet_code_problems/sortCharByFrequency.cpp)|
 
 

README.md

@@ -0,0 +1,56 @@
+/*
+ * Given a string, sort it in decreasing order based on the frequency of characters.
+ * Example:
+ * Input: cccbbbbaa
+ * Output: bbbcccaa
+ * 
+ * Input: AaaBBaa
+ * Output: aaaaBBA
+ * 
+ * Input: cccaaa
+ * Output:cccaaa or aaaccc
+ * 
+ * Notice that order of chars in alphabatical order does not matter for same frequency elements.
+ * However, also all the same characters should be together. cacaca will not be a valid answer.
+ */
+
+#include <iostream>
+#include <unordered_map>
+#include <map>
+
+std::string frequencySort(std::string s) {
+        
+        // Create a hash map of our characters with frequency as their values.
+        std::unordered_map<char,int> frequencyMap;
+        for (char c : s) {
+            frequencyMap[c]++;
+        }
+        
+        // Now we will maintain an another ordered map whose key would be
+        // the frequency and values would be accumulated chars of same frequency.
+        //
+        std::map<int, std::string> stringMap;
+        for (auto frqPair : frequencyMap) {
+            char c = frqPair.first;
+            int n = frqPair.second;
+            stringMap[n] += std::string(n, c);
+        }
+        
+        // Now pick the accumulated string in reverse order (highest first)
+        std::string result;
+        for (auto it = stringMap.rbegin(); it != stringMap.rend(); ++it) {
+            result += it->second;
+        }
+        return result;
+    }
+
+int main()
+{
+    std::string input1{"cccbbbbaa"};
+    std::cout << "Input: " << input1 << std::endl;
+    std::cout << "Output:" << frequencySort(input1) << std::endl;
+    std::string input2{"cccaaa"};
+    std::cout << "Input:" << input2 << std::endl;
+    std::cout << "Output:" << frequencySort(input2) << std::endl;
+    return 0;
+}

common_ds_algo_problems/minHeap.cpp

@@ -13,7 +13,9 @@
  */
 
 
-#include <bits/stdc++.h>
+#include <iostream>
+#include <vector>
+#include <unordered_map>
 
 
 void printPairWithSum(const std::vector<int>& arr, const int sum)

leet_code_problems/sortCharByFrequency.cpp

@@ -8,7 +8,9 @@
  *
  */
 
-#include <bits/stdc++.h>
+#include <iostream>
+#include <queue>
+#include <iomanip>
 
  struct TreeNode
  {

sort_search_problems/find_pairs_with_sum.cpp

@@ -18,7 +18,9 @@
 
 
 
-#include <bits/stdc++.h>
+#include <iostream>
+#include <stack>
+#include <queue>
 
 
 struct TreeNode