1333

Author: Ashish-kumar7

1332.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    int removePalindromeSub(string s) { 
+        if(s.length()==0){
+            return 0;
+        }
+        int n=s.length()-1;
+        int i=0;
+        bool a=true;
+        while(i<n){
+            if(s[i++]!=s[n--]){
+                  a=false;
+                break;
+               }
+        }
+        if(a){
+            return 1;
+        }
+        else {
+            return 2;
+        } 
+    }
+};

1333.cpp

@@ -0,0 +1,56 @@
+ static bool cmp(const vector<int>& v1, const vector<int>& v2) {
+        return v1[1] == v2[1] ? v1[0] > v2[0] : v1[1] > v2[1];
+    }
+
+class Solution {
+public:
+    vector<int> filterRestaurants(vector<vector<int>>& restaurant, int veganFriendly, int maxPrice, int maxDistance) {
+        
+        int n=restaurant.size();
+        vector<vector<int>>result;
+        
+        if(veganFriendly==1)
+        {
+        for(int i=0;i<n;i++)
+        {
+            if(restaurant[i][2]==1)
+            {
+                if(restaurant[i][3]<=maxPrice)
+                {
+                    if(restaurant[i][4]<=maxDistance)
+                    {
+                        result.push_back(restaurant[i]);
+                    }
+                }
+            }            
+        }
+            
+        }
+        
+        if(veganFriendly==0)
+        {
+        for(int i=0;i<n;i++)
+        {
+                if(restaurant[i][3]<=maxPrice)
+                {
+                    if(restaurant[i][4]<=maxDistance)
+                    {
+                        result.push_back(restaurant[i]);
+                    }
+                }           
+        }
+            
+        }
+        
+        sort(result.begin(),result.end(),cmp) ;
+        
+       vector<int>ids;
+        for(int i=0;i<result.size();i++)
+        {
+            ids.push_back(result[i][0]);
+        }
+        
+        return ids;
+    
+    }
+};