Leetcode Weekly Contest 377 solution || all solution

Leetcode Weekly Contest 376 solution || all solution

Minimum Number Game solution in :-python
Minimum Number Game solution in :- java
Minimum Number Game solution in :- c++ or cpp

Maximum Square Area by Removing Fences From a Field4 solution in :-python
Maximum Square Area by Removing Fences From a Field4 solution in :- java
Maximum Square Area by Removing Fences From a Field4 solution in :- c++ or cpp

Minimum Cost to Convert String I solution in :-python
Minimum Cost to Convert String I solution in :- java
Minimum Cost to Convert String I solution in :- c++ or cpp

Minimum Cost to Convert String II solution in :-python
Minimum Cost to Convert String II solution in :- java
Minimum Cost to Convert String II solution in :- c++ or cpp

#WeeklyContest377
#leetcodesoltuion
#weeklyContest377
#Weekly Contest 377
#leetcode4problemsolution
#leetcodeweekly377
#Weekly Contest 377
#leetcodecontestsolution
#leetcodeDSAsolution
#leetcodeprice
#youtube
#viralvideo
#shorts
Welcome to the 377th LeetCode Weekly Contest

today leetcode weekly live contest 377 solution,leetcode weekly contest,leetcode 377,leetcode weekly contest 377,weekly contest leetcode,leetcode weekly contest 377 solution,377 leetcode,leetcode weekly contest 377 all solutions,today leetcode contest 377 solution,today leetcode solution,today leetcode weekly contest 377 solution,weekly contest 377,today leetcode 377 solution,today leeetcode contest solution 377

[codeswar]

I AM REALLY SORRY FOR ALL, I CANT DO THIS 2ND QUESTION

[berry]

2nd please any one solved dead end 15min only having?

[berry]

#2 I don't know wether it pass all test cases or not please if u pasaed this put me a comment
class Solution:
def maximizeSquareArea(self, m: int, n: int, hFences: List[int], vFences: List[int]) -> int:
if m==n:
return m*n
hFences.sort()
vFences.sort()
m=len(hFences)
n=len(vFences)
maxArea=-1
for i in range(m):
for j in range(n):
h=hFences[i]
v=vFences[j]
if h==v:
maxArea=max(0, h*v)
return maxArea
I