#Array #Greedy
Problem Statement: https://leetcode.com/problems/car-poo...
The first approach - Using Heap and Array - O(nlogn)
The second approach - Array and Prefix Sum - O(n)
Connect me on LinkedIn: / alok-mishra-05ba9a14a
Follow me on Insta: / alok_akol
#Array #Greedy #Trips #CarPooling #Coding #Programming #Interview #Practice #Leetcode #Medium #1094 #Algorithm #DataStructure #C++ #Preparation
#Sorting #Heap #PrefixSum #hackerrank
コメント