I am very much excited for sharing my experience for Amazon, I went through 6 rounds and really enjoyed a lot for facing all of… Read More

Given an array of integers, sort the array according to frequency of elements. For example, if the input array is {2, 3, 2, 4, 5,… Read More

Hi, I was recently interviewed for SDE1 position for Amazon, Hyderabad but was not able to make it through. Although I wasn’t selected but it… Read More

Given two strings ‘X’ and ‘Y’, find the length of the longest common substring. Examples : Input : X = “GeeksforGeeks”, y = “GeeksQuiz” Output :… Read More

Given a string str, the task is to find the minimum number of characters to be inserted to convert it to palindrome.Before we go further,… Read More

Given a dictionary of words and an input string, find the longest prefix of the string which is also a word in dictionary. Examples: Let… Read More

Following is a typical recursive implementation of QuickSort for arrays. The implementation uses last element as pivot. C++ /* A typical recursive implementation of Quicksort… Read More

In the previous post, we introduced B-Tree. We also discussed search() and traverse() functions. In this post, insert() operation is discussed. A new key is… Read More

A Bipartite Graph is a graph whose vertices can be divided into two independent sets, U and V such that every edge (u, v) either… Read More

Hi, I was recently interviewed for SDE1 position for Amazon and got selected. I have 1.5 year experience in java. Geeksforgeeks helped me lot. I… Read More

Introduction: B-Tree is a self-balancing search tree. In most of the other self-balancing search trees (like AVL and Red-Black Trees), it is assumed that everything… Read More

Hi, I am Mayur Kale,I was recently interviewed for SDE1 position for Amazon in our campus and got selected. Geeksforgeeks helped me lot. I prepared… Read More

Consider a situation where you don’t have function to calculate power (pow() function in C) and you need to calculate x^n where x can be… Read More

Hi, This is Pandu. About 1 month back I had attended Amazon Interview In Hyderabad, it was total of 8 rounds which includes 2 telephonic… Read More

Which of the following is the best possible time complexity to get Nth Fibonacci number with O(1) extra space (A) Time complexity T(n) is T(n-1)… Read More

Featured Articles

View All