Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit e810e23

Browse files
Update README.md
1 parent 8fc48b3 commit e810e23

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

‎README.md‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -27,11 +27,11 @@
2727
| Given an array of integers, write a function that returns true if there is a triplet (a, b, c) that satisfies a^2 + b^2 = c^2. | [find_pythagoras_triplet.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/find_pythagoras_triplet.py) |
2828
| Given a binary tree, find the second largest node in it | [find_second_largest_in_binary_tree.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/find_second_largest_in_binary_tree.py) |
2929
| Write a function that computes the list of the first 100 Fibonacci numbers | [first_n_fibo.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/first_n_fibo.py) |
30-
| | []() |
31-
| | []() |
32-
| | []() |
33-
| | []() |
34-
| | []() |
30+
| Given an input string, it gives the first non repeating character in it | [first_non_repeating.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/first_non_repeating.py) |
31+
| Given an input string, find the first recurring character in it. | [first_recurring_character.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/first_recurring_character.py) |
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+
| 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+
| Tree Data Structure in Python | [general_tree_structure.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/general_tree_structure.py) |
3535
| | []() |
3636
| | []() |
3737
| | []() |

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /