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
Hi, chalk studio recently visited my campus. Here is my interview experience. Round 1: MCQ-31 questions-31 mins It was a mcq round and test was… Read More
Round 1 (Written Test ) Duration – 90 mins Section 1 ( Technical objective questions) – 25 mcq’s mainly focusing on c , c++ ,… Read More
Microsoft conducted their first round of shortlisting for placements and internship. The online coding round was organized by CoCubes like last year. The test was… Read More
In the recent past, I attended interview with Amazon. Here is my interview experience. Written Round: 1.5 hours 1. Given an array of integers, replace… Read More
Given a singly linked list, delete all occurrences of a given key in it. For example, consider the following list. Example: Input: 2 -> 2… Read More
I was interviewed for the position of SDET-1 few days back at Chennai. Here is my interview experience: Coding round (Full code required): 1) Given… Read More
I had an telephonic interview with Arista Networks couple of days ago. To apply for Arista Networks (Internship) CGPA >=8.5, luckily i had. Here are… Read More
Design a stack with the following operations. push(Stack s, x): Adds an item x to stack s  pop(Stack s): Removes the top item from stack… Read More
Given the mobile numeric keypad. You can only press buttons that are up, left, right or down to the current button. You are not allowed… Read More
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2.  Group-1  Group-2  P.  Functional  1.  Command-based, proce-dural  Q.… Read More
L1 is a recursively enumerable language over Σ. An algorithm A effectively enumerates its words as w1, w2, w3, … Define another language L2 over… Read More
Consider the following grammar G: S → bS | aA | b A → bA | aB B → bB | aS | a Let… Read More
The language {am bn Cm+n | m, n ≥ 1} is (A) regular (B) context-free but not regular (C) context sensitive but not context free… Read More
The following finite state machine accepts all those binary strings in which the number of 1’s and 0’s are respectively. (A) divisible by 3 and… Read More
A program takes as input a balanced binary search tree with n leaf nodes and computes the value of a function g(x) for each node… Read More

Start Your Coding Journey Now!