Title: Shell Sort
About: Shell sort python program
Name: Thejaswin S
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

Its a new Feature.

Describe the solution you'd like...

I would like to add the program to sort numbers using Shell sort in min time complexity and space complexity.

Approach to be followed (optional):

language to be used is python and comments will be added to code.

Title: Segment tree creation
About: Aim is to create project to create a segment tree based on a given array
Name: Pushpit Jain
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

Segment tree are an efficient way of preprocessing the array, where all array elements are leaf nodes, and the internal nodes store some processed data. These can decrease time complexity of the range sum queries or any other operations and thus is very commonly used.

Describe the solution you'd like...
I will use the python lists to store the values and use an iterative approach to create the segment tree

Please assign me this issue under Devincept21

Title: Bubble Sort in python
Name: SIDDHI BHANUSHALI
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
N.A.its a new feature.

Describe the solution you'd like...
I would like to add Bubble sort solution.

Describe alternatives you've considered?

Approach to be followed (optional):

I would first give the problem link and then through comments,I will explain my approach

Title: Fibonacci series
About: The aim is to use recursion to get a Fibonacci series till 'n'
Name: Dhruv Varshney
Label: Feature Request
Assignee: 'dhruv-varshney'

Define You:

• DevIncept Participant

• Contributor

Is your feature request related to a problem? Please describe.

The Fibonacci numbers are the sequence of numbers that is defined by the recurrence relation

Fn = Fn-1 + Fn-2

Describe the solution you'd like...

I will use Recursion to solve this issue.

Title: implementation of queue using list
Name: PRIYANKA V
Label: Feature Request
Assignee: ''

Define You:

✅ DevIncept Participant
Contributor

Is your feature request related to a problem? Please describe.
Its a new feature.

Describe the solution you'd like...
There are various ways to implement a queue in Python. This article covers the implementation of queue using data structures and modules from Python library.
Queue in Python can be implemented by the following ways:
list
collections.deque
queue.Queue

Describe alternatives you've considered?

Approach to be followed (optional):

This program contains the implementation of queue using list :
List is a Python’s built-in data structure that can be used as a queue. Instead of enqueue() and dequeue(), append() and pop() function is used. However, lists are quite slow for this purpose because inserting or deleting an element at the beginning requires shifting all of the other elements by one, requiring O(n) time.

Title: Graph Coloring Problem
About: The aim is to solve Graph Coloring Problem.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

The motive is to solve graph coloring problem. Given an undirected graph and an integer M. The task is to determine if the graph can be colored with at most M colors such that no two adjacent vertices of the graph are colored with the same color.

Describe the solution you'd like...

Use backtracking to solve the issue.

Title: Sudoku Solver
About: The aim is to solve any sudoku by using Backtracking
Name: Dhruv Varshney
Label: Feature Request
Assignee: 'dhruv-varshney'

Define You:

• DevIncept Participant

• Contributor

Is your feature request related to a problem? Please describe.

There is a grid that contains nine squares which are then subdivided into a further nine smaller squares in such a way that every number appears once in each horizontal line, vertical line, and square. The grid is basically a 9*9 matrix and the empty small boxes will have a value of "0" which get replaced by the correct value which satisfies all the sudoku rules

Describe the solution you'd like...

I will use backtracking to solve this issue.

I want to add the python code for Fibonacci Search under DCP'21
Please assign me this issue

Title: Strings
Name: Sushmitha N J
Label: Feature Request
Assignee: ''

Define You:

✅ DevIncept Participant
Contributor

Is your feature request related to a problem? Please describe.
Its a new feature.

Describe the solution you'd like...
In Python, Strings are arrays of bytes representing Unicode characters. However, Python does not have a character data type, a single character is simply a string with a length of 1. string is an immutable sequence data type. Square brackets can be used to access elements of the string.
Describe alternatives you've considered?

Approach to be followed (optional):

This program contains of operations on string methods:

isupper() | Returns True if all characters in the string are upper case
lower() method returns a string where all characters are lower case.
replace() method replaces a specified phrase with another specified phrase.
isnumeric() method returns True if all the characters are numeric (0-9), otherwise False.

Title: Check Palindrome with recursion
About: The aim is to come up with a solution for this problem using Recursion.
Name: Pushpit Jain
Label: Feature Request

Define You:

✅ DevIncept Participant
Contributor

Is your feature request related to a problem? Please describe.
Palindromes are very famous and required many a times. The motive is to check if the entered string by the user is a palindrome using recursion.

Describe the solution you'd like...
Create a function which returns True or False if the input string is palindrome or not using string slicing and recursion.

Input values : string
Output value : true or false

Please Assign me this issue under DEVINCEPT 21

Title: Cryptarithmetic Problem
About: The aim is to solve the Cryptarithmetic Problem: SEND MORE MONEY.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

The motive is to solve a cryptarithmetic problem. Cryptarithmetic problems are mathematical puzzles where digits are replaced by symbols. And the aim is to find unique digits(0-9) that the letters should represent, such that they satisfy the given constraints.

Describe the solution you'd like...

Use backtracking to solve the issue.

Title: Determining DNA Health Problem
About: Find and print the respective total healths of the unhealthiest (minimum total health) and healthiest (maximum total health) strands of DNA as two space-separated values on a single line, where gene sequence is given as an array input.
Name: Abhishek Sharma
Label: Feature Request
Assignee: abhisheks008''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
An array of beneficial gene strings genes = [g0, g1,...,gn-1], . Note that these gene sequences are not guaranteed to be distinct.
An array of gene health values, health = [h0,h1,...,hn-1] , where each h_i is the health value for gene .
A set of s DNA strands where the definition of each strand has three components, start ,end , and d, where d string is a DNA for which g_start,....,g_end genes are healthy.

Find and print the respective total healths of the unhealthiest (minimum total health) and healthiest (maximum total health) strands of DNA as two space-separated values on a single line.

Problem statement link : https://www.hackerrank.com/challenges/determining-dna-health/problem

Describe the solution you'd like...
Here I am going to use Aho-Corasick algorithm for groups of genes and Knuth–Morris–Pratt algorithm for single genes. To lower memory consumption and to use processor cache better, processing grouped not as all relevant searches for one query together but as all queries for one search element (gene group or single gene) together. The time complexity of this approach is O(L_g . s . d + n^(1/d) . L_q)

Please assign me this issue @prathimacode-hub

This problem will be added in the Strings repository

Language : Python 3

Title: Subset Sum
About: The aim is to solve Subset Sum Problem.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

The motive is to solve subset sum problem. From a list of integers, the aim is to check and return a set of integers whose sum will be equal to the target value K.

Describe the solution you'd like...

Use backtracking to solve the issue.

Title: N Queens
About: The aim is to come up with a solution for this problem using backtracking.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

The motive is to place N queens in a N*N Chessboard such that no two queens attack each other. A queen is said to be attacked by another queen if they share same diagonal(right/left), Row or Column.

Describe the solution you'd like...

Use backtracking to solve the issue.

Title: Water Jug Problem
About: The aim is to solve Water Jug Problem using BFS or DFS as per user's choice using backtracking.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

You are given a 'm' liter jug and a 'n' liter jug where '0<m<n'. Both the jugs are initially empty. The jugs don't have markings
to allow measuring smaller quantities. You have to use the jugs to measure 'd' liters of water where 'd<n'. Determine the minimum no of operations to be performed to obtain 'd' liters of water in one of jug.

Describe the solution you'd like...

Use BFS/DFS and backtracking in AI to solve the issue.

Title: K-Means Clustering Algorithm on Iris Dataset
About: Aim is to write a code in python to predict optimal number of clusters and represent it visually
Name: Drishti Baranwal
Label: Feature Request
Assignee:

Never work on master branch. Kindly fork it to your local repository before you start contributing.

Title: Predicting House Prices
Algorithm : Multiple Linear Regression
About: Predicting the prices of the houses based given parameters.
Name: Abhishek Sharma
Label: Feature Request
Assignee: abhisheks008''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
Charlie wants to buy a house. He does a detailed survey of the area where he wants to live, in which he quantifies, normalizes, and maps the desirable features of houses to values on a scale of 0 to 1 so the data can be assembled into a table. If Charlie noted F features, each row contains F space-separated values followed by the house price in dollars per square foot (making for a total of F+1 columns). If Charlie makes observations about H houses, his observation table has H rows. This means that the table has a total of (F + 1) x H entries.

Unfortunately, he was only able to get the price per square foot for certain houses and thus needs your help estimating the prices of the rest! Given the feature and pricing data for a set of houses, help Charlie estimate the price per square foot of the houses for which he has compiled feature data but no pricing.

Now predict the house using the multiple linear regression algorithm

Problem statement link : https://www.hackerrank.com/challenges/predicting-house-prices/problem

Difficulty at HackerRank : Expert

Describe the solution you'd like...
I am going to use Multiple Linear Regression as per the question given

Please assign me this issue @prathimacode-hub

This problem will be added in the Artificial Intelligence repository

Language : Python 3

Title: Binary Search in python
Name: SIDDHI BHANUSHALI
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
N.A.its a new feature.

Describe the solution you'd like...
I would like to add binary search solution.

Describe alternatives you've considered?

Approach to be followed (optional):

through comments,I will explain my approach and add a readme for examples and Output ss

Title: Mobile Price Range Classification
About: Implementing step by step Logistic Regression algorithm in python with help of a project i.e. Mobile Price Range Classification to classify the target variable(price_range) with value of 0(low cost), 1(medium cost), 2(high cost) and 3(very high cost) .
Name: Ayushi Shrivastava
Label: Feature Request
Assignee: 'ayushi424'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

I want to contribute step by step implementation of logistic regression algorithm using a project as Mobile Price Range Classification to classify the target variable(price_range) with value of 0(low cost), 1(medium cost), 2(high cost) and 3(very high cost) with the project structure as mentioned.

Describe the solution you'd like...

Implementing Logistic Regression Algorithm using a project as Mobile Price Range Classification with following step:

Data training using the mobile price classification dataset. Model creation which will include importing logistic regression from sklearn, initializing the classifier, then fit the training data into it and perform classification.

Dataset to be used
https://www.kaggle.com/iabhishekofficial/mobile-price-classification?select=train.csv

I want to add a merge sort algorithm based on divide and conquer.

Title: Transposition Cipher
About: Code for decryption/encryption of string using Transposition cipher.
Name: Ritika Chand
Label: Feature Request
Assignee: ''

Define You:

✅DevIncept Participant
Contributor

Is your feature request related to a problem? Please describe.

The motive is to decrypt or encrypt the entered string by the user , using Transposition cipher technique. The key value shall also be entered by the user and the user has the choice to decrypt or encrypt. Transposition cipher can be done either by shuffling the columns or without shuffling.

Describe the solution you'd like...
Create two classes which will be used to decrypt the entered string and encrypt the string , according to the choice of the user.

Input values : ENCRYPTED/DECRYPTED STRING , KEY VALUE

Please Assign me this issue under DEVINCEPT 21

Title: Binary tree to DLL
About: Aim is to create project to convert a binary tree to a doubly linked list in place following in-order
Name: Pushpit Jain
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

This is called flattening a binary tree used to convert data stored in a tree to a 1d data structure. The challenge is to do it in-place while following the in-order traversal.

Describe the solution you'd like...
I will use the python class to create a nodes for the binary tree / dll, and the left and right pointers in nodes are to be used as previous and next pointers in converted DLL.

Please assign me this issue under Devincept21

Title: Segment tree Range sum query
About: Aim is to create project to do range sum query on a segment tree based on a given array
Name: Pushpit Jain
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

Segment tree are an efficient way of preprocessing the array, where all array elements are leaf nodes, and the internal nodes store some processed data. These can decrease time complexity of the range sum queries (O(logn)) or any other operations and thus is very commonly used.

Describe the solution you'd like...
I will use the python lists to store the values and use an iterative approach to do the range sum query on the segment tree

Please assign me this issue under Devincept21

Title: Segment tree update query
About: Aim is to create project to do update query on a segment tree based on a given array
Name: Pushpit Jain
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

Segment tree are an efficient way of preprocessing the array, where all array elements are leaf nodes, and the internal nodes store some processed data. These can decrease time complexity of the update queries (O(logn)) or any other operations and thus is very commonly used.

Describe the solution you'd like...
I will use the python lists to store the values and use an iterative approach to update the segment tree

Please assign me this issue under Devincept21

Title: Doubly Linked List
About: Doubly Linked List implementation in Python.
Name: NanthaKumar
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
No. I wants to add new feature.

Describe the solution you'd like...
A Doubly Linked List is a type of Linked List in which nodes are bi-directionally connected. It consist of operations like add, delete, update, insert. So that we can use this as an alternative of arrays.

Title: Heap Sort
About: Add solution in python to sort array/list of numbers
Name: Thejaswin S
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

• New Feature, I would like to add efficient python code to sort numbers using Heap Sort.

Describe the solution you'd like...

• I would like to solve in O(nlogn) time complexity.

Describe alternatives you've considered?

Approach to be followed (optional):

Additional context

• A solution code along with explanation comments will be given.

Title: 8 Puzzle Problem using A star Algorithm
About: The aim is to solve 8 Puzzle Problem using A star Algorithm in AI.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

An instance of the n-puzzle game consists of a board holding n^{2}-1 distinct movable tiles, plus an empty space. The tiles are numbers from the set 1,..,n^{2}-1. For any such board, the empty space may be legally swapped with any tile horizontally or vertically adjacent to it. In this assignment, the blank space is going to be represented with the number 0. Given an initial state of the board, the combinatorial search problem is to find a sequence of moves that transitions this state to the goal state; that is, the configuration with all tiles arranged in ascending order 0,1,..,n^{2}-1.

Describe the solution you'd like...

Use an AI algorithm, A* to solve the problem.

Title: Infix to Postfix Conversion
About: Aim is to perform the conversion using stacks
Name: Pushpit Jain
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

It is an important application of stack and gives many advantages over infix expression like -
Any formula can be expressed without parenthesis.
It is very convenient for evaluating formulas on computer with stacks.
Postfix expression doesn't has the operator precedence.
Postfix is slightly easier to evaluate.
It reflects the order in which operations are performed.
You need to worry about the left and right associativity

Describe the solution you'd like...
I will use the stacks data structure, to store the operators and convert the infix expression to equivalent postfix expression

Please assign me this issue under Devincept21

Contribute to this respository to shower your love towards this project and getting started with Open Source/Github.

Title: All indices of an element in array.
About: I would like to add solution to this problem.
Name: SIDDHI BHANUSHALI
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
No.

Describe the solution you'd like...
I would like to add solution to this problem.

Describe alternatives you've considered?

Approach to be followed (optional):
I will be adding this in array folder by making a new folder named all indices of array and initializing with a readme.

Additional context

Title: Tic Tac Toe Game
About: The aim is to build a game of Tic Tac Toe using backtracking algorithm, MiniMax.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

Minimax is a kind of backtracking algorithm. It searches, recursively, the best move that leads the Max player to win or not lose (draw). It considers the current state of the game and the available moves at that state, then for each valid move, it plays (alternating min and max) until it finds a terminal state (win, draw or lose). I would like to use this for building the game.

Describe the solution you'd like...

Use MiniMax in AI to solve the issue.

Title: K-Means Clustering Algorithm for customer segmentation
About: Aim is to write a code in python to divide the customers in different groups.
Name: Drishti Baranwal
Label: Feature Request
Assignee:

I would like to make a notepad with detailed list structure from declaration to all operations and a related read me.

Title: 8 Puzzle Problem using BFS.
About: The aim is to solve 8 Puzzle Problem using BFS in AI.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

An instance of the n-puzzle game consists of a board holding n^{2}-1 distinct movable tiles, plus an empty space. The tiles are numbers from the set 1,..,n^{2}-1. For any such board, the empty space may be legally swapped with any tile horizontally or vertically adjacent to it. In this assignment, the blank space is going to be represented with the number 0. Given an initial state of the board, the combinatorial search problem is to find a sequence of moves that transitions this state to the goal state; that is, the configuration with all tiles arranged in ascending order 0,1,..,n^{2}-1.

Describe the solution you'd like...

Use an AI algorithm, BFS to solve the problem.

Title: Average Calculator
About: The aim is to calculate average of all the distinct integers entered by the user.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

The average of only unique integers entered by user, will get printed out.

Describe the solution you'd like...

Use arrays and sets in python to solve the problem.

Title: Binary Search Tree in python
Name: NEHA JHA
Label: Feature Request
Assignee: ''

Define You:

✅ DevIncept Participant
Contributor

Is your feature request related to a problem? Please describe.
Its a new feature.

Describe the solution you'd like...
IMPLEMENTATION OF BINARY SEARCH TREE (BST)
Binary Search Tree is a special type of binary tree where:
1. The value of all the nodes in the left sub-tree is less than or equal to the value of the root.
2. The value of all the nodes in the right sub-tree is greater than value of the root.
3. This rule will be recursively applied to all the left and right sub-trees of the root.

Describe alternatives you've considered?

Approach to be followed (optional):

This program contains the menu-based implementation of the basic operations on a BST:
1. Insert Node into BST
2. Search Node in BST
3. Delete Node in BST
4. Print BST (inorder way)

Title: Singly Linked List
About: Singly Linked List implementation by nodes.
Name: NanthaKumar
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
No. I wants to add new feature.

Describe the solution you'd like...
A Singly Linked List which is implemented by nodes, consist of basic linked opertions like add, delete, update, insert.

Title: Caesar Cipher
About: The aim is to come up with a decryption/encryption to the entered encrypted/decrypted value using caesar cipher
Name: Shiwansh Raj
Label: Feature Request
Assignee: ''

Define You:

✅DevIncept Participant
Contributor

Is your feature request related to a problem? Please describe.
The motive is to decrypt or encrypt the entered string by the user , using Caesar cipher technique. The key value shall also be entered by the user as well as the user will be given to choice to decrypt or encrypt.

Describe the solution you'd like...
Create two classes which will be used to decrypt the entered string and encrypt the string , according to the choice of the user.

Decrypting/Encrypting input string entered by the user .

Input values : ENCRYPTED/DECRYPTED STRING , KEY VALUE

Please Assign me this issue under DEVINCEPT 21

Title: Insertion Sort
About: Write python code on insertion sort
Name: Ritika Chand
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

Sorting an array.

Describe the solution you'd like...
Making a code for insertion sort and counting no. of swaps and comparisons that are made.

Title: Selection Sort in python
Name: SIDDHI BHANUSHALI
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
N.A.its a new feature.

Describe the solution you'd like...
I would like to add Selection sort solution.

Describe alternatives you've considered?

Approach to be followed (optional):

through comments,I will explain my approach and add a readme for examples and Output ss

Title: Implementation of Breadth First Search using Graphs in python
Name: Apeksha M Prabhu
Label: Feature Request
Assignee: ''

Define You:

✅ DevIncept Participant
Contributor

Is your feature request related to a problem? Please describe.
Its a new feature.

Describe the solution you'd like...
Implementation of Breadth First Search

BFS stands for Breadth First Search is a vertex based technique for finding a shortest path in graph. It uses a Queue data structure which follows first in first out. In BFS, one vertex is selected at a time when it is visited and marked then its adjacent are visited and stored in the queue. It is slower than DFS.

Title: Knight's Tour
About: The aim is to come up with a solution for this problem using backtracking.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

The motive is to check whether it is possible for a Knight to visit each cell of the N*N chessboard without visiting any cell twice starting from (X, Y) position. User will enter the chessboard size and a solution (if exists) will be printed.

Describe the solution you'd like...

Use backtracking to solve the issue.

Title: Expression tree Evaluation
About: Aim is to write a code in python to evaluate the expression tree
Name: Pushpit Jain
Label: Feature Request
Assignee:

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

Expression trees are used to represent expressions in form of a tree. For a mathematical expression, its evaluation will give the equivalent result.

Describe the solution you'd like...

Use tree structure to create an expression tree, with each node being a class object. Then use recursive approach to solve the expression.

Please assign me this issue under Devincept21

Title: Hamiltonian Cycle
About: The aim is to look for a Hamiltonian cycle in the graph provided by user using backtracking.
Name: Manasi Chhibber
Label: Feature Request
Assignee: 'Manasi2001'

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

The motive is to determine the existence of a Hamiltonian Cycle in the provided undirected graph and return the path if such path exist.

Describe the solution you'd like...

Use backtracking to solve the issue.

Consider starring this repository if you found this project helpful.

Can I take up the array structure and Add all operations with code and a readme explaining all the details.

Title: Linear Search in python
Name: SIDDHI BHANUSHALI
Label: Feature Request
Assignee: ''

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.
N.A.its a new feature.

Describe the solution you'd like...
I would like to add linear search solution.

Describe alternatives you've considered?

Approach to be followed (optional):

through comments,I will explain my approach and add a readme for examples and Output ss

Title: Find Angle MBC
About: Solving a geometric question using Python 3.7.
Name: Abhishek Sharma
Label: Feature Request
Assignee: abhisheks008

Define You:

• DevIncept Participant
• Contributor

Is your feature request related to a problem? Please describe.

ABC is a right triangle with 90° at B
Therefore ∠ABC = 90°
Point M is the midpoint of hypotenuse .
You are given the lengths AB and BC.
Your task is to find ∠MBC (angle θ°, as shown in the figure) in degrees.

Problem statement link : https://www.hackerrank.com/challenges/find-angle/problem

Difficulty at HackerRank : Medium

Describe the solution you'd like...
Using Geometrical approach to make a generalize solution using the Python 3.7 language

Please assign me this issue @prathimacode-hub

This problem will be added in the Geometry repository

Language : Python 3.7