Jobs
Interviews

Geeksforgeeks

With the idea of imparting programming knowledge, Mr. Sandeep Jain, an IIT Roorkee alumnus started a dream- GeeksforGeeks. Whether programming excites you or you feel stifled, wondering how to prepare for interview questions or how to ace data structures and algorithms, GeeksforGeeks is the one-stop solution for you. With every tick of time, we are adding arrows in our quiver. From articles on various computer science subjects to programming problems for practice, from basic to premium courses, from technologies to entrance examinations, we have been building ample content with superior quality. In a short span, we have built a community of 30 Million+ Geeks around the world, 20,000+ Contributors and 500+ Campus Ambassadors in various colleges across the nation. Our success stories include a lot of students who benefited in their placements and landed jobs at tech giants. So start exploring the plethora of resources that GeeksforGeeks has to offer and start your journey of becoming more skilled and employable!

Interview Questions for Geeksforgeeks

1. You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition: struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL. Initially, all next pointers are set to NULL.

2. How can hashing be used on a 2D matrix to count the maximum number of 1s?

3. What is a load balancer?

4. Write articles on DSA.

5. How do you perform effective keyword research?