2026 August 1 Problems

[daryl...@gmail.com]

Feel free to work on any of the problems you want; we'll have people present their solutions at 11:30.

Please post your solutions to this thread so others can use this as a reference.

1221. Split a String in Balanced Strings Easy 87.5%

First Hard problem carried over from last week:

3956. Maximum Sum of M Non-Overlapping Subarrays I Hard 26.2%

2030. Smallest K-Length Subsequence With Occurrences of a Letter Hard 39.9%

Here is the meeting url:

https://us05web.zoom.us/j/82553858456?pwd=fnK5Vb0CcfFpv0lnouILjeEs2z2Khc.1 

Full details:

Topic: Leet Code meeting
Time: Mar 28, 2026 10:00 AM Pacific Time (US and Canada)
        Every week on Sat, 110 occurrence(s)
Please download and import the following iCalendar (.ics) files to your calendar system.
Weekly: https://us05web.zoom.us/meeting/tZYocuqgqzMuH9IuHUphHIiZ_4T4IndJLToX/ics?icsToken=DJFc88pL6-me_TneLwAALAAAAA70ShjYgLH6RfEnqUm5LK03v2OgtbXujwlKXRMVgIVWCY9aONPJMCycMlkhyPZ3XSrMVVgXDSYlGF_r7DAwMDAwMQ&meetingMasterEventId=MGJmt5lJTd6mPygcS0hiAQ
Join Zoom Meeting
https://us05web.zoom.us/j/82553858456?pwd=fnK5Vb0CcfFpv0lnouILjeEs2z2Khc.1

Meeting ID: 825 5385 8456
Passcode: 182596

[Bhupathi Kakarlapudi]

class Solution:

def balancedStringSplit(self, s: str) -> int:

balance:int = 0

num_of_balance_strings:int = 0

for ch in s:

if ch == 'L':

balance += 1

else:

balance -= 1

if balance == 0:

num_of_balance_strings += 1

return num_of_balance_strings

--
whatspp group: http://whatsapp.techbayarea.us/
---
You received this message because you are subscribed to the Google Groups "leetcode-meetup" group.
To unsubscribe from this group and stop receiving emails from it, send an email to leetcode-meet...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/leetcode-meetup/c2a75692-7abb-4c68-b85e-8b8b6d431ce4n%40googlegroups.com.

[Allen S.]

func balancedStringSplit(s string) int {

res := 0

b := 0

for _, v := range s {

if v == 'R' {

b++

} else {

b--

}

if b == 0 {

res++

}

}

return res

}