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
+3-7Lines changed: 3 additions & 7 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -32,8 +32,7 @@
32
32
| Given a string, find the first non-repeating character in it. For example, if the input string is "GeeksforGeeks", then output should be ‘f’ and if input string is "GeeksQuiz", then output should be ‘G’. |[first_unique_letter.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/first_unique_letter.py)|
33
33
| Write a function that given a list of non negative integers, arranges them such that they form the largest possible number. For example, given [50, 2, 1, 9], the largest formed number is 95021 |[gen_largest_num_frm_list.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/gen_largest_num_frm_list.py)|
34
34
| Tree Data Structure in Python |[general_tree_structure.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/general_tree_structure.py)|
35
-
| Given the arrival and departure times of all trains that reach a railway station, the task is to find the minimum number of platforms required for the railway station so that no train waits.
36
-
We are given two arrays that represent the arrival and departure times of trains that stop. | [getMinPlatforms.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/getMinPlatforms.py) |
35
+
| Given the arrival and departure times of all trains that reach a railway station, the task is to find the minimum number of platforms required for the railway station so that no train waits.<br /><br />We are given two arrays that represent the arrival and departure times of trains that stop.|[getMinPlatforms.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/getMinPlatforms.py)|
37
36
| Print duplicate characters in a string |[get_dup_chars.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/get_dup_chars.py)|
38
37
| Check if a given array has zero sum sub array |[hasZeroSumSubArray.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/hasZeroSumSubArray.py)|
39
38
| Given a string, check if it only contains digits |[has_only_digits.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/has_only_digits.py)|
@@ -54,8 +53,7 @@ We are given two arrays that represent the arrival and departure times of trains
54
53
| Implement Level Order traversal for a binary tree |[level_order_tree.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/level_order_tree.py)|
55
54
| Linked List Data Structure |[linked_list_data_structure.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/linked_list_data_structure.py)|
56
55
| Detect if a linked list has a loop |[loop_in_linkedlist.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/loop_in_linkedlist.py)|
57
-
| Find the Lowest Common ancestor between two nodes in a binary search tree. Let T be a rooted tree. The lowest common ancestor between two nodes n1 and n2 is defined as the lowest node in T that has both n1 and n2 as descendants (where we allow a node to be a descendant of itself).
58
-
The LCA of n1 and n2 in T is the shared ancestor of n1 and n2 that is located farthest from the root. | [lowest_common_ancestor.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/lowest_common_ancestor.py) |
56
+
| Find the Lowest Common ancestor between two nodes in a binary search tree. Let T be a rooted tree. The lowest common ancestor between two nodes n1 and n2 is defined as the lowest node in T that has both n1 and n2 as descendants (where we allow a node to be a descendant of itself).<br /><br />The LCA of n1 and n2 in T is the shared ancestor of n1 and n2 that is located farthest from the root. |[lowest_common_ancestor.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/lowest_common_ancestor.py)|
59
57
| A majority element in an array A[] of size n is an element that appears more than n/2 times. Find the majority element in the given array. |[majority_element.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/majority_element.py)|
60
58
| Find the max number in an array without using built-in functions |[max_in_array.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/max_in_array.py)|
61
59
| Given a list of positive and negative numbers, find the maximum subarray sum. Constraint: Solve it in O(n) |[maximum_subarray_sum.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/maximum_subarray_sum.py)|
@@ -86,9 +84,7 @@ The LCA of n1 and n2 in T is the shared ancestor of n1 and n2 that is located fa
86
84
| 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
85
| A simple implementation of Selection Sort |[selection_sort.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/selection_sort.py)|
88
86
| 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) |
87
+
| 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 /><br />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