|
14 | 14 | | 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 | | 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 | 16 | | Bubble Sort | [bubbleSort.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/bubble_sort.py) | |
17 | | -| | []() | |
18 | | -| | []() | |
19 | | -| | []() | |
20 | | -| | []() | |
| 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 | +| 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 | +| 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) | |
| 20 | +| Given a graph, there are two methods to perform traversal on it. <br> |
| 21 | +1. Depth First Search (DFS) <br> 2. Breadth First Search (BFS) | [dfs_bfs.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/dfs_bfs.py) | |
21 | 22 | | | []() | |
22 | 23 | | | []() | |
23 | 24 | | | []() | |
|
0 commit comments