All Medium Articles

Data Storage and its Sorts

Data Storage is a key segment of computerized gadgets, as buyers and organizations have come to depend on it to save data going from individual… Read More

Computer Organization & Architecture

p5.js | Quick Sort

QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many… Read More

JavaScript-p5.js

Quick Sort

JavaScript

Web Technologies

PHP | unpack() Function

The unpack() function is an inbuilt function in PHP which is used to unpack from a binary string into the respective format. Syntax: array unpack(… Read More

PHP-function

PHP

Web Technologies

p5.js | Bubble Sort

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. In order to… Read More

JavaScript-p5.js

JavaScript

Web Technologies

Design a Chess Game

Problem Statement: The problem is to design a Chess Game using Object Oriented Principles. Asked In: Adobe, Amazon, Microsoft, etc. Solution: These type of questions… Read More

Java-Object Oriented

Marketing

Object-Oriented-Design

Advanced Data Structure

Algorithms

Design Pattern

DSA

System Design

Add the given digit to a number stored in a linked list

Given a linked list which represents an integer number where every node is a digit if the represented integer. The task is to add a… Read More

Microsoft

DSA

Linked List

| | Question

Consider a segment tree built on an array of N elements. What is the minimum number of node updates required to rebuild the entire tree… Read More

Amazon Interview Experience | Off-Campus for SDE1

Amazon SDE1 hiring (Off-Campus): June 2019 There were 5 rounds. Round 1: (Paper Coding) Q1. A person is standing at the center(0, 0). He is… Read More

Amazon

Off-Campus

Experiences

Interview Experiences

Rat in a Maze Problem when movement in all possible directions is allowed

Consider a rat placed at (0, 0) in a square matrix m[ ][ ] of order n and has to reach the destination at (n-1,… Read More

Backtracking

C++ Programs

DSA

Matrix

Maximum Length Chain of Pairs | Set-2

Given an array of pairs of numbers of size N. In every pair, the first number is always smaller than the second number. A pair… Read More

Algorithms

Arrays

DSA

Greedy

Sorting

var keyword in Go

var keyword in Golang is used to create the variables of a particular type having a proper name and initial value. Initialization is optional at… Read More

Go-Keywords

Golang

Go Language

Implementing Forward Iterator in BST

Given a Binary search tree, the task is to implement forward iterator on it with the following functions. curr(): returns the pointer to current element.… Read More

Binary Search Tree

C++

Data Structures

DSA

Stack

Sort an array without changing position of negative numbers

Given an array arr[] of N integers, the task is to sort the array without changing the position of negative numbers (if any) i.e. the… Read More

Arrays

Competitive Programming

DSA

Sorting

Partition the string in two parts such that both parts have at least k different characters

Given a string of lowercase English alphabets and an integer 0 < K <= 26. The task is to divide the string into two parts… Read More

frequency-counting

Java-HashMap

DSA

Hash

Strings

Maximum number formed from array with K number of adjacent swaps allowed

Given an array a[ ] and the number of adjacent swap operations allowed are K. The task is to find the max number that can… Read More

number-digits

Arrays

DSA

Different types of MySQL Triggers (with examples)

A MySQL trigger is a stored program (with queries) which is executed automatically to respond to a specific event such as insertion, updation or deletion… Read More

DBMS-SQL

mysql

DBMS

How to create a list of object in Python class

We can create a list of objects in Python by appending class instances to the list. By this, every index in the list can point… Read More

Python Oops-programs

Python-OOP

Python

Number of pairs with a given sum in a Binary Search Tree

Given a Binary Search Tree, and a number X. The task is to find the number of distinct pairs of distinct nodes in BST with… Read More

two-pointer-algorithm

Binary Search Tree

Data Structures

DSA

Tree

Find the minimum absolute difference in two different BST’s

Given 2 Binary Search Trees, select one node from each tree such that their absolute difference is minimum possible. Assume each BST has at-least one… Read More

Binary Search Tree

Data Structures

DSA

Tree

Construct BST from its given level order traversal | Set-2

Construct the BST (Binary Search Tree) from its given level order traversal. Examples: Input : {7, 4, 12, 3, 6, 8, 1, 5, 10} Output… Read More

BST

tree-level-order

DSA

Tree