## GATE | GATE-CS-2003 | Question 42

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 »

## K Dimensional Tree | Set 1 (Search and Insert)

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. My Personal… Read More »

## Amazon interview Experience | Set 141 (For SDE1)

Online written 20MCQS + 2 coding question in hacker rank 1. Find the pattern in string (Use Kmp) 2. Rotate matrix by 90. Write your… Read More »

## Convert a Binary Tree to Threaded binary tree | Set 1 (Using Queue)

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 »

## [TopTalent.in] Interview with Chirag Who Got into DreamWorks

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 »

## Microsoft Interview Experience | Set 39 (On-Campus)

?I like to thanks geeksforgeeks.org for my ?entire journey in placement. Write your Interview Experience or mail it to contribute@geeksforgeeks.org My Personal Notes arrow_drop_up Save… Read More »

## Fast method to calculate inverse square root of a floating point number in IEEE 754 format

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… Read More »

## Amazon interview Experience | Set 140 (Experienced for SDE)

Hi, Recently i had interviews with Amazon. 1st Round (Telephonic): Write your Interview Experience or mail it to contribute@geeksforgeeks.org My Personal Notes arrow_drop_up Save  Practice… Read More »

## Ukkonen’s Suffix Tree Construction – Part 2

In Ukkonen’s Suffix Tree Construction – Part 1, we have seen high level Ukkonen’s Algorithm. This 2nd part is continuation of Part 1. My Personal… Read More »

## Amazon interview Experience | Set 139

3 months Experience Candidate. 1. Written test 90 mins which consisted of 2 coding questions and 18-20 MCQ from varied computer science concepts. Write your… Read More »

## Serialize and Deserialize an N-ary Tree

Given an N-ary tree where every node has at-most N children. How to serialize and deserialze it? Serialization is to store tree in a file… Read More »

## Ukkonen’s Suffix Tree Construction – Part 1

Suffix Tree is very useful in numerous string processing and computational biology problems. My Personal Notes arrow_drop_up Save Practice Tags : Pattern Searching

## Serialize and Deserialize a Binary Tree

Serialization is to store tree in a file so that it can be later restored. The structure of tree must be maintained. My Personal Notes… Read More »

## Print all elements in sorted order from row and column wise sorted matrix

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. My… Read More »