Committed

Author: rachitvk

Codeforces/Codeforces Round 558/A - Eating Soup.cpp

@@ -0,0 +1,11 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define print(a) cout << a << endl
+
+int main(){
+    int n,c;
+    cin >> n >> c;
+    
+    (c == 0) ? print(1) : (c<=n/2) ? print(c) : print(n%c) ;
+}

Codeforces/Codeforces Round 558/B-Cat Party.cpp

@@ -0,0 +1,45 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define print(a) cout << a << endl
+#define __ {ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);}
+
+const int N = 1e5 + 10;
+
+int cnt[N],f[N];
+
+int main(){
+   __;
+   int n;
+   cin >> n;
+   
+   int mx = 0;
+   int ans;
+   
+   for(int i=1;i<=n;i++){
+       int color;
+       cin >> color;
+       
+       cnt[f[color]]--;
+       f[color]++;
+       cnt[f[color]]++;
+       
+       mx = max(mx,f[color]);
+       
+       bool ok = false;
+       
+       if(cnt[i] == 1)
+         ok = true;
+       else if(cnt[1] == i)
+         ok = true;
+       else if(cnt[mx]*mx == i-1 && cnt[1] == 1)
+         ok = true;
+       else if(cnt[mx-1]*(mx-1) == i-mx && cnt[mx] == 1)
+         ok = true;
+         
+        if(ok)
+            ans = i;
+   }
+   
+    print(ans);
+}

Leetcode/InvertTree.cpp

@@ -0,0 +1,21 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    TreeNode* invertTree(TreeNode* root) {
+        if(!root)
+            return NULL;
+        
+        TreeNode* temp = invertTree(root->right);
+        root->right = invertTree(root->left);
+        root->left = temp;
+        return root;
+    }
+};

Leetcode/MoveZeroes.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    void moveZeroes(vector<int>& nums) {
+        
+        int j = 0;
+        for(int i=0;i<nums.size();i++){
+            if(nums[i] != 0)
+                swap(nums[i],nums[j++]);
+        }
+            
+    }
+};

Leetcode/ReverseLinkedList.cpp

@@ -0,0 +1,27 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode(int x) : val(x), next(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    
+    ListNode* h;
+    
+    void helper(ListNode* curr,ListNode* prev){
+        if(!curr)
+            h = prev;
+        else{
+            helper(curr->next,curr);
+            curr->next = prev;
+        }
+    }
+    
+    ListNode* reverseList(ListNode* head) {
+        helper(head,NULL);
+        return h;
+    }
+};