Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedA connected graph G is said to be 2–vertex connected (or 2–connected) if it has more than 2 vertices and remains connected on the removal of any vertices. Any such vertex whose removal will disconnect the graph is called the Articulation point.
Given an undirected connected graph, check if the graph is 2–edge connected or not. A connected graph is 2–edge connected if it remains connected whenever any edges are removed.
Find the minimum number of throws required to win a given Snake and Ladder game. For example, the following game requires at least 7 dice throws to win.
Write an algorithm to generate numbers from 1 to 7 with equal probability using a specified function that produces random numbers between 1 and 5.
This post will discuss how to generate fair results from a biased coin that prefers one side of the coin over another and returns TAILS with p probability and HEADS with 1-p probability where p != (1-p).