Skip to content
Gblog Bi-Wizard School Coding Tournament By GeeksforGeeks – For Class 8-12 Students
Bi-Wizard School Coding Tournament by GeeksforGeeks – ‘Coding is the New Literacy’ and no one can deny this fact! And especially, when it comes to… Read More
In daily share trading, a buyer buys shares in the morning and sells them on the same day. If the trader is allowed to make… Read More
What is Handshaking Lemma? Handshaking lemma is about an undirected graph. In every finite undirected graph, an even number of vertices will always have an odd… Read More
Given a graph with both directed and undirected edges. It is given that the directed edges don’t form cycle. How to assign directions to undirected… Read More
I applied here from their career page and was asked to attend 5 rounds and I cleared all of them and landed into a full… Read More
Given a list of word lists How to print all sentences possible taking one word from a list at a time via recursion? Example:  Input: {{"you",… Read More
I was interviewed for windows developer. Round 1 – telephonic About yourself Work done on windows platform What is mvvm What is data binding Difference… Read More
Given a Binary Tree and a key to be searched in it, write an iterative method that returns true if key is present in Binary… Read More
I applied off-campus for internship. I got a call that my resume is shortlisted. Selection procedure consist of 4 rounds. Round 1: Online Coding Round… Read More
An interval is represented as a combination of start time and end time. Given a set of intervals, check if any two intervals intersect.  Examples: … Read More
Hi, Recently I was interviewed for the SDE-I for Amazon, Chennai. Round 1(Online Round): 1. Given two linked lists. Add them. e.g 1–>2–>3 3–>4 Output:… Read More
Design a data structure that supports the following operations in Θ(1) time.insert(x): Inserts an item x to the data structure if not already present.remove(x): Removes… Read More
I applied of off campus for the internship. Selection consist of five rounds. I cleared all the rounds. Round 1: (Online Coding Test on Hacker… Read More
Given a Binary Tree, find the maximum(or minimum) element in it. For example, maximum in the following Binary Tree is 9.    Recommended: Please solve… Read More
Given an array of integers print the missing elements that lie in range 0-99. If there are more than one missing, collate them, otherwise just… Read More
Round 1 Q1. Multiply two 2d matrices  Q2 You are given a stack in which elements are filled at runtime. And standard push and pop operation.… Read More

Start Your Coding Journey Now!