Skip to content
Gblog Must Do Coding Questions for Product Based Companies
As the placement season is back, GeeksforGeeks is here to help you crack the interview. We have selected some most commonly asked and MUST DO… 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.Become a success… Read More
Given an N-ary tree where every node has at-most N children. How to serialize and deserialize it? Serialization is to store tree in a file… Read More
Suffix Tree is very useful in numerous string processing and computational biology problems. Many books and e-resources talk about it theoretically and in few places,… Read More
Serialization is to store tree in a file so that it can be later restored. The structure of tree must be maintained. Deserialization is reading… Read More
Given an n x n matrix, where every row and column is sorted in non-decreasing order. Print all elements of matrix in sorted order.Example:   Input:… Read More
Screening round: Three coding question on hackerEarth to be comiled against the testcases 1. Merge two sorted linked list into single one 2. Difference between… Read More