Skip to content
Gblog Crack the Coding Interview With GeeksforGeeks Weekly Contest Series
“The difference between ordinary and extraordinary is practice”, quoted by Vladamir Horowitz. What he said was nothing sort of unique as achieving perfection and success… Read More
SAP LABS CAME TO OUR CAMPUS FOR BOTH R&D UNIT BANGALORE AND CONSULTANCY GURGAON. SAP LABS Procedure consists of 6 rounds. 1) ONLINE EXAM 2)… Read More
A Binary Heap is a Binary Tree with following properties. 1) It’s a complete tree (All levels are completely filled except possibly the last level… Read More
This article is continuation of following three articles: Ukkonen’s Suffix Tree Construction – Part 1 Ukkonen’s Suffix Tree Construction – Part 2 Ukkonen’s Suffix Tree… Read More
Enumeration (or enum) is a user defined data type in C. It is mainly used to assign names to integral constants, the names make a… Read More
A piecewise linear function f(x) is plotted using thick solid lines in the figure below (the plot is drawn to scale). If we use the… Read More
A K-D Tree(also called as K-Dimensional Tree) is a binary search tree where data in each node is a K-Dimensional point in space. In short,… Read More
Online written 20MCQS + 2 coding question in hacker rank 1. Find the pattern in string (Use Kmp) 2. Rotate matrix by 90. See in… Read More
This article is continuation of following two articles: Ukkonen’s Suffix Tree Construction – Part 1 Ukkonen’s Suffix Tree Construction – Part 2 Please go through… Read More
We have discussed Threaded Binary Tree. The idea of threaded binary trees is to make inorder traversal faster and do it without stack and without… Read More
How do they make those Awesome Animation movies? How does it feel to work for a film like ‘How to Train your Dragon 2 ‘… Read More
?I like to thanks geeksforgeeks.org for my ?entire journey in placement. Round->1 (multiple choice questions) 1. Intersection of two linked list. 2. There is a… Read More
Given a 32 bit floating point number x stored in IEEE 754 floating point format, find inverse square root of x, i.e., x-1/2.A simple solution… Read More
Hi, Recently i had interviews with Amazon. 1st Round (Telephonic): 1. Given an integer array and a constant number X, print all pair of number… Read More
In Ukkonen’s Suffix Tree Construction – Part 1, we have seen high level Ukkonen’s Algorithm. This 2nd part is continuation of Part 1. Please go… Read More
3 months Experience Candidate. 1. Written test 90 mins which consisted of 2 coding questions and 18-20 MCQ from varied computer science concepts. 2. Telephonic… Read More

Start Your Coding Journey Now!