prakhardoneria - HTMLify profile
files of /prakhardoneria/geekstreak60/
The Painter's Partition Problem-II
/prakhardoneria/geekstreak60/day1.py
class Solution:
def minTime(self, arr, k):
# Helper function to check if a max_time limit is feasible
def is
def minTime(self, arr, k):
# Helper function to check if a max_time limit is feasible
def is
Chocolate Distribution Problem
/prakhardoneria/geekstreak60/day2.py
class Solution:
def findMinDiff(self, arr, m):
if m == 0 or len(arr) == 0:
return 0
arr
def findMinDiff(self, arr, m):
if m == 0 or len(arr) == 0:
return 0
arr
Meeting Rooms
/prakhardoneria/geekstreak60/day3.py
class Solution:
def canAttend(self, arr):
# 1. Sort the meetings based on start times
# If start times are e
def canAttend(self, arr):
# 1. Sort the meetings based on start times
# If start times are e
Maximum number of overlapping Intervals
/prakhardoneria/geekstreak60/day4.py
class Solution:
def overlapInt(self, arr):
max_val = 0
for start, end in arr:
if end > max_val:
def overlapInt(self, arr):
max_val = 0
for start, end in arr:
if end > max_val: