Added leetcode Solutions

Author: Jivandandapat07

QuickSort.py

@@ -0,0 +1,46 @@
+# Python program for implementation of Quicksort Sort
+
+# This function takes last element as pivot, places
+# the pivot element at its correct position in sorted
+# array, and places all smaller (smaller than pivot)
+# to left of pivot and all greater elements to right
+# of pivot
+def partition(arr, low, high):
+    i = (low - 1)         # index of smaller element
+    pivot = arr[high]     # pivot
+
+    for j in range(low, high):
+        # If current element is smaller than the pivot
+        if arr[j] < pivot:
+
+            # increment index of smaller element
+            i = i + 1
+            arr[i], arr[j] = arr[j], arr[i]
+
+    arr[i + 1], arr[high] = arr[high], arr[i + 1]
+    return i + 1
+
+# The main function that implements QuickSort
+# arr[] --> Array to be sorted,
+# low  --> Starting index,
+# high  --> Ending index
+
+# Function to do Quick sort
+def quick_sort(arr, low, high):
+    if low < high:
+        # pi is partitioning index, arr[p] is now
+        # at right place
+        pi = partition(arr, low, high)
+
+        # Separately sort elements before
+        # partition and after partition
+        quick_sort(arr, low, pi - 1)
+        quick_sort(arr, pi + 1, high)
+
+
+# Driver code to test above
+if __name__ == '__main__':
+    arr = [10, 7, 8, 9, 1, 5]
+    n = len(arr)
+    quick_sort(arr, 0, n - 1)
+    print("Sorted array is:", arr)

README.md

@@ -1,13 +1 @@
-# leetcode-solutions
-
-# start contributing to this small open source project and learn how to contribute to projects.
-
-# step 1: Fork this repository
-# step 2:Clone the repository
-# step 3:Create a branch
-# step 4:Make necessary changes and commit those changes
-# step 5:Push changes to GitHub
-# step 6: Submit your changes for review
-
-
-solve leetcode problems and add there solution file here as well.
+![Python-Hacktoberfest2021](https://socialify.git.ci/Krushna-Prasad-Sahoo/Python-Hacktoberfest2021/image?description=1&descriptionEditable=A%20beginner%20friendly%20repository%20for%20Hacktoberfest%202021%20where%20you%20can%20contribute%20programs%20in%20Python.&forks=1&issues=1&language=1&pulls=1&stargazers=1&theme=Dark)

palindromeCheck.py

@@ -0,0 +1,18 @@
+#Check whether a string is palindrome or not using recursion
+
+def palindrome(s):
+    if len(s) < 1:
+        return True
+    else:
+        if s[0] == s[-1]:
+            return palindrome(s[1:-1])
+        else:
+            return False
+#input 
+NewStr=input("Enter A String : ")
+
+if palindrome(NewStr) == True:
+    print("Its Palindrome")
+else:
+    print("Not Palindrome")
+    

perform the binary search.py

@@ -0,0 +1,23 @@
+# Python program to perform  binary search
+def binary_search(arr, target):
+    low = 0
+    high = len(arr) - 1
+    while low <= high:
+        mid = (low + high) // 2
+        if arr[mid] == target:
+            return mid
+        if arr[mid] > target:
+            high = mid - 1
+        else:
+            low = mid + 1
+    return -1
+
+
+arr = list(map(int,input().split()))
+target = int(input("Enter the item to be searched: "))
+result = binary_search(arr, target)
+if result == -1:
+    print("Item not found")
+else:
+    print("Item found at index: ", result)
+

perform the linear search.py

@@ -0,0 +1,15 @@
+#Python program to perform the linear search
+def linearsearch(lst, target):
+    for i in range(len(lst)):
+        if lst[i] == target:
+            return i
+    return -1
+
+
+lst = [7,5,48,15,9,5,123,45,35]
+item = int(input("Enter the item to be searched: "))
+index = linearsearch(lst, item)
+if index == -1:
+    print("Item not found")
+else:
+    print("Item found at index: ", index)

qrcode.py

@@ -0,0 +1,14 @@
+import pyqrcode
+import png
+from pyqrcode import QRCode
+  
+  
+# String which represents the QR code
+s = "https://github.com/karandesai24"
+  
+# Generate QR code
+url = pyqrcode.create(s)
+
+  
+# Create and save the png file naming "myqr.png"
+url.png('myqr.png', scale = 6)