Given a string S, write a program to count the occurrence of Lowercase characters, Uppercase characters, Special characters and Numeric values in the string.
Note: There are no white spaces in the string.
Example 1:
Input:
S = "#GeeKs01fOr@gEEks07"
Output:
5
8
4
2
Explanation: There are 5 uppercase characters,
8 lowercase characters, 4 numeric characters
and 2 special characters.
Example 2:
Input: 
S = "*GeEkS4GeEkS*"
Output:
6
4
1
2
Explanation: There are 6 uppercase characters,
4 lowercase characters, 1 numeric characters
and 2 special characters.
Your Task:
You don't need to read input or print anything. Your task is to complete the function count() which takes the string S as input and returns an array of size 4 where arr[0] = number of uppercase characters, arr[1] = number of lowercase characters, arr[2] = number of numeric characters and arr[3] = number of special characters.
Expected Time Complexity: O(|S|).
Expected Auxiliary Space: O(1).
Constraints:
1<=|S|<=10^{5}

Source: geeksforgeeks | Difficulty: EASY
Tags: String algorithms

Data structures

Starter code: #User function Template for python3



class Solution:

    def count (self,s):

        # your code here

Solutions:
class Solution:

	def count(self, s):
		upper = 0
		lower = 0
		digit = 0
		special = 0
		for i in range(len(s)):
			if s[i] >= 'A' and s[i] <= 'Z':
				upper += 1
			elif s[i] >= 'a' and s[i] <= 'z':
				lower += 1
			elif s[i] >= '0' and s[i] <= '9':
				digit += 1
			else:
				special += 1
		return (upper, lower, digit, special)


class Solution:

	def count(self, s):
		upper = 0
		lower = 0
		digit = 0
		special = 0
		for i in s:
			if i.isupper():
				upper += 1
			elif i.islower():
				lower += 1
			elif i.isdigit():
				digit += 1
			else:
				special += 1
		return (upper, lower, digit, special)


class Solution:

	def count(self, s):
		l = 0
		u = 0
		S = 0
		n = 0
		spl = '"\\!@#$%^&*()_,.:;">.<,?/][}{\\|~`+'
		for i in s:
			if i.islower():
				l += 1
			elif i.isupper():
				u += 1
			elif i.isdigit():
				n += 1
			else:
				S += 1
		return [u, l, n, S]


class Solution:

	def count(self, s):
		(count_upper, count_lower, count_num, count_special) = (0, 0, 0, 0)
		for char in s:
			if char.islower():
				count_lower += 1
			elif char.isupper():
				count_upper += 1
			elif char.isnumeric():
				count_num += 1
			else:
				count_special += 1
		return [count_upper, count_lower, count_num, count_special]


class Solution:

	def count(self, s):
		(a, b, c) = (0, 0, 0)
		for char in s:
			if char.isupper():
				a += 1
			if char.islower():
				b += 1
			if char.isdigit():
				c += 1
		d = len(s) - (a + b + c)
		return [a, b, c, d]


import string

class Solution:

	def count(self, s1):
		u = 0
		l = 0
		n = 0
		special = 0
		s = str(s1)
		_len = len(s)
		for i in s:
			if i.isupper():
				u += 1
			elif i.islower():
				l = l + 1
			elif i in string.punctuation:
				special = special + 1
			else:
				n = n + 1
		return (u, l, n, special)


class Solution:

	def count(self, s):
		upc = 0
		lwc = 0
		num = 0
		spl = 0
		for i in s:
			if i.isupper():
				upc += 1
			elif i.islower():
				lwc += 1
			elif i in ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9'):
				num += 1
			else:
				spl += 1
		return (upc, lwc, num, spl)


class Solution:

	def count(self, s):
		(count_lower, count_upper, count_number, count_special) = (0, 0, 0, 0)
		for i in s:
			if i.isupper():
				count_upper += 1
			elif i.islower():
				count_lower += 1
			elif i.isnumeric():
				count_number += 1
			else:
				count_special += 1
		return [count_upper, count_lower, count_number, count_special]


class Solution:

	def count(self, s):
		count_A = 0
		count_a = 0
		count = 0
		count_1 = 0
		for i in s:
			if i.isupper():
				count_A += 1
			elif i.islower():
				count_a += 1
			elif i.isnumeric():
				count_1 += 1
			else:
				count += 1
		return [count_A, count_a, count_1, count]


class Solution:

	def count(self, s):
		arr = [0, 0, 0, 0]
		for i in s:
			if ord(i) >= 65 and ord(i) <= 90:
				arr[0] += 1
			elif ord(i) >= 97 and ord(i) <= 122:
				arr[1] += 1
			elif ord(i) >= 48 and ord(i) <= 57:
				arr[2] += 1
			else:
				arr[3] += 1
		return arr


class Solution:

	def count(self, s):
		U = 0
		L = 0
		S = 0
		N = 0
		for i in range(len(s)):
			if s[i].isupper():
				U += 1
			elif s[i].islower():
				L += 1
			elif s[i].isdigit():
				N += 1
			else:
				S += 1
		return (U, L, N, S)


class Solution:

	def count(self, s):
		c = [0, 0, 0, 0]
		for i in s:
			k = ord(i)
			if k > 64 and k < 91:
				c[0] += 1
			elif k > 96 and k < 123:
				c[1] += 1
			elif k > 47 and k < 58:
				c[2] += 1
			else:
				c[3] += 1
		return c


class Solution:

	def count(self, s):
		(n, u, l, sp) = (0, 0, 0, 0)
		for i in s:
			if i.isdecimal():
				n += 1
			elif i.isupper():
				u += 1
			elif i.islower():
				l += 1
			else:
				sp += 1
		return (u, l, n, sp)


class Solution:

	def count(self, s):
		res = [0, 0, 0, 0]
		for i in s:
			if i >= 'A' and i <= 'Z':
				res[0] += 1
			elif i >= 'a' and i <= 'z':
				res[1] += 1
			elif i >= '0' and i <= '9':
				res[2] += 1
			else:
				res[3] += 1
		return res


class Solution:

	def count(self, s):
		uc = 0
		lc = 0
		sc = 0
		nc = 0
		for i in s:
			if i.isupper():
				uc += 1
			elif i.islower():
				lc += 1
			elif i.isdigit():
				nc += 1
			else:
				sc += 1
		a = []
		a.append(uc)
		a.append(lc)
		a.append(nc)
		a.append(sc)
		return a


class Solution:

	def count(self, s):
		ucc = 0
		lcc = 0
		num = 0
		spl = 0
		for e in s:
			ascii = ord(e)
			if ascii >= 65 and ascii < 91:
				ucc = ucc + 1
			elif ascii > 96 and ascii < 123:
				lcc = lcc + 1
			elif ascii > 47 and ascii < 58:
				num = num + 1
			else:
				spl = spl + 1
		res = []
		res.append(ucc)
		res.append(lcc)
		res.append(num)
		res.append(spl)
		return res


class Solution:

	def count(self, s):
		uc = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
		a = 0
		lc = 'abcdefghijklmnopqrstuvwxyz'
		b = 0
		n = '1234567890'
		c = 0
		sc = '!@#$"%^&*\')(_+=}{:;<>,-+]|[\\.?/~`'
		d = 0
		j = ''
		for i in range(len(s)):
			if s[i] in uc:
				a = a + 1
			if s[i] in lc:
				b = b + 1
			if s[i] in n:
				c = c + 1
			if s[i] in sc:
				d = d + 1
		return (a, b, c, d)


class Solution:

	def count(self, s):
		upp = 0
		loww = 0
		num = 0
		sp = 0
		for i in s:
			if i.isupper():
				upp += 1
			elif i.islower():
				loww += 1
			elif i.isdigit():
				num += 1
			else:
				sp += 1
		return [upp, loww, num, sp]


class Solution:

	def count(self, s):
		a = [0, 0, 0, 0]
		for i in s:
			if i.isupper():
				a[0] += 1
			elif i.islower():
				a[1] += 1
			elif i.isdigit():
				a[2] += 1
			else:
				a[3] += 1
		return a


class Solution:

	def count(self, s):
		arr = [0, 0, 0, 0]
		for ele in s:
			if ele.isupper():
				arr[0] = arr[0] + 1
			if ele.islower():
				arr[1] = arr[1] + 1
			if ele.isdigit():
				arr[2] = arr[2] + 1
			if not ele.isalnum():
				arr[3] = arr[3] + 1
		return arr


class Solution:

	def count(self, s):
		lowers = 0
		uppers = 0
		specials = 0
		numerics = 0
		N = len(s)
		for x in list(s):
			if x.islower():
				lowers += 1
			elif x.isupper():
				uppers += 1
			elif x.isnumeric():
				numerics += 1
			else:
				specials += 1
		return [uppers, lowers, numerics, specials]


class Solution:

	def count(self, s):
		l = 0
		m = 0
		n = 0
		k = 0
		for i in range(len(s)):
			if 'A' <= s[i] <= 'Z':
				l += 1
			elif 'a' <= s[i] <= 'z':
				m += 1
			elif '0' <= s[i] <= '9':
				n += 1
			else:
				k += 1
		return (l, m, n, k)


class Solution:

	def count(self, s):
		up = lo = di = sp = 0
		for i in s:
			if i.isupper():
				up += 1
			elif i.islower():
				lo += 1
			elif i.isdigit():
				di += 1
			else:
				sp += 1
		return (up, lo, di, sp)


class Solution:

	def count(self, s):
		(up, lc, sc, nvc) = (0, 0, 0, 0)
		res = []
		for i in s:
			if i in 'abcdefghijklmnopqrstuvwxyz':
				up += 1
			elif i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
				lc += 1
			elif i in '0123456789':
				nvc += 1
			else:
				sc += 1
		res.append(lc)
		res.append(up)
		res.append(nvc)
		res.append(sc)
		return res


class Solution:

	def count(self, s):
		u = 0
		l = 0
		n = 0
		S = 0
		for i in range(len(s)):
			if s[i].isupper():
				u = u + 1
			elif s[i].islower():
				l = l + 1
			elif s[i].isnumeric():
				n = n + 1
			else:
				S = S + 1
		return (u, l, n, S)


class Solution:

	def count(self, s):
		res = [0, 0, 0, 0]
		for i in s:
			if i.isupper():
				res[0] += 1
			elif i.islower():
				res[1] += 1
			elif i.isnumeric():
				res[2] += 1
			else:
				res[3] += 1
		return res


class Solution:

	def count(self, s):
		c = 0
		o = 0
		u = 0
		n = 0
		for i in s:
			if i.isupper():
				c += 1
			elif i.islower():
				o += 1
			elif i.isalnum():
				u += 1
			else:
				n += 1
		return (c, o, u, n)


class Solution:

	def count(self, s):
		lc = 'abcdefghijklmnopqrstuvwxyz'
		uc = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
		num = '0123456789'
		cl = 0
		cu = 0
		cs = 0
		cn = 0
		a = []
		for i in s:
			if i in lc:
				cl += 1
			elif i in uc:
				cu += 1
			elif i in num:
				cn += 1
			else:
				cs += 1
		a.append(cu)
		a.append(cl)
		a.append(cn)
		a.append(cs)
		return a


class Solution:

	def count(self, s):
		n = len(s)
		S = [0, 0, 0, 0]
		for i in range(n):
			if s[i].isupper():
				S[0] += 1
			elif s[i].islower():
				S[1] += 1
			elif s[i].isdigit():
				S[2] += 1
			else:
				S[3] += 1
		return S


class Solution:

	def count(self, s):
		upper = 0
		lower = 0
		num = 0
		spcl = 0
		for i in s:
			if i.isupper():
				upper += 1
			elif i.islower():
				lower += 1
			elif i.isnumeric():
				num += 1
			else:
				spcl += 1
		return (upper, lower, num, spcl)


class Solution:

	def count(self, s):
		u = 0
		l = 0
		d = 0
		sp = 0
		for i in s:
			if i.isupper():
				u = u + 1
			elif i.islower():
				l = l + 1
			elif i.isnumeric():
				d = d + 1
			else:
				sp = sp + 1
		return [u, l, d, sp]


class Solution:

	def count(self, s):
		u = 0
		l = 0
		n = 0
		c = 0
		for i in s:
			if i.isupper():
				u += 1
			elif i.islower():
				l += 1
			elif i.isnumeric():
				n += 1
			else:
				c += 1
		return (u, l, n, c)


class Solution:

	def count(self, s):
		countSpecial = countDigit = countCapital = countSmall = 0
		for i in s:
			ch = ord(i)
			if ch >= 32 and ch <= 47:
				countSpecial += 1
			elif ch >= 48 and ch <= 57:
				countDigit += 1
			elif ch >= 58 and ch <= 64 or (ch >= 91 and ch <= 96) or (ch >= 123 and ch <= 126):
				countSpecial += 1
			elif ch >= 65 and ch <= 90:
				countCapital += 1
			elif ch >= 96 and ch <= 122:
				countSmall += 1
		return [countCapital, countSmall, countDigit, countSpecial]


class Solution:

	def count(self, s):
		upper_count = 0
		lower_count = 0
		digit_count = 0
		other_count = 0
		for i in s:
			if i.isupper():
				upper_count += 1
			elif i.islower():
				lower_count += 1
			elif i.isdigit():
				digit_count += 1
			else:
				other_count += 1
		return (upper_count, lower_count, digit_count, other_count)


class Solution:

	def count(self, s):
		nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '0']
		upp = low = num = spe = 0
		for char in s:
			if char.isupper() == True:
				upp += 1
			if char.islower() == True:
				low += 1
			if char in nums:
				num += 1
			if char.isalnum() == False:
				spe += 1
		return (upp, low, num, spe)


class Solution:

	def count(self, s):
		upperc = 0
		lowerc = 0
		numc = 0
		specc = 0
		for char in s:
			if char.isupper():
				upperc += 1
			elif char.islower():
				lowerc += 1
			elif char.isnumeric():
				numc += 1
			else:
				specc += 1
		return [upperc, lowerc, numc, specc]


class Solution:

	def count(self, S):
		l = len(S)
		num = 0
		cap = 0
		low = 0
		spl = 0
		for i in range(l):
			if S[i].isdigit():
				num += 1
			elif ord(S[i]) >= 65 and ord(S[i]) <= 90:
				cap += 1
			elif ord(S[i]) >= 97 and ord(S[i]) <= 122:
				low += 1
			else:
				spl += 1
		return (cap, low, num, spl)


class Solution:

	def count(self, s):
		arr = [0] * 4
		for i in s:
			if i.isalpha():
				if i.isupper():
					arr[0] += 1
				else:
					arr[1] += 1
			elif i.isdigit():
				arr[2] += 1
			else:
				arr[3] += 1
		return arr


class Solution:

	def count(self, s):
		Up = 0
		Low = 0
		sp = 0
		num = 0
		for i in range(0, len(s)):
			if s[i] >= 'A' and s[i] <= 'Z':
				Up += 1
			elif s[i] >= 'a' and s[i] <= 'z':
				Low += 1
			elif s[i] in ['1', '2', '3', '4', '5', '6', '7', '8', '9', '0']:
				num += 1
			else:
				sp += 1
		return (Up, Low, num, sp)


class Solution:

	def count(self, s):
		uc = 0
		lc = 0
		digit = 0
		sp = 0
		for i in s:
			if i.isupper():
				uc += 1
			elif i.islower():
				lc += 1
			elif i.isdigit():
				digit += 1
			else:
				sp += 1
		return (uc, lc, digit, sp)


class Solution:

	def count(self, s):
		up = 0
		low = 0
		nums = 0
		spchar = 0
		arr = []
		for i in range(0, len(s)):
			if s[i] >= 'A' and s[i] <= 'Z':
				up += 1
			elif s[i] >= 'a' and s[i] <= 'z':
				low += 1
			elif s[i] in ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']:
				nums += 1
			else:
				spchar += 1
		arr.append(up)
		arr.append(low)
		arr.append(nums)
		arr.append(spchar)
		return arr


class Solution:

	def count(self, s):
		l = len(s)
		li = [0, 0, 0, 0]
		for i in range(l):
			if s[i].isupper():
				li[0] += 1
			elif s[i].islower():
				li[1] += 1
			elif s[i].isdigit():
				li[2] += 1
			else:
				li[3] += 1
		return li


class Solution:

	def count(self, s):
		upp = 0
		low = 0
		num = 0
		spec = 0
		for i in s:
			if i.isupper():
				upp += 1
			elif i.islower():
				low += 1
			elif i.isnumeric():
				num += 1
			else:
				spec += 1
		return (upp, low, num, spec)


class Solution:

	def count(self, s):
		(up, lo, nu, sp) = (0, 0, 0, 0)
		for i in range(len(s)):
			if ord(s[i]) >= 65 and ord(s[i]) <= 90:
				up += 1
			elif ord(s[i]) >= 97 and ord(s[i]) <= 122:
				lo += 1
			elif ord(s[i]) >= 48 and ord(s[i]) <= 57:
				nu += 1
			else:
				sp += 1
		count = [up, lo, nu, sp]
		return count


class Solution:

	def count(self, s):
		uppercase_characters = 0
		lowercase_characters = 0
		numeric_characters = 0
		special_characters = 0
		l = []
		for i in s:
			if i.isupper():
				uppercase_characters += 1
			elif i.islower():
				lowercase_characters += 1
			elif i.isnumeric():
				numeric_characters += 1
			else:
				special_characters += 1
		return [uppercase_characters, lowercase_characters, numeric_characters, special_characters]


class Solution:

	def count(self, s):
		uppercount = 0
		lowercount = 0
		numcount = 0
		specialcount = 0
		for i in s:
			if i.isupper():
				uppercount += 1
			elif i.islower():
				lowercount += 1
			elif i.isdigit():
				numcount += 1
			else:
				specialcount += 1
		arr = [0] * 4
		arr[0] = uppercount
		arr[1] = lowercount
		arr[2] = numcount
		arr[3] = specialcount
		return arr


class Solution:

	def count(self, s):
		u = 0
		l = 0
		n = 0
		sc = 0
		for j in s:
			if j >= 'A' and j <= 'Z':
				u += 1
			elif j >= 'a' and j <= 'z':
				l += 1
			elif j >= '0' and j <= '9':
				n += 1
			else:
				sc += 1
		return [u, l, n, sc]


class Solution:

	def count(self, s):
		(lw, up, sp, nm) = (0, 0, 0, 0)
		for i in s:
			if i.islower():
				lw += 1
			elif i.isupper():
				up += 1
			elif i.isnumeric():
				nm += 1
			else:
				sp += 1
		return [up, lw, nm, sp]


class Solution:

	def count(self, s):
		uc = 0
		lc = 0
		nc = 0
		sc = 0
		for i in s:
			if i.islower():
				lc = lc + 1
			elif i.isupper():
				uc = uc + 1
			elif i.isnumeric():
				nc = nc + 1
			else:
				sc = sc + 1
		return (uc, lc, nc, sc)


class Solution:

	def count(self, s):
		c1 = 0
		c2 = 0
		c3 = 0
		c4 = 0
		for i in s:
			if i.isupper():
				c1 += 1
			elif i.islower():
				c2 += 1
			elif i.isdigit():
				c3 += 1
			else:
				c4 += 1
		return [c1, c2, c3, c4]


class Solution:

	def count(self, s):
		a = 0
		b = 0
		c = 0
		d = 0
		for i in s:
			if i.isupper():
				a += 1
			elif i.islower():
				b += 1
			elif i.isdigit():
				c += 1
			else:
				d += 1
		return (a, b, c, d)


class Solution:

	def count(self, s):
		n = 0
		m = 0
		d = 0
		sc = 0
		for i in s:
			if i.isupper():
				n += 1
			elif i.islower():
				m += 1
			elif i.isdigit():
				d += 1
			else:
				sc += 1
		return [n, m, d, sc]


class Solution:

	def count(self, s):
		upper = 0
		lower = 0
		numeric = 0
		special = 0
		for i in range(len(s)):
			if s[i].isupper():
				upper += 1
			elif s[i].islower():
				lower += 1
			elif s[i].isalnum():
				numeric += 1
			else:
				special += 1
		return (upper, lower, numeric, special)


class Solution:

	def count(self, s):
		(upper_count, lower_count, numeric_count, special_count) = (0, 0, 0, 0)
		for i in s:
			if i.isupper():
				upper_count += 1
			elif i.islower():
				lower_count += 1
			elif i.isnumeric():
				numeric_count += 1
			else:
				special_count += 1
		return [upper_count, lower_count, numeric_count, special_count]


class Solution:

	def count(self, s):
		L = [0] * 4
		for i in range(len(s)):
			if s[i].isupper():
				L[0] += 1
			elif s[i].islower():
				L[1] += 1
			elif s[i].isnumeric():
				L[2] += 1
		L[3] = len(s) - (L[0] + L[1] + L[2])
		return L


class Solution:

	def count(self, s):
		upper = 0
		lower = 0
		digit = 0
		spe = 0
		for i in s:
			if i.isalpha():
				if i.isupper():
					upper += 1
				else:
					lower += 1
			elif i.isnumeric():
				digit += 1
			else:
				spe += 1
		return (upper, lower, digit, spe)


class Solution:

	def count(self, s):
		count_lower = 0
		count_upper = 0
		count_numeric = 0
		count_special = 0
		for value in s:
			if value.islower():
				count_lower += 1
			elif value.isupper():
				count_upper += 1
			elif value.isnumeric():
				count_numeric += 1
			else:
				count_special += 1
		return (count_upper, count_lower, count_numeric, count_special)


class Solution:

	def count(self, s):
		CountLower = 0
		CountUpper = 0
		CountSpecial = 0
		CountNumeric = 0
		for i in s:
			if i.isupper():
				CountUpper += 1
			elif i.islower():
				CountLower += 1
			elif i.isnumeric():
				CountNumeric += 1
			else:
				CountSpecial += 1
		return (CountUpper, CountLower, CountNumeric, CountSpecial)


class Solution:

	def count(self, s):
		count = 0
		countn = 0
		countl = 0
		countu = 0
		for i in s:
			if i.isnumeric():
				countn += 1
			elif i.islower():
				countl += 1
			elif i.isupper():
				countu += 1
			else:
				count += 1
		return [countu, countl, countn, count]


class Solution:

	def count(self, s):
		lowercase_count = 0
		uppercase_count = 0
		special_count = 0
		numeric_count = 0
		for char in s:
			if char.islower():
				lowercase_count += 1
			elif char.isupper():
				uppercase_count += 1
			elif char.isdigit():
				numeric_count += 1
			else:
				special_count += 1
		return (uppercase_count, lowercase_count, numeric_count, special_count)


class Solution:

	def count(self, s):
		cl = 0
		sl = 0
		n = 0
		sc = 0
		for i in s:
			a = ord(i)
			if a >= 48 and a <= 57:
				n += 1
			elif a >= 97 and a <= 122:
				sl += 1
			elif a >= 65 and a <= 90:
				cl += 1
			else:
				sc += 1
		return (cl, sl, n, sc)


import string

class Solution:

	def count(self, s):
		arr = [0, 0, 0, 0]
		u = l = n = 0
		for i in s:
			if i in string.ascii_uppercase:
				u = u + 1
		arr[0] = u
		for i in s:
			if i in string.ascii_lowercase:
				l = l + 1
		arr[1] = l
		for i in s:
			if i.isdigit():
				n = n + 1
		arr[2] = n
		arr[3] = len(s) - (arr[0] + arr[1] + arr[2])
		return arr


class Solution:

	def count(self, s):
		count_upper = 0
		count_small = 0
		count_number = 0
		count_special = 0
		upper_char = 'ASDFGHJKLZXCVBNMQWERTYUIOP'
		small_char = 'asdfghjklzxcvbnmqwertyuiop'
		number_char = '1234567890'
		for i in s:
			if i in upper_char:
				count_upper += 1
			elif i in small_char:
				count_small += 1
			elif i in number_char:
				count_number += 1
			else:
				count_special += 1
		return (count_upper, count_small, count_number, count_special)


class Solution:

	def count(self, s):
		c_u = 0
		c_l = 0
		c_n = 0
		c_s = 0
		for i in s:
			if i.islower():
				c_l += 1
			elif i.isupper():
				c_u += 1
			elif i.isnumeric():
				c_n += 1
			else:
				c_s += 1
		return [c_u, c_l, c_n, c_s]


class Solution:

	def count(self, s):
		up = 0
		low = 0
		digit = 0
		special = 0
		for i in s:
			if i.isupper():
				up += 1
			elif i.islower():
				low += 1
			elif i.isdigit():
				digit += 1
			else:
				special += 1
		return (up, low, digit, special)


class Solution:

	def count(self, s):
		(l, u, n, s1) = (0, 0, 0, 0)
		for i in range(len(s)):
			if s[i].islower():
				l += 1
			elif s[i].isupper():
				u += 1
			elif s[i].isdigit():
				n += 1
			else:
				s1 += 1
		return (u, l, n, s1)


class Solution:

	def count(self, s):
		(l, u, d, c) = (0, 0, 0, 0)
		for i in s:
			if i.isupper():
				u += 1
			elif i.islower():
				l += 1
			elif i.isdigit():
				d += 1
			else:
				c += 1
		return [u, l, d, c]


class Solution:

	def count(self, s):
		lower = 0
		upper = 0
		numeric = 0
		special = 0
		for c in s:
			if c.islower():
				lower += 1
			elif c.isupper():
				upper += 1
			elif c.isdigit():
				numeric += 1
			else:
				special += 1
		return (upper, lower, numeric, special)


class Solution:

	def count(self, str):
		(upper_ctr, lower_ctr, number_ctr, special_ctr) = (0, 0, 0, 0)
		for i in range(len(str)):
			if str[i] >= 'A' and str[i] <= 'Z':
				upper_ctr += 1
			elif str[i] >= 'a' and str[i] <= 'z':
				lower_ctr += 1
			elif str[i] >= '0' and str[i] <= '9':
				number_ctr += 1
			else:
				special_ctr += 1
		return [upper_ctr, lower_ctr, number_ctr, special_ctr]


class Solution:

	def count(self, s):
		upper_count = 0
		lower_count = 0
		special_count = 0
		digit_count = 0
		for char in s:
			if char.isupper():
				upper_count += 1
			elif char.islower():
				lower_count += 1
			elif char.isdigit():
				digit_count += 1
			else:
				special_count += 1
		return (upper_count, lower_count, digit_count, special_count)


class Solution:

	def count(self, s):
		l = 0
		d = 0
		u = 0
		s1 = 0
		for i in s:
			if i >= 'a' and i <= 'z':
				l = l + 1
			elif i >= 'A' and i <= 'Z':
				u = u + 1
			elif i.isdigit():
				d = d + 1
			else:
				s1 = s1 + 1
		return (u, l, d, s1)