You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+6-4Lines changed: 6 additions & 4 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -83,10 +83,12 @@ The LCA of n1 and n2 in T is the shared ancestor of n1 and n2 that is located fa
83
83
| Given a sentence, reverse each word but don't reverse the sentence |[reverse_words.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/reverse_words.py)|
84
84
| Given a matrix, rotate it by 180 degree |[rotateMatrix180Deg.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/rotateMatrix180Deg.py)|
85
85
| Find Median from Data Stream of integers |[running_median_integers.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/running_median_integers.py)|
86
-
||[]()|
87
-
||[]()|
88
-
||[]()|
89
-
||[]()|
86
+
| Given a sorted array in which all elements appear twice (one after one) and one element appears only once. Find that element Constraints: in O(log n) complexity. |[search_unique.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/search_unique.py)|
87
+
| A simple implementation of Selection Sort |[selection_sort.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/selection_sort.py)|
88
+
| A simple implementation of Stack Data Structure |[stack_data_structure.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/stack_data_structure.py)|
89
+
| The span Si of the stock’s price on a given day i is defined as the maximum number of consecutive days just before the given day, for which the price of the stock on the current day is less than or equal to its price on the given day.<br>
90
+
91
+
Problem: We have a series of n daily price quotes for a stock and we need to calculate span of stock’s price for all n days | [stock_span.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/stock_span.py) |
0 commit comments