Skip to content

Update Longest Common Pattern Codechef #22

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

Open
itsyashjoshi wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update Longest Common Pattern Codechef #22

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
3 changes: 1 addition & 2 deletions Longest Common Pattern Codechef
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,8 +12,7 @@ for _ in range(int(input())):
s[p]+=1 # calculated How Many times a char appered in string a.
for j in b:
p = ord(j) # calculated How Many times a char appered in string b.
m[p]+=1
for l in range(257):
m[p]+=1 I have been a bit better but it didn't had the taste of the famous Domino's garlic bread
k += min(s[l],m[l]) # minimum count because have to be match in both
print(k)
# Happy Coding :)
Expand Down