All Medium Articles

## Working with Shared Libraries | Set 2 3.2

We have covered basic information about shared libraries in the previous post. In the current article we will learn how to create shared libraries on… Read More »

## C++ | Destructors | Question 2 3

Predict the output of following C++ progran filter_none edit close play_arrow link brightness_4 code #include <iostream> using namespace std;     int i;     class A… Read More »

## C++ | References | Question 5 3.5

filter_none edit close play_arrow link brightness_4 code #include<iostream> using namespace std;    int &fun() {     int x = 10;     return x; } int main() {… Read More »

## Can we Overload or Override static methods in java ? 3.3

Let us first define Overloading and Overriding. Overriding : Overriding is a feature of OOP languages like Java that is related to run-time polymorphism. A… Read More »

## Word Break Problem | DP-32 3.7

Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words.… Read More »

## Eulerian path and circuit for undirected graph 3.3

Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the… Read More »

## Random number generator in arbitrary probability distribution fashion 3.6

Given n numbers, each with some frequency of occurrence. Return a random number with probability proportional to its frequency of occurrence. Example: Let following be… Read More »

## Check if a graph is strongly connected | Set 1 (Kosaraju using DFS) 3.3

Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if there is a path… Read More »

## Given an array of size n and a number k, find all elements that appear more than n/k times 3.6

Given an array of size n, find all elements in array that appear more than n/k times. For example, if the input arrays is {3,… Read More »

## Goldman Sachs Interview Experience 3.6

Super Day Process 1st Round – Written test to be completed in 1hour 20 mins containing questions on C++, SQL and Aptitude questions. The questions… Read More »

## Data Structures | Binary Trees | Question 15 3

Consider a node X in a Binary Tree. Given that X has two children, let Y be Inorder successor of X. Which of the following… Read More »

## Operating Systems | Process Management | Question 6 3

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W… Read More »

## Expression Evaluation 3.3

Evaluate an expression represented by a String. Expression can contain parentheses, you can assume parentheses are well-matched. For simplicity, you can assume only binary operations… Read More »

## Dice Throw | DP-30 3.6

Given n dice each with m faces, numbered from 1 to m, find the number of ways to get sum X. X is the summation… Read More »

## Biconnected graph 3.4

An undirected graph is called Biconnected if there are two vertex-disjoint paths between any two vertices. In a Biconnected Graph, there is a simple cycle… Read More »

## Remove “b” and “ac” from a given string 3.1

Given a string, eliminate all “b” and “ac” in the string, you have to replace them in-place, and you are only allowed to iterate over… Read More »

## Google Interview Experience | Set 1 (for Technical Operations Specialist [Tools Team] Adwords, Hyderabad, India) 3

My Google Interview Experience, [Hope this is helpful] I am AnandhaKumar .P – 2012 IT pass out from College Of Engineering Guindy, Anna University. As… Read More »

## Strongly Connected Components 3.8

A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph… Read More »

## Shortest Path in Directed Acyclic Graph 3.4

Given a Weighted Directed Acyclic Graph and a source vertex in the graph, find the shortest paths from given source to all other vertices. Recommended:… Read More »