## Bridges in a graph

An edge in an undirected connected graph is a bridge iff removing it disconnects the graph. For a disconnected undirected graph, definition is similar, a… Read More »

- Courses @ GeeksforGeeks
- Internships @ GeeksforGeeks
- Coding Practice
- How to write an Interview Experience?
- Must Do Coding Questions Company-wise
- Must Do Coding Questions Topic-wise
- Basic
- Easy
- Medium
- Hard
- Expert
- Step by Step Preparation
- Company Preparation
- Top Topics
- Company Specific Practice
- Software Design Patterns
- Placements Preparation Course
- Interview Corner
- Recent Interview Experiences
- GQ Home Page
- Quiz Corner
- LMNs
- What's New ?
- Leaderboard !!
- Topic-wise Practice
- Subjective Problems
- Difficulty Level - School
- Difficulty Level - Basic
- Difficulty Level - Easy
- Difficulty Level - Medium
- Difficulty Level - Hard
- Explore More...
- C
- C++
- Java
- Python
- SQL
- PHP
- JavaScript
- School Programming
- Operating Systems
- DBMS
- Computer Networks
- Engineering Mathematics
- Design Patterns
- Common Interview Puzzles
- Web Technology
- G-Facts
- Computer Graphics
- Image Processing
- Project Ideas

An edge in an undirected connected graph is a bridge iff removing it disconnects the graph. For a disconnected undirected graph, definition is similar, a… Read More »

A vertex in an undirected connected graph is an articulation point (or cut vertex) iff removing it (and edges through it) disconnects the graph. Articulation… Read More »

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 »

Given an array of integers. Find a peak element in it. An array element is peak if it is NOT smaller than its neighbors. For… Read More »

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 »

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 »

Write a function to detect if two trees are isomorphic. Two trees are called isomorphic if one of them can be obtained from other by… Read More »

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 »

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge uv, vertex u comes before v… Read More »

I have attended the interview for Software Development Engineer position and got the offer from Amazon. I spent a lot of time in GeeksforGeeks going… Read More »

Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be… Read More »

Tower Research Capital LLC is a financial services firm located in New York that specializes in quantitative trading and investment strategies. Founded in 1998, Tower… Read More »