Skip to content

Commit 018d3dc

Browse files
authored
Update README.md
1 parent 25669b0 commit 018d3dc

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -41,8 +41,8 @@ We are given two arrays that represent the arrival and departure times of trains
4141
| Heap Data Structure | [heap_structure.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/heap_structure.py) |
4242
| Print numbers 1 to 100 without using any numbers or integers | [hundred_without_int.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/hundred_without_int.py) |
4343
| Write a program to convert interger to Roman Representation | [interger_to_roman_num.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/interger_to_roman_num.py) |
44-
| | []() |
45-
| | []() |
44+
| Given two sorted array of sizes m and n in which all elements are distinct. Find the common elements between them | [intersection_arrays.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/intersection_arrays.py) |
45+
| Check if a matrix is symmetric or not | [isMatrixSymmetric.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/isMatrixSymmetric.py) |
4646
| | []() |
4747
| | []() |
4848
| | []() |

0 commit comments

Comments
 (0)