All Medium Articles

GATE | Gate IT 2005 | Question 42

Two concurrent processes P1 and P2 use four shared resources R1, R2, R3 and R4, as shown below. P1 P2 Compute: Use R1; Use R2;… Read More

Gate IT 2005

GATE-Gate IT 2005

GATE

GATE | Gate IT 2005 | Question 13

A function f defined on stacks of integers satisfies the following properties. f(∅) = 0 and f (push (S, i)) = max (f(S), 0) +… Read More

Gate IT 2005

GATE-Gate IT 2005

GATE

How to find the highest normal form of a relation

To understand this topic, you should have a basic idea about Functional Dependency & Candidate keys and Normal forms . Steps to find the highest normal form of… Read More

DBMS-Normalization

DBMS

GATE CS

C++ program to print unique words in a file

Write a function that takes a file name as argument and prints all unique words in it. We strongly recommend you to minimize your browser… Read More

cpp-file-handling

C++

Count Inversions of size three in a given array

Given an array arr[] of size n. Three elements arr[i], arr[j] and arr[k] form an inversion of size 3 if a[i] > a[j] >a[k] and… Read More

Binary Indexed Tree

inversion

Advanced Data Structure

Arrays

DSA

Gaussian Elimination to Solve Linear Equations

The article focuses on using an algorithm for solving a system of linear equations. We will deal with the matrix of coefficients. Gaussian Elimination does… Read More

DSA

Mathematical

Find Square Root under Modulo p | Set 1 (When p is in form of 4*i + 3)

Given a number ‘n’ and a prime ‘p’, find square root of n under modulo p if it exists. It may be given that p… Read More

Modular Arithmetic

DSA

Mathematical

Microsoft Interview Experience | Set 86 (On-Campus)

Coding Round : 1. https://www.geeksforgeeks.org/reverse-a-list-in-groups-of-given-size/ 2. Do not remember second question but it was on binary tree. Group-fly round : Remove repeating charaters from a… Read More

Microsoft

Arrays

DSA

Experiences

Interview Experiences

Amazon Interview Experience | Set 237 (For Application Engineer)

1) Written Test on Unix Shell Scripting 1. write a script/command to find files older than 7days and zip them and move to specific folder.… Read More

Amazon

Experiences

Interview Experiences

Amdocs Interview Experience | Set 1 (On-Campus)

Round 1: 1.Quantative (16 ques in 16 min) 2.Reasoning(14 in 14 min). 3.English(18 in 16 min). 4.Coding(2 question in 45 min). (I)Print pattern(for N=4) 1… Read More

Amdocs

Experiences

Interview Experiences

Amazon Interview Experience | Set 236 (Rounds 2 and 3)

Round 2: Paper written coding 1) Given an unsorted array with a group of characters taken from the user. Find the first occurrence of non… Read More

Amazon

Experiences

Interview Experiences

MAQ Software Interview Experience | Set 10 (On-Campus)

1. Written Round : 1) 30 Aptitude questions(30 min). 2) 2-Coding questions(30 min). 2-a) Write an algorithm for dutch national flag problem 2-b) Write an… Read More

MAQ Software

STL

DSA

Dynamic Programming

Experiences

Interview Experiences

Mathematical

Queue

Stack

How to Prepare for a Behavioral Interview?

Many people are very afraid of behavioral interview questions in the technical rounds as they seem to be just something most programmers are not good… Read More

GBlog

Thoughtworks Interview Experience | Set 2 (Off-Campus)

Geeksforgeeks has helped me a lot. In order to help other students I would like to share my experience. Step 1: I applied through a… Read More

Thoughtworks

Experiences

Interview Experiences

Counting Inversions using Set in C++ STL

Inversion Count for an array indicates – how far (or close) the array is from being sorted. If array is already sorted then inversion count… Read More

cpp-set

inversion

STL

C++

GATE | GATE-IT-2004 | Question 87

A TCP message consisting of 2100 bytes is passed to IP for delivery across two networks. The first network can carry a maximum payload of… Read More

GATE IT 2004

GATE-GATE IT 2004

GATE

Compute n! under modulo p

Given a large number n and a prime p, how to efficiently compute n! % p?Examples : Input: n = 5, p = 13 Output:… Read More

factorial

large-numbers

Modular Arithmetic

number-theory

sieve

DSA

Mathematical

Flipkart Interview Experience| Set 38 (On-Campus for SDE)

I was interviewed on-campus for Software Development Engineering (SDE1) role Flipkart. Coding round: (90 minutes) Coding round was done on hackerrank . Given two numbers… Read More

Flipkart

Experiences

Interview Experiences

GATE | GATE-IT-2004 | Question 79

Consider a table T in a relational database with a key field K. A B-tree of order p is used as an access structure on… Read More

GATE IT 2004

GATE-GATE IT 2004

GATE

Top 10 Algorithms and Data Structures for Competitive Programming

In this post, we will discuss Important top 10 algorithms and data structures for competitive coding. Topics : Graph algorithms Dynamic programming Searching and… Read More

BFS

Binary Indexed Tree

BIT

DFS

GBlog-Competitive-Programming

Modular Arithmetic

number-theory

Segment-Tree

sieve

Topological Sorting

Competitive Programming

DSA

GBlog