Skip to content
All Medium Articles
I would like to thank the entire Geeksforgeeks team, whose contribution has helped me a lot in my preparation for the interviews and getting placed… Read More
Take a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many more! Check out our Data… Read More
Take a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many more! Check out our Data… Read More
The worst case search time for a sorted linked list is O(n). With a Balanced Binary Search Tree, we can skip almost half of the… Read More
Phone screen – I  1. Fibonacci series without using an array – this is a typical favorite question w.r.t. Dynamic Programming where you will ask… Read More
Given a rope of length n meters, cut the rope in different parts of integer lengths in a way that maximizes product of lengths of… Read More
Predict output of following programTake a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many more!… Read More
The lower bound for Comparison based sorting algorithm (Merge Sort, Heap Sort, Quick-Sort .. etc) is Ω(nLogn), i.e., they cannot do better than nLogn.  Counting… Read More
Output of following programTake a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many more! Check… Read More
Oracle Interview-Server Tech. ========== Round 1: ========== 1. Explain Tree traversals. Given a inorder and postorder construct a tree 2. What is fork? How many… Read More
In C++, const qualifier can be applied to 1) Member functions of a class 2) Function arguments 3) To a class data member which is… Read More
Assume that an integer and a pointer each takes 4 bytes. Also, assume that there is no alignment in objects. Predict the output following program.… Read More
Predict the output of following programTake a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many… Read More
Written Test: 10 Aptitude 30 Programming 10 CS Fundamentals There’s negative marking, plus there’s sectional cutoff, so you have to be very careful, and risky… Read More
I recently got interviewed for a position in Cisco. The organization came to our college for on-campus recruitment. First round: The first round had 30… Read More
Morgan Stanley interview experience 1st round: (90 minutes) It was multiple choice questions round. It consists of 3 sections:Hey geek! It's time to become a… Read More
Is it possible to create a doubly linked list using only one pointer with every node. (A) Not Possible (B) Yes, possible by storing XOR… Read More
Given Inorder and Preorder traversals of a binary tree, print Postorder traversal. Example:Become a success story instead of just reading about them. Prepare for coding… Read More
How can we make a C++ class such that objects of it can only be created using new operator? If user tries to create an… Read More
In a weighted graph, assume that the shortest path from a source ‘s’ to a destination ‘t’ is correctly calculated using a shortest path algorithm.… Read More

Start Your Coding Journey Now!