Most Stones Removed with Same Row or Column | Graphs | Leetcode | DSA | Hindi

Опубликовано: 26 Февраль 2026
на канале: ShashCode
2,986
136

Lecture Resources
https://github.com/Tiwarishashwat/Jav...

Problem Name:
947. Most Stones Removed with Same Row or Column

Problem Statement:
On a 2D plane, we place n stones at some integer coordinate points. Each coordinate point may have at most one stone.

A stone can be removed if it shares either the same row or the same column as another stone that has not been removed.

Given an array stones of length n where stones[i] = [xi, yi] represents the location of the ith stone, return the largest possible number of stones that can be removed.

Problem Link:
https://leetcode.com/problems/most-st...

Graph Playlist:
   • Graph Data Structure Series  

Samsung Interview Experience:
   • I cracked Samsung | SRIB Interview Experie...  

Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung

Timestamp:
0:00 - Introduction

#ShashwatTiwari #coding​​ #problemsolving​