|
13 | 13 | | (DONE)Given an array , find if the number exists, develop a `recursive` implementation of the binary search. If the element is not found it returns -1 | [binary_search_recursive.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/binary_search_recursive.py) | |
14 | 14 | | (UNDONE) Bresenham Line Algorithm (BLA) is one of the earliest algorithms developed in computer graphics. It is used for drawing lines | [bresenham_line_algorithm.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/bresenham_line_algorithm.py) | |
15 | 15 | |(DONE) Find the no. of nodes in a BST that lies in a given range | [bst_nodes_in_range.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/bst_nodes_in_range.py) | |
16 | | -|(Done)Bubble Sort | [bubbleSort.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/bubble_sort.py) | |
| 16 | +|(DONE)Bubble Sort | [bubbleSort.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/bubble_sort.py) | |
17 | 17 | | Find the angle made by the hour hand and the minute hand at any given time. Assume it is an analog clock | [calculateClockAngle.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/calculateClockAngle.py) | |
18 | 18 | | Two strings of sizes m and n are given, we have to find how many characters need to be removed from both the string so that they become anagrams of each other | [check_anagrams.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/check_anagrams.py) | |
19 | 19 | | Find the numbers which are semiprimes, within a given range. A semiprime is a product of two prime numbers, not necessarily distinct. Squares of prime numbers are also semiprimes. | [check_semiprime.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/check_semiprime.py) | |
|
0 commit comments