1)A general permutation question that if 400 students shake hands with each other then total time for this process(assume time for one handshake).
2) If a number N is given then print all the prime numbers till N.
1)A discussion on how google API for nearby venue works
2)Return true if any two nodes’ sum is zero in BST otherwise false.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.