Find the given integer in the given list of integers and print the number of occurrences of that integer in the list.

**INPUT**
Enter the Elements: 64 34 7 12 22 11 7
Enter the integer to find: 7
**OUTPUT**
2 # Prints the no:of occurrences of the integer 7 as given in input

Elements = list(map(int,input("Enter the Elements: ").split(" "))) S = int(input("Enter the integer to find: ")) count=0 for i in range(len(Elements)): if Elements[i] == S: count = count+1 print(count)

**INPUT_1:**

Enter the Elements: 64 34 7 12 22 11 7

Enter the integer to find: 7

**OUTPUT:**

2

**INPUT_2:**

Enter the Elements: 7 64 34 45 34 24 29 34

Enter the integer to find: 34

**OUTPUT:**

3

**INPUT_3:**

Enter the Elements: 69 58 42 32 2 5 165 25 2000

Enter the integer to find: 2000

**OUTPUT:**

1

**INPUT_4:**

Enter the Elements: 56 98 45 25 99 98

Enter the integer to find: 98

**OUTPUT:**

2

**ILLUSTRATION**

**Morae Q!**

- OS operating system module using path parameter.
- Find the smallest and largest integers after sorting using bubble sort.
- Find the integer and its number of occurrences.
- Algorithm complexity – Big O Notation with Examples.
- Linear search.
- Map module using series mapping and parallel mapping.
- Mapping and Transposing with Map Module.
- Map Module/built-in Function.
- Linux commands for managing files.
- Program which takes two lists and maps two lists into a dictionary.
- Splitting strings and substituting using regular expressions regex.
- Basics of regular expression Regex.
- Find the square value of the dictionary.
- Check whether the given key is present in the dictionary.
- Matching an expression only in specific places using regular expressions.
- Escaping special characters using regular expressions.
- Check the key.
- Grouping and sub-grouping using regular expressions.
- Generate a Dictionary that Contains Numbers in the Form (x , x*x).
- Algorithm complexity Big-Theta, Big-Omega and Big-O Notations.