Binary Search
Demo
Star Sum
Amazon
Online Assessment
E-Mart Product Ranking
Amazon
Online Assessment
Minimum Total Wattage
Amazon
Online Assessment
Best Stock Combos
Amazon
Online Assessment
Subset
Split String
Amazon
Online Assessment
Array
Find Pairs
Amazon
Online Assessment
Array
Merge Adjacent Numbers
Amazon
Online Assessment
Array
Split Array III
Amazon
Online Assessment
Array
Minimum Number of Swaps
Amazon
Online Assessment
Array
Collection of Circles
Google
Onsite
MST
Search Extensible String
New
Google
Onsite
Maximum Deviation Among All Substrings
Online Assessment
String
Maximum Greyness
New
Online Assessment
Matrix
Separate Pages
New
Online Assessment
Bit
Shop for Clothes on a Budget
New
Online Assessment
Color Palette
Online Assessment
Array
Min Appends to Make Subsequence
Online Assessment
String
Min Swaps to Partition
New
Online Assessment
Minimum Net Price Change
New
Online Assessment
Intern
Array
Channels Maximum Quality
New
Online Assessment
Slice Array
New
Online Assessment
Array
Stock Fluctuation
New
Online Assessment
Array
Decoding String
New
Online Assessment
String
Maximum Precipitation
New
Online Assessment
Count Reviews II
New
Online Assessment
Count Reviews Combinations
New
Online Assessment
LRU Browser History
New
Online Assessment
Split Array II
Amazon
Google
New
Load Cargo
Amazon
Google
New
Split Array
Amazon
Google
New
Find Bridges In A Graph
Amazon
Google
MST
New
Closest Pair of Molecules
Google
Amazon
New
Search Matrix
Facebook
New
Max Submatrix Sum
Google
Facebook
New
Cache Hit Ratio
Google
Facebook
Amazon
New
Find Cut Vertices
Google
Amazon
New
Two Sum Smaller Than Target
Google
Amazon
New
Can Make Palindrome
Facebook
New
Discount Calculator
Amazon
New
Online Assessment
Max Sink Area
Amazon
New
Measure Island Border
Facebook
New
Construct Word Using Dice
Google
New
Recursive Islands and Lakes
Google
Hard
New
Packaging Automation
Amazon
New
Online Assessment
Secret Fruit List
Amazon
Online Assessment
New
Find Related Products
Amazon
Online Assessment
New
Optimize Memory Usage
Online Assessment
Min Cost To Add New Roads
Online Assessment
Connect Ropes
Amazon
Online Assessment
Pizza Shop
Google
Phone
Least Common Ancestor Of Multiple Nodes
Amazon
Phone
Tree
Remove Duplicated IPv4 Addresses
Amazon
Onsite
Fibonacci Base I
Google
Activate Fountain
Twitter
Online Assessment
Reaching Point
Twitter
Online Assessment
K-Difference
Twitter
Online Assessment
Find Critical Nodes
Amazon
Online Assessment
Zombie Matrix
Amazon
HOT
Data Center Critical Connection
Amazon
Online Assessment
Min Cost to Repair Edges (Minimum Spanning Tree II)
Amazon
Online Assessment
MST
Graph
Rose Garden
Google
Online Assessment
Minimum Number Of Decreasing Subsequence Partitions
Google
Online Assessment
Hard
DP
Cut Binary Search Tree
Amazon
Tree
BST
Hard
LC
Subtree: Maximum Average Node
Amazon
Online Assessment
Medium
Tree
Fill 2D Array
Google
Online Assessment
Rearrange String
String
Pickup Coupon
Google
Online Assessment
Tree Diameter
Google
Top N Buzzwords
Amazon
Online Assessment
HOT
Load Balancer
Amazon
Online Assessment
Find Substrings
Amazon
Online Assessment
Hard
Partition String
Amazon
Online Assessment
String
Medium
Find Cut Vertices
Given an undirected graph, find out all the vertices when removed will make the graph disconnected. Initially the graph is connected.
For example given the graph below:
Return [2, 3]. Because we can make the graph disconnected by removing either vertex 2 or vertex 3.
Input:
nodeNum, the total count of vertices in the graph. Each vertex has an unique id in the range from 0 to nodeNum - 1 inclusive.
edges, a list of integer pairs representing all the edges on the graph.
output:
A list of integers representing the ids of the articulation points.
example:
Input:
nodeNum = 7
edges = [[0,1], [0, 2], [1, 3], [2, 3], [2, 5], [5, 6], [3,4]]
Output:
[2,3,5]
Copyright © A++ Code Bootcamp 2023