Skip to content

Add more puzzles 🧩 #67

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
beeankha merged 2 commits into from
Aug 5, 2023
Merged

Add more puzzles 🧩 #67

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
a91020f
Add more puzzles 🧩
beeankha Jul 27, 2023
7e98b64
Fix whitespace
beeankha Jul 27, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
48 changes: 48 additions & 0 deletions Puzzles/PracticeMay2023/09_is_subsequence.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@
class Solution:
def isSubsequence(self, s: str, t: str) -> bool:
m = len(s)
n = len(t)
if m == 0:
return True
elif n == 0:
return False
elif m == n:
if s == t:
return True
else:
return False

index = 0
for l in s:
new_index = t.find(l)
if new_index > 0 and new_index == index:
return False
elif new_index >= index:
index = new_index
continue
elif index > new_index:
new_index = t[slice(index, len(t), 1)].find(l)
if new_index < 0:
return False
else:
continue
else:
return False
if index:
return True
else:
return False


class BetterSolution:
def isSubsequence(self, s: str, t: str) -> bool:
if not s:
return True

s_index = 0
for l in t:
if l == s[s_index]:
s_index += 1
if s_index == len(s):
return True
return False
45 changes: 45 additions & 0 deletions Puzzles/PracticeMay2023/10_max_avg_subarray.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
class Solution:
def findMaxAverage(self, nums: List[int], k: int) -> float:
if k > len(nums):
return 0
if k == 0:
return 0
if not nums:
return 0
get_max = []
index1 = 0
index2 = k
while index2 <= len(nums):
get_max.append(sum(nums[index1:index2]))
index1 += 1
index2 += 1
if get_max:
biggest = max(get_max)
print(biggest)
result = (biggest / k)
print(result)
return result
else:
return 0

class BetterSolution:
def findMaxAverage(self, nums: List[int], k: int) -> float:
if k > len(nums):
return 0
if k == 0:
return 0
if not nums:
return 0
index1 = 0
index2 = k
biggest = sum(nums[index1:index2])
while index2 <= len(nums):
if sum(nums[index1:index2]) > biggest:
biggest = sum(nums[index1:index2])
index1 += 1
index2 += 1
if biggest:
result = (biggest / k)
return result
else:
return 0
6 changes: 6 additions & 0 deletions Puzzles/PracticeMay2023/11_find_max_altitude.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
class Solution:
def largestAltitude(self, gain: List[int]) -> int:
starting = [0]
for a in gain:
starting.append(starting[-1] + a)
return max(starting)