leeatcode 1282

Author: Pankajcoder1

Codeforces/After Placement/1136B-Nastya Is Playing Computer Games.cpp

@@ -0,0 +1,23 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,m;
+    cin >> n >> m;
+    cout << n * 3 + min(m - 1, n - m);
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/1282.Group the People Given the Group Size They Belong To.cpp

@@ -0,0 +1,33 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    vector<vector<int>> groupThePeople(vector<int> &groupSizes)
+    {
+        map<int,vector<int>> m;
+        for(int i=0;i<groupSizes.size();i++){
+            m[groupSizes[i]].push_back(i);
+        }
+        vector<vector<int>> ans;
+        for(auto x:m){
+            int grpSize=x.first;
+            for(int i=0;i<x.second.size();i=i+grpSize){
+                vector<int> temp;
+                for(int j=i;j<i+grpSize;j++){
+                    temp.push_back(x.second[j]);
+                }
+                ans.push_back(temp);
+            }
+        }
+        return ans;
+    }
+};

LeetCode/225.Implement_Stack_ using_Queues.cpp

@@ -1,91 +1,55 @@
 /*
     written by Pankaj Kumar.
     country:-INDIA
-    Institute: National Institute of Technology, Uttarakhand
 */
 typedef long long ll ;
-typedef unsigned long long ull;
-typedef vector<int> vl;
-typedef vector<vector<int>> vvl;
-#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
-/*  Abbrevations  */
-#define ff first
-#define ss second
-#define mp make_pair
-#define pb push_back
-// loops
-#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
-// Some print
-#define no cout<<"NO"<<endl;
-#define yes cout<<"YES"<<endl;
-// sort
-#define all(V) (V).begin(),(V).end()
-#define srt(V) sort(all(V))
-#define srtGreat(V) sort(all(V),greater<ll>())
-// some extra
-#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} cout<<endl;
-#define precision(x) cout<<fixed<<setprecision(x);
-#define sz(V) ll(V.size())
-
-
-/* ascii value
-A=65,Z=90,a=97,z=122
-*/
-
-/* Some syntax 
-//Syntax to create a min heap for priority queue
-//priority_queue <int, vector<int>, greater<int>>pq;
-*/
-/*  --------------------MAIN PROGRAM----------------------------*/
-// to run ctrl+b
 const ll INF=1e18;
 const ll mod1=1e9+7;
 const ll mod2=998244353;
-// Techniques :
-// divide into cases, brute force, pattern finding
-// sort, greedy, binary search, two pointer
-// transform into graph
-
-// Experience :
-// Cp is nothing but only observation and mathematics.
-
-
 //Add main code here
 
-class MyStack {
+class MyStack
+{
 public:
     /** Initialize your data structure here. */
     queue<int> q;
 
-    MyStack() {
+    MyStack()
+    {
+        q.clear();
     }
-    
+
     /** Push element x onto stack. */
-    void push(int x) {
+    void push(int x)
+    {
         q.push(x);
     }
-    
+
     /** Removes the element on top of the stack and returns that element. */
-    int pop() {
+    int pop()
+    {
         queue<int> temp;
-        while(q.size()>1){
+        while (q.size() > 1)
+        {
             temp.push(q.front());
             q.pop();
         }
-        int t=q.front();
+        int t = q.front();
         q.pop();
-        q=temp;
+        q = temp;
         return t;
     }
-    
+
     /** Get the top element. */
-    int top() {
+    int top()
+    {
         return q.back();
     }
-    
+
     /** Returns whether the stack is empty. */
-    bool empty() {
-        return q.size()==0;
+    bool empty()
+    {
+        return q.size() == 0;
     }
 };
 
@@ -97,14 +61,3 @@ class MyStack {
  * int param_3 = obj->top();
  * bool param_4 = obj->empty();
  */
-
-
-
-/* -----------------END OF PROGRAM --------------------*/
-/*
-* stuff you should look before submission
-* constraint and time limit
-* int overflow
-* special test case (n=0||n=1||n=2)
-* don't get stuck on one approach if you get wrong answer
-*/