GeeksforGeeks

Given a string, eliminate all “b” and “ac” in the string, you have to replace them in-place, and you are only allowed to iterate over the string once. (Source Google Interview Question)

Given an array of integers. Find a peak element in it. An array element is peak if it is NOT smaller than its neighbors. For corner elements, we need to consider only one neighbor.

My Google Interview Experience, [Hope this is helpful] I am AnandhaKumar .P – 2012 IT pass out from College Of Engineering Guindy, Anna University.

A directed graph is strongly connected if there is a path between all pairs of vertices.

Write a function to detect if two trees are isomorphic. Two trees are called isomorphic if one of them can be obtained from other by a series of flips, i.e. by swapping left and right children of a number of nodes.

Given a Weighted Directed Acyclic Graph and a source vertex in the graph, find the shortest paths from given source to all other vertices.

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge uv, vertex u comes before v in the ordering.

I have attended the interview for Software Development Engineer position and got the offer from Amazon.

Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be changed.

Tower Research Capital LLC is a financial services firm located in New York that specializes in quantitative trading and investment strategies. 

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 them and

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, 12, 2, 3, 3, 3, 12}, then modify the array to {3, 3, 3, 3, 2, 2, 2, 12, 12, 4, 5}.

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 was a good experience and GeeksforGeeks has been very helpful.

Given two strings ‘X’ and ‘Y’, find the length of the longest common substring. For example, if the given strings are “GeeksforGeeks” and “GeeksQuiz”, the output should be 5 as longest common substring is “Geeks”

Given a string, find the minimum number of characters to be inserted to convert it to palindrome.

Given a dictionary of words and an input string, find the longest prefix of the string which is also a word in dictionary.

Following is a typical recursive implementation of QuickSort for arrays. The implementation uses last element as pivot.

In the previous post, we introduced B-Tree. We also discussed search() and traverse() functions.

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 connects a vertex from U to V or a vertex from V to U.

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 am very thankful to Geeksforgeeks team.

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 is in main memory. To understand use of B-Trees, we must think of huge amount of data that cannot fit in main memory.

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 only from Geeksforgeeks.org. I am very thankful to Geeksforgeeks team.

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 and 6 face to face and the whole process was lasted about 25 days because of unavailability of all the interviewers.

Meet Prasoon, he was just your average guy who studied at IIIT-Hyderabad but today Prasoon Mishra is one of the most well know names across engineering colleges across India.

Given two binary strings that represent value of two integers, find the product of two strings. For example, if the first bit string is “1100″ and second bit string is “1010″, output should be 120.