All Medium Articles

Find the missing number in Geometric Progression

Given an array that represents elements of geometric progression in order. One element is missing in the progression, find the missing number. It may be… Read More

Binary Search

Arrays

DSA

Belzabar Software Interview Experience | Set 5 (Off-Campus for Software Developer)

I applied in Belzabar off-campus, and got a chance to be interviewed by them. There were total of 5 rounds. Online Coding Round: 1 hr… Read More

Belzabar

Experiences

Interview Experiences

Check if elements of array can be made equal by multiplying given prime numbers

Given an array of integers and an array of prime numbers. The task is to find if it is possible to make all the elements… Read More

GCD-LCM

DSA

Mathematical

Check if all people can vote on two machines

There are n people and two identical voting machines. We are also given an array a[] of size n such that a[i] stores time required… Read More

knapsack

DSA

Dynamic Programming

Max Flow Problem Introduction

The max flow problem is a classic optimization problem in graph theory that involves finding the maximum amount of flow that can be sent through… Read More

Max-Flow

DSA

Graph

Greedy

SAP Labs Interview Experience | Set 25 (On-Campus)

Hi All. SAP Labs visited our campus. The whole process was divided in 5 rounds : 1) Aptitude and coding round 2) Technical interview 1… Read More

SAP Labs

Experiences

Interview Experiences

Minimum steps to reach target by a Knight | Set 1

Given a square chessboard of N x N size, the position of the Knight and the position of a target are given. We need to… Read More

Amazon

BFS

chessboard-problems

MakeMyTrip

DSA

Graph

Queue

N-th root of a number

Given two numbers N and A, find N-th root of A. In mathematics, Nth root of a number A is a real number that gives… Read More

Accenture

Directi

DSA

Mathematical

Printing all solutions in N-Queen Problem

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example,… Read More

Backtracking

DSA

Reverse Delete Algorithm for Minimum Spanning Tree

Reverse Delete algorithm is closely related to Kruskal’s algorithm. In Kruskal’s algorithm what we do is : Sort edges by increasing order of their weights.… Read More

Advanced Data Structure

Algorithms

DSA

Graph

Greedy

Sum of the products of all possible Subsets

Given an array of n non-negative integers. The task is to find the sum of the product of elements of all the possible subsets. It… Read More

combinatorics

Arrays

DSA

D E Shaw Interview Experience | Set 20 (For Q&A Profile)

Was called through a referral from a friend already working there. Round 1 (Telephonic) Tell me about yourself Explain one of your projects Questions on… Read More

D-E-Shaw

Experiences

Interview Experiences

Learning Model Building in Scikit-learn

Scikit-learn has emerged as a powerful and user-friendly Python library. Its simplicity and versatility make it a better choice for both beginners and seasoned data… Read More

AI-ML-DS With Python

AI-ML-DS

Machine Learning

Minimum Sum Path In 3-D Array

Given a 3-D array arr[l][m][n], the task is to find the minimum path sum from the first cell of the array to the last cell… Read More

DSA

Dynamic Programming

Copy-and-Swap Idiom in C++

Before going into deep let us first have a look on the normal ‘overloaded assignment operator’ that we use. CPP // Simple C++ program to… Read More

cpp-advanced

C++

Bresenham’s Line Generation Algorithm

Given the coordinate of two points A(x1, y1) and B(x2, y2). The task is to find all the intermediate points required for drawing line AB… Read More

computer-graphics

Algorithms

DSA

Check divisibility in a binary stream

Stream of binary number is coming, the task is to tell the number formed so far is divisible by a given number n. At any… Read More

array-stream

divisibility

Bit Magic

DSA

GATE | GATE-CS-2017 (Set 2) | Question 53

Consider the following program #include<stdio.h> #include<string.h> int main() { char * c = "GATECSIT2017"; char *p = c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; } The Output… Read More

GATE-CS-2017 (Set 2)

GATE-GATE-CS-2017 (Set 2)

GATE

GATE | GATE-CS-2017 (Set 2) | Question 49

Consider the following C function. int fun(int n) { int i, j; for (i = 1; i <= n ; i++) { for (j =… Read More

GATE-CS-2017 (Set 2)

GATE-GATE-CS-2017 (Set 2)

GATE

GATE | GATE-CS-2017 (Set 2) | Question 29

Given the following binary number in 32 bit (single precision) IEEE-754 format: 00111110011011010000000000000000 The decimal value closest to this floating-point number is: (A) 1.45 X… Read More

GATE-CS-2017 (Set 2)

GATE-GATE-CS-2017 (Set 2)

GATE