Skip to content

Added some algorithms related to strings, I hope this will help. #66

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.

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
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
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
31 changes: 31 additions & 0 deletions allalgorithms/string/counting_valleys.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
'''
Counting valleys deals with strings. One has to count the number of valleys and Hills in the given string and return the position of traveller at end w.r.t the start point.
'U' is treated as 'the traveller came across a hill' and 'D' denotes that he came across a valley.

Input is guranteed as a string with 'U', and 'D' with an integer having the value of length of input string.

Output should be a single integer that denotes the number of valleys traveller walked through during his hike.

Example :
Input = 8
UDDDUDUU

Output = 1
'''

import sys
n = int(input())
s = input()

m = 0
v = 0

for i in s:
if i == 'U':
m += 1
if m == 0:
v += 1
else:
m -= 1
print(v)

12 changes: 12 additions & 0 deletions allalgorithms/string/pangrams.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
# Algorithm to check the string is pangram or not

alpha = "abcdefghijklmnopqrstuvwxyz "

def isPangram(s):
for i in alpha:
if i not in s:
return "not pangram"
return "pangram"
s = input().lower()
print(isPangram(s))