Amazon SDE questions try

Author: Narahari-Sundaragopalan

exercises/misc/findKClosestPoints.js

@@ -0,0 +1,37 @@
+/*Amazon SDE Assessment // QUESTION: There are a set of locations, represented by points.
+Find the closest locations for the truck with start point (0,0), for the number of deliveries to be made
+
+For eg: if the locations are "[[1,-1], [-2,4], [1,1], [3,2]]"
+numDeliveries = 2
+Closest locations would be [[1, -1], [1, 1]]
+*/
+
+function findKClosest(numDestinations, allLocations, numDeliveries) {
+  // Array to store coordinates and distance
+  let pointsWithDistance = [];
+  const outputArray = [];
+  for (let i = 0; i < allLocations.length; i++) {
+    let currentLocation = allLocations[i];
+    distance = Math.sqrt(
+      currentLocation[0] * currentLocation[0] +
+        currentLocation[1] * currentLocation[1]
+    );
+    pointsWithDistance.push({ location: currentLocation, distance: distance });
+  }
+
+  pointsWithDistance.sort(function(a, b) {
+    if (a.distance > b.distance) {
+      return 1;
+    }
+
+    if (a.distance < b.distance) {
+      return -1;
+    }
+    return 0;
+  });
+
+  for (let i = 0; i < numDeliveries; i++) {
+    outputArray.push(pointsWithDistance[i].location);
+  }
+  return outputArray;
+}

exercises/misc/findOptimalRoute.js

@@ -0,0 +1,41 @@
+function findOptimalRoute(forwardRouteArr, returnRouteArr, maxTravelDistance) {
+  let routeWithDistance = [];
+
+  for (let i = 0; i < forwardRouteArr.length; i++) {
+    let currentForwardRoute = forwardRouteArr[i];
+    for (let j = 0; j < returnRouteArr.length; j++) {
+      let currenReturnRoute = returnRouteArr[j];
+      let distance = currentForwardRoute[1] + currenReturnRoute[1];
+      routeWithDistance.push({
+        route: [currentForwardRoute[0], currenReturnRoute[0]],
+        distance: distance
+      });
+    }
+  }
+
+  routeWithDistance.sort((a, b) => {
+    if (a.distance > b.distance) {
+      return -1;
+    }
+
+    if (a.distance < b.distance) {
+      return 1;
+    }
+
+    return 0;
+  });
+
+  let optimalDistance = routeWithDistance[0].distance;
+  outputArray.push(routeWithDistance[0].route);
+
+  for (let i = 1; i < routeWithDistance.length; i++) {
+    if (
+      routeWithDistance[i].distance <= maxTravelDistance &&
+      routeWithDistance[i].distance === optimalDistance
+    ) {
+      outputArray.push(routeWithDistance[i].route);
+    }
+  }
+
+  return outputArray;
+}