959. Regions Cut By Slashes | graphs | Leetcode Daily Challenge | DSA | Hindi
Problem Name:
959. Regions Cut By Slashes
Problem Statement:
An n x n grid is composed of 1 x 1 squares where each 1 x 1 square consists of a '/', '\', or blank space ' '. These characters divide the square into contiguous regions.
Given the grid grid represented as a string array, return the number of regions.
Note that backslash characters are escaped, so a '\' is represented as '\\'.
Problem Link:
https://leetcode.com/problems/regions...
Solution Link:
https://github.com/Tiwarishashwat/Int...
Graph Playlist:
• Graph Data Structure Series
Java Plus DSA Placement Course Playlist:
• Playlist
Java Plus DSA Sheet:
https://docs.google.com/spreadsheets/...
Notes:
https://github.com/Tiwarishashwat/Jav...
Telegram Link:
https://shashwattiwari.page.link/tele...
Ultimate Recursion Series Playlist:
• Playlist
Instagram Handle: (@shashwat_tiwari_st)
https://shashwattiwari.page.link/shas...
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
3:28 - 1*1 cell representation
6:50 - 2*2 cell representation
11:18 - 3*3 cell representation
14:35 - creating the 3*n x 3*n matrix
21:33 - code
#ShashwatTiwari #coding #problemsolving