Copy questions from devops-exercisese to this repo

Author: abregman

README.md

@@ -0,0 +1,20 @@
+# Count Substring
+
+## Objectives
+
+In this challenge, the user enters a string and a substring. You have to print the number of times that the substring occurs in the given string. String traversal will take place from left to right, not from right to left.
+
+NOTE: String letters are case-sensitive.
+
+Sample Input
+
+ABCDCDC
+CDC
+
+Sample Output
+
+2
+
+## Solution
+
+Click [here](solution.py) to view the solution

exercises/count_substring/exercise.md

@@ -0,0 +1,16 @@
+#!/usr/bin/env python
+# coding=utf-8
+
+def count_substring(string, sub_string):
+    count = 0
+    for i in range(len(string)):
+        if string[i:].startswith(sub_string):
+            count += 1
+    return count
+
+if __name__ == '__main__':
+    string = input().strip()
+    sub_string = input().strip()
+    
+    count = count_substring(string, sub_string)
+    print(count)

exercises/count_substring/solution.py

@@ -0,0 +1,28 @@
+# Find the Runner-Up Score! (HackerRank Challenge)
+
+The following challenge is from [HackerRank](https://www.hackerrank.com/challenges/find-second-maximum-number-in-a-list/problem)
+
+Given the participants' score sheet for your University Sports Day, you are required to find the runner-up score. You are given  scores. Store them in a list and find the score of the runner-up.
+
+Input Format
+
+The first line contains . The second line contains an array   of  integers each separated by a space.
+
+Constraints
+
+Output Format
+
+Print the runner-up score.
+
+Sample Input 0
+
+5
+2 3 6 6 5
+
+Sample Output 0
+
+5
+
+## Solution
+
+Click [here](solution.py) to view the solution.

exercises/lists/find_the_runner_up_score/exercise.md

@@ -0,0 +1,13 @@
+#!/usr/bin/env python
+# coding=utf-8
+
+if __name__ == '__main__':
+    n = int(input())
+    arr = map(int, input().split())
+
+    # remove duplicates
+    arr = list(dict.fromkeys(arr))
+    # sort
+    arr.sort()
+
+    print(arr[-2])

exercises/lists/find_the_runner_up_score/solution.py

@@ -0,0 +1,28 @@
+# Nested Lists - HackerRank
+
+Note: This question is from [HackerRank](https://www.hackerrank.com/challenges/nested-list/problem)
+
+Given the names and grades for each student in a class of  students, store them in a nested list and print the name(s) of any student(s) having the second lowest grade.
+
+Sample Input 0
+
+5
+Harry
+37.21
+Berry
+37.21
+Tina
+37.2
+Akriti
+41
+Harsh
+39
+
+Sample Output 0
+
+Berry
+Harry
+
+## Solution
+
+Click [here](solution.py) to view the solution.

exercises/lists/nested_lists/exercise.md

@@ -0,0 +1,14 @@
+#!/usr/bin/env python
+# coding=utf-8
+
+scores_stats = []
+
+for _ in range(0,int(input())):
+    scores_stats.append([input(), float(input())])
+
+# Make a unique list of score, sort it and get the lowest second score
+second_lowest = sorted(list(set([score for name, score in scores_stats])))[1]
+
+# Iterate over the list of scores and names and print every match to the
+# lowest score we got above
+print('\n'.join([a for a,b in sorted(scores_stats) if b == second_lowest]))

exercises/lists/nested_lists/solution.py

@@ -0,0 +1,7 @@
+# Remove Duplicates
+
+Note: this question is taken from [LeetCode](https://leetcode.com)
+
+## Objectives
+
+Given an integer list nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

exercises/lists/remove_duplicates/exercise.md

@@ -0,0 +1,4 @@
+#!/usr/bin/env python
+# coding=utf-8
+
+

exercises/lists/remove_duplicates/solution.py

@@ -0,0 +1,16 @@
+# Swap Case - HackerRank
+
+## Objectives
+
+You are given a string and your task is to swap cases. In other words, convert all lowercase letters to uppercase letters and vice versa.
+
+For Example:
+
+```
+Www.HackerRank.com → wWW.hACKERrANK.COM
+Pythonist 2 → pYTHONIST 2
+```
+
+## Solution
+
+Click [here](solution.py) to view the solution

exercises/swap_case/exercise.md

@@ -0,0 +1,16 @@
+#!/usr/bin/env python
+# coding=utf-8
+
+def swap_case(s):
+    string = ""
+    for c in s:
+        if c == c.upper():
+            string += c.lower()
+        else:
+            string += c.upper()
+    return string
+
+if __name__ == '__main__':
+    s = input()
+    result = swap_case(s)
+    print(result)