All Medium Articles

## What are the differences between Bellman Ford’s and Dijkstra’s algorithms? 3

Bellman Ford’s algorithm Like other Dynamic Programming Problems, the algorithm calculates shortest paths in a bottom-up manner. It first calculates the shortest distances which have… Read More »

## JPMS : Java Platform Module System 3

JPMS: JPMS i.e. Java Platform Module System is a new feature which is introduced in Java 9. With the help of the Java module system,… Read More »

## Puzzle | Car and Helium Balloon motion 3

Puzzle: A Geek was in a car with a helium balloon on a string that is tied to the floor. The windows are closed. When… Read More »

## Can Artificial Intelligence Help in Curing Cancer? 3.5

What would happen if your own body turned against you? That is the question cancer patients have to deal with. Cancer is basically just a… Read More »

## Number of subsequences in a given binary string divisible by 2 3

Given a binary string str of length N, the task is to find the count of subsequences of str which are divisible by 2. Leading… Read More »

## Minimum count of Full Binary Trees such that the count of leaves is N 3

Given an integer N and an infinite number of Full Binary Trees of different depths, the task is to choose minimum number of trees such… Read More »

## Remove one element to get maximum XOR 3

Given an array arr[] of N elements, the task is to remove one element from the array such that the XOR value of the array… Read More »

## Maximize the profit after selling the tickets 3

Given an array seats[] where seat[i] is the number of vacant seats in the ith row in a stadium for a cricket match. There are… Read More »

## Find whether X exists in Y after jumbling X 3

Given two strings X and Y containing lower-case alphabets, the task is to check whether any permutation of string X exists in Y as its… Read More »

## 5 Best Humanoid Robots in The World 3

Imagine you are a tourist in a country and your local guide is a robot. Or you are watching the early morning news and the… Read More »

## Stuck in Programming: Get The Solution From These 10 Best Websites 3.5

Cheating in programming is acceptable. If you are stuck in your code, google it or try to find the answer from other resources. It’s a… Read More »

## Paytm Interview Experience | On-Campus 3

Round 1: TECHNICAL TEST (ONLINE) It included basic array questions like dividing money according to given problem statement (mostly arrays) practice must do questions from… Read More »

## Sum of lengths of all paths possible in a given tree 3.5

Given a tree with N nodes, the task is to find the sum of lengths of all the paths. Path length for two nodes in… Read More »

## Queries to check if the path between two nodes in a tree is a palindrome 3

Given a tree with N nodes and N – 1 edges. Each edge of the tree is labeled by a string of lowercase english alphabets.… Read More »

## Create a sorted linked list from the given Binary Tree 3

Given a binary tree, the task is to convert it into a sorted linked list. Examples: Input: 1 / \ 2 3 Output: 1 2… Read More »

## Count of times second string can be formed from the characters of first string 3

Given two strings str and patt, the task is to find the count of times patt can be formed using the characters of str. Examples:… Read More »