Add solution #5320

Author: JoshCrozier

5320-filter-restaurants-by-vegan-friendly-price-and-distance.js

@@ -0,0 +1,30 @@
+/**
+ * 5320. Filter Restaurants by Vegan-Friendly, Price and Distance
+ * https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/
+ * Difficulty: Medium
+ *
+ * Given the array restaurants where  restaurants[i] = [idi, ratingi, veganFriendlyi, pricei, distancei].
+ * You have to filter the restaurants using three filters.
+ *
+ * The veganFriendly filter will be either true (meaning you should only include restaurants with
+ * veganFriendlyi set to true) or false (meaning you can include any restaurant). In addition, you
+ * have the filters maxPrice and maxDistance which are the maximum value for price and distance of
+ * restaurants you should consider respectively.
+ *
+ * Return the array of restaurant IDs after filtering, ordered by rating from highest to lowest.
+ * For restaurants with the same rating, order them by id from highest to lowest. For simplicity
+ * veganFriendlyi and veganFriendly take value 1 when it is true, and 0 when it is false.
+ */
+
+/**
+ * @param {number[][]} restaurants
+ * @param {number} veganFriendly
+ * @param {number} maxPrice
+ * @param {number} maxDistance
+ * @return {number[]}
+ */
+var filterRestaurants = function(restaurants, veganFriendly, maxPrice, maxDistance) {
+  return restaurants.filter(r => (!veganFriendly || r[2]) && r[3] <= maxPrice && r[4] <= maxDistance)
+    .sort((a, b) => a[1] === b[1] ? b[0] - a[0] : b[1] - a[1])
+    .map(r => r[0]);
+};

README.md

@@ -63,6 +63,7 @@
 1318|[Minimum Flips to Make a OR b Equal to c](./1318-minimum-flips-to-make-a-or-b-equal-to-c.js)|Medium|
 1323|[Maximum 69 Number](./1323-maximum-69-number.js)|Easy|
 1324|[Print Words Vertically](./1324-print-words-vertically.js)|Medium|
+5320|[Filter Restaurants by Vegan-Friendly, Price and Distance](./5320-filter-restaurants-by-vegan-friendly-price-and-distance.js)|Medium|
 
 ## License