prakhardoneria - HTMLify profile
files of /prakhardoneria/geekstreak60/
/prakhardoneria/geekstreak60/30.py
from collections import deque, defaultdict
class Solution:
def verticalOrder(self, root):
if not root:
class Solution:
def verticalOrder(self, root):
if not root:
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
Union of Arrays with Duplicates
/prakhardoneria/geekstreak60/day10.py
class Solution:
def findUnion(self, a, b):
res_set = set(a)
res_set.update(b)
return li
def findUnion(self, a, b):
res_set = set(a)
res_set.update(b)
return li
Longest Span in two Binary Arrays
/prakhardoneria/geekstreak60/day11.py
class Solution:
def equalSumSpan(self, a1, a2):
n = len(a1)
first_occurrence = {0: -1}
pref
def equalSumSpan(self, a1, a2):
n = len(a1)
first_occurrence = {0: -1}
pref
Longest Subarray with Majority Greater than K
/prakhardoneria/geekstreak60/day12.py
class Solution:
def longestSubarray(self, arr, k):
n = len(arr)
prefix_sum = 0
first_occ = {}
def longestSubarray(self, arr, k):
n = len(arr)
prefix_sum = 0
first_occ = {}
Isomorphic Strings
/prakhardoneria/geekstreak60/day13.py
class Solution:
def areIsomorphic(self, s1, s2):
if len(s1) != len(s2):
return False
ma
def areIsomorphic(self, s1, s2):
if len(s1) != len(s2):
return False
ma
Number of submatrix have sum X
/prakhardoneria/geekstreak60/day14.py
class Solution:
def countSquare(self, mat, x):
n = len(mat)
m = len(mat[0])
pref = [[0] * (
def countSquare(self, mat, x):
n = len(mat)
m = len(mat[0])
pref = [[0] * (
Find the closest pair from two arrays
/prakhardoneria/geekstreak60/day15.py
class Solution:
def findClosestPair(self, arr1, arr2, x):
n = len(arr1)
m = len(arr2)
# Ini
def findClosestPair(self, arr1, arr2, x):
n = len(arr1)
m = len(arr2)
# Ini
/prakhardoneria/geekstreak60/day16.py
class Solution:
def pushZerosToEnd(self, arr):
count = 0 # Pointer for the position of the next non-zero element
def pushZerosToEnd(self, arr):
count = 0 # Pointer for the position of the next non-zero element
Trapping Rain Water
/prakhardoneria/geekstreak60/day17.py
class Solution:
def maxWater(self, arr):
if not arr:
return 0
n = len(arr)
def maxWater(self, arr):
if not arr:
return 0
n = len(arr)
Longest subarray with Atmost two distinct integers
/prakhardoneria/geekstreak60/day18.py
class Solution:
def totalElements(self, arr):
left = 0
max_len = 0
freq = {}
distinct = 0
def totalElements(self, arr):
left = 0
max_len = 0
freq = {}
distinct = 0
Max Xor Subarray of size K
/prakhardoneria/geekstreak60/day19.py
class Solution:
def maxSubarrayXOR(self, arr, k):
n = len(arr)
current_xor = 0
# 1. Calcula
def maxSubarrayXOR(self, arr, k):
n = len(arr)
current_xor = 0
# 1. Calcula
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
Longest Substring with K Uniques
/prakhardoneria/geekstreak60/day20.py
class Solution:
def longestKSubstr(self, s, k):
n = len(s)
distinct_map = {}
left = 0
max_le
def longestKSubstr(self, s, k):
n = len(s)
distinct_map = {}
left = 0
max_le
The Smallest Window Substring
/prakhardoneria/geekstreak60/day21.py
from collections import Counter
class Solution:
def minWindow(self, s, p):
if not s or not p:
return ""
class Solution:
def minWindow(self, s, p):
if not s or not p:
return ""
Dice throw
/prakhardoneria/geekstreak60/day22.py
class Solution:
def noOfWays(self, m, n, x):
dp = [[0] * (x + 1) for _ in range(n + 1)]
dp[0][0] =
def noOfWays(self, m, n, x):
dp = [[0] * (x + 1) for _ in range(n + 1)]
dp[0][0] =
Pythagorean Triplet
/prakhardoneria/geekstreak60/day23.py
class Solution:
def pythagoreanTriplet(self, arr):
max_val = 0
for x in arr:
if x > max_val:
def pythagoreanTriplet(self, arr):
max_val = 0
for x in arr:
if x > max_val:
/prakhardoneria/geekstreak60/day24.py
class Solution:
def largestSwap(self, s):
s_list = list(s)
n = len(s)
sorted_s = sorted(s_l
def largestSwap(self, s):
s_list = list(s)
n = len(s)
sorted_s = sorted(s_l
/prakhardoneria/geekstreak60/day27.py
from collections import deque
class Solution:
def kBitFlips(self, arr, k):
n = len(arr)
flip_ends = deque()
class Solution:
def kBitFlips(self, arr, k):
n = len(arr)
flip_ends = deque()
/prakhardoneria/geekstreak60/day28.py
class Solution:
def generateIp(self, s):
res = []
n = len(s)
if n < 4 or n > 12:
def generateIp(self, s):
res = []
n = len(s)
if n < 4 or n > 12:
/prakhardoneria/geekstreak60/day29.py
from collections import deque
class Solution:
def topView(self, root):
if not root:
return []
class Solution:
def topView(self, root):
if not root:
return []
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
/prakhardoneria/geekstreak60/day31.py
class Solution:
def countAllPaths(self, root, k):
prefix_sums = {0: 1}
def dfs(node, current_sum):
def countAllPaths(self, root, k):
prefix_sums = {0: 1}
def dfs(node, current_sum):
/prakhardoneria/geekstreak60/day34.py
class Solution:
def largestBst(self, root):
self.max_size = 0
def traverse(node):
if no
def largestBst(self, root):
self.max_size = 0
def traverse(node):
if no
/prakhardoneria/geekstreak60/day35.py
class Solution:
def findPreSuc(self, root, key):
pre = None
suc = None
# Finding Successor
def findPreSuc(self, root, key):
pre = None
suc = None
# Finding Successor
/prakhardoneria/geekstreak60/day36.py
import math
class Solution:
def countBSTs(self, arr):
n = len(arr)
def get_catalan(k):
class Solution:
def countBSTs(self, arr):
n = len(arr)
def get_catalan(k):
/prakhardoneria/geekstreak60/day37.py
from collections import deque
class Solution:
def orangesRot(self, mat):
rows = len(mat)
cols = len(mat[0])
class Solution:
def orangesRot(self, mat):
rows = len(mat)
cols = len(mat[0])
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:
Count Inversions
/prakhardoneria/geekstreak60/day5.py
class Solution:
def inversionCount(self, arr):
def merge_and_count(temp_arr, left, mid, right):
i = left
def inversionCount(self, arr):
def merge_and_count(temp_arr, left, mid, right):
i = left
Missing Element in Range
/prakhardoneria/geekstreak60/day6.py
class Solution:
def missingRange(self, arr, low, high):
present_elements = set()
for num in arr:
def missingRange(self, arr, low, high):
present_elements = set()
for num in arr:
Form the Largest Number
/prakhardoneria/geekstreak60/day7.py
from functools import cmp_to_key
class Solution:
def findLargest(self, arr):
arr = list(map(str, arr))
class Solution:
def findLargest(self, arr):
arr = list(map(str, arr))
Calculating the H-Index
/prakhardoneria/geekstreak60/day8.py
class Solution:
def hIndex(self, citations):
n = len(citations)
buckets = [0] * (n + 1)
for
def hIndex(self, citations):
n = len(citations)
buckets = [0] * (n + 1)
for
Count Subarrays with given XOR
/prakhardoneria/geekstreak60/day9.py
class Solution:
def subarrayXor(self, arr, k):
res = 0
pref_xor = 0
counts = {0: 1}
def subarrayXor(self, arr, k):
res = 0
pref_xor = 0
counts = {0: 1}