All Easy Articles

## GATE | GATE-CS-2003 | Question 20 2

Consider the following three claims 1. (n + k)m = Θ(nm), where k and m are constants 2. 2n + 1 = O(2n) 3. 22n… Read More »

## Find n’th number in a number system with only 3 and 4 2.8

Given a number system with only 3 and 4. Find the nth number in the number system. First few numbers in the number system are:… Read More »

## Delete all occurrences of a given key in a linked list 2

Given a singly linked list, delete all occurrences of a given key in it. For example, consider the following list. Input: 2 -> 2 ->… Read More »

## How to create mergable stack? 2.4

Design a stack with following operations. a) push(Stack s, x): Adds an item x to stack s b) pop(Stack s): Removes the top item from… Read More »

## GATE | GATE-CS-2004 | Question 77 2

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is (A) 2… Read More »

## Zoho Interview | Set 2 (On-Campus) 2.7

Recently Zoho visited for the campus placement. I would like to share my experience to geeksforgeeks because of which I got this offer. Thank you… Read More »

## Analysis of Algorithm | Set 5 (Amortized Analysis Introduction) 2.6

Amortized Analysis is used for algorithms where an occasional operation is very slow, but most of the other operations are faster. In Amortized Analysis, we… Read More »

## C++ | Inheritance | Question 14 2.3

Consider the below C++ program. filter_none edit close play_arrow link brightness_4 code #include<iostream> using namespace std; class A { public:      A(){ cout <<“1”;}      A(const A… Read More »

## Amazon Interview experience | Set 127 (For Internship) 2.6

Amazon visited our campus for summer internship. I prepared from Amazon Interview Sets which were pretty helpful! Here is my experience : DAY 1 They… Read More »

## LinkedIn Interview Experience | Set 1 (for SDE Internship) 2.6

Below is my interview experience with linkedin India for software development intern. First there was an online round on hackerrank where they asked 4 simple… Read More »

## Samsung Interview Experience | Set 6 (For Internship at Samsung Research Institute) 2.6

There were total 2 rounds. Round 1: There were 60 MCQs(20 English + 20 Logical reasoning + 20 Data Interpretation ) to be solved in… Read More »

## Interview Experience with Indus Valley Partners 2

Round 1 : ~200 students Duration 60 minutes Written round, comprising of aptitude question, logical puzzles, and technical questions. (basic aptitude + heavy java) You… Read More »

## CommVault Systems Interview Experience | Set 1 2.5

My CommVault Experience – First Round(Coding): First round was a coding round. There was 1 demo question, and 6 real questions. Coding had to be… Read More »

## GATE | GATE-CS-2004 | Question 15 2

Choose the best matching between Group 1 and Group 2. Group-1 Group-2 P. Data link 1. Ensures reliable transport of data over a physical point-to-point… Read More »

## GATE | GATE-CS-2004 | Question 90 2

Consider the following relation schema pertaining to a students database: Student (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined.… Read More »

## Find the first repeating element in an array of integers 2.1

Given an array of integers, find the first repeating element in it. We need to find the element that occurs more than once and whose… Read More »

## Microsoft Interview | Set 34 (On-Campus) 2

1st Round (Online) 15mcq 30mins – Most from C/C++. Few from OS 2nd Round: Coding Online (1 hour) 1st quest: https://www.geeksforgeeks.org/intersection-of-two-sorted-linked-lists/ 2nd quest: https://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/ 13th… Read More »

## GATE | GATE-CS-2005 | Question 59 2

Consider the grammar E → E + n | E × n | n For a sentence n + n × n, the handles in… Read More »

## GATE | GATE-CS-2005 | Question 53 2

Consider the machine M: The language recognized by M is : (A) {w ∈ {a, b}* / every a in w is followed by ex­actly… Read More »

## GATE | GATE-CS-2005 | Question 44 2

What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs (a, b) and… Read More »