Merge pull request #472 from aman9211-max/master

inital commit

cpp/job-scheduling-problem.cpp

@@ -0,0 +1,33 @@
+class Solution {
+public:
+    int dp[305][15];
+    int find(vector<int> &diff, int d, int i) {
+        if(d == 1) {
+            if(i == diff.size()) {
+                return INT_MAX / 4;
+            }
+            int mx = -1;
+            for(int j = i; j < diff.size(); j++) {
+                mx = max(diff[j], mx);
+            }
+
+            return mx;
+        }
+        if(dp[i][d] != -1) {
+            return dp[i][d];
+        }
+        int mx = -1;
+        int ans = INT_MAX / 2;
+        for(int j = i; j < diff.size() - d + 1; j++) {
+            mx = max(diff[j], mx);
+
+            ans = min(ans, mx + find(diff, d - 1, j + 1));
+        }
+        return dp[i][d] =  ans;
+    }
+    int minDifficulty(vector<int>& jobDifficulty, int d) {
+        memset(dp, -1, sizeof dp);
+        int ans =  find(jobDifficulty, d, 0);
+        return (ans >= INT_MAX / 2 ? -1 : ans);
+    }
+};

cpp/top-k-frequent-words.cpp

@@ -0,0 +1,30 @@
+class Solution {
+public:
+
+    static bool comp(pair<int, string> &a, pair<int, string> &b) {
+        return (a.first == b.first ? a.second < b.second : a.first > b.first);
+    }
+
+    vector<string> topKFrequent(vector<string>& words, int k) {
+
+        map<string, int> m;
+        for(auto i : words) {
+            m[i]++;
+        }
+        vector<pair<int, string> > ans;
+        for(auto i : m) {
+            ans.push_back({i.second, i.first});
+
+        }
+        vector<string> res;
+        sort(ans.begin(), ans.end(), comp);
+
+        for(int  i = 0; i < k; i++) {
+            res.push_back(ans[i].second);
+        }
+        return res;
+
+
+
+    }
+};