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 ce0b743

Browse files
Update README.md
1 parent 048f25e commit ce0b743

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
@@ -24,8 +24,8 @@
2424
| Given a linked list, this method will return m'th element to the last 2->3->4->8->5; m=2 will return 8 since 8 is second to last | [find_m_to_last_llist.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/find_m_to_last_llist.py) |
2525
| Given an array of numbers, find all the pairs of numbers which sum upto `k`| [find_pairs_sum_k.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/find_pairs_sum_k.py) |
2626
| Given an array of numbers, find all the pairs of numbers whose product is `k` | [find_products_pair_k.py](https://github.com/devAmoghS/Python-Interview-Problems-for-Practice/blob/master/find_products_pair_k.py) |
27-
| | []() |
28-
| | []() |
27+
| 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) |
28+
| 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
| | []() |
3030
| | []() |
3131
| | []() |

0 commit comments

Comments
(0)

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