Round 1:
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.
Round 2:
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.
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
11 Jul, 2019
Like Article
Save Article