Added sort chars by frequency problem and some refactoring

mandliya · Jan 5, 2018 · 7297039 · 7297039
1 parent 0732437
commit 7297039
Show file tree

Hide file tree

Showing 8 changed files with 66 additions and 350 deletions.
diff --git a/CMakeCache.txt b/CMakeCache.txt
diff --git a/CMakeLists.txt b/CMakeLists.txt
@@ -28,4 +28,3 @@ foreach( sourcefile ${SOURCES} )
             continue()
 		endif()
 endforeach( sourcefile ${SOURCES} )
-
diff --git a/README.md b/README.md
@@ -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)|
 
 
diff --git a/common_ds_algo_problems/minHeap.cpp b/common_ds_algo_problems/minHeap.cpp