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
First Round Amcat(English, logical reasoning, aptitude, c, c++ output based questions) Second Round GD Third Round (technical) Resume based questions, about projects, string based questions,… Read More
F2F Round 1: 1. Tell me about yourself. 2. Tell me about any challenging work you did in any of your past projects, why was… Read More
Consider the following C function. unsigned fun(unsigned n) {     if (n == 0) return 1;     if (n == 1) return 2;        return fun(n-1) +… Read More
Given a text string and a pattern string, check if a pattern exists in text or not.Few pattern searching algorithms (KMP, Rabin-Karp, Naive Algorithm, Finite… Read More
The top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree,… Read More
Experience: 5 months F2F: 1st round 1. Tell me about your college project. 2. Write a Code to check if linked list is a palindrome… Read More
Given a positive number n, count all distinct Non-Negative Integer pairs (x, y) that satisfy the inequality x*x + y*y < n.  Examples: Input: n… Read More
Nobody could enjoy that moment more than him. He could barely put his feelings in words in achieving that feat. Such was his joy in… Read More
Round 1: Telephonic Q1. Implement some functionalities of Minesweeper like connected component search and game termination check etc. Q2. Linked list random pointer question: Clone… Read More
Written Round: Paper 1 (20 minutes) The questions were based on C programming language it consisted of basic output questions. There was 2.5 for correct… Read More
This article is continuation of following five articles: Ukkonen’s Suffix Tree Construction – Part 1 Ukkonen’s Suffix Tree Construction – Part 2 Ukkonen’s Suffix Tree Construction – Part… Read More
This article is continuation of following four articles: Ukkonen’s Suffix Tree Construction – Part 1 Ukkonen’s Suffix Tree Construction – Part 2 Ukkonen’s Suffix Tree… Read More
The main application of Binary Heap is as implement a priority queue. Binomial Heap is an extension of Binary Heap that provides faster union or… Read More
Recently I got the opportunity to be interviewed for the position of MTS-1 at Adobe. Here is my Interview Experience: Written Round: Part A (50… 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

Start Your Coding Journey Now!