version 3 with stack
#dfs_iterative

#Linked_list
Title: 86. Partition List
URL: leetcode
Level: Medium

#binary_tree
Title: 112. Path Sum
URL: leetcode
Level: Easy

#bit
Title: 67. Add Binary
URL: leetcode
Level: Easy

#graph
Title: 130. Surrounded Regions
URL: leetcode
Level: Medium

#graph
Title: 200. Number of Islands
URL: leetcode
Level: Medium

Saydillo Pythondagi mavzularni leetcode masalasini yechib tushuntiribtilar👍👍

https://www.youtube.com/watch?v=4Orh_-MH1Mc&ab_channel=SaydilloDjalalov

#bit
Title: 191. Number of 1 Bits
URL: leetcode
Level: Easy

#stack
Title: 155. Min Stack
URL: leetcode
Level: medium

#disjoint_set #union_find

Title: 261. Graph Valid Tree
URL: leetcode
Level: medium

Title: 1971. Find if Path Exists in Graph
URL: leetcode
Level: medium
DFS aproach
not my own solution, leaving here for reference

Graphga oid masalalar yechimi juda chiroyli va kompaktniy koddagi ko'rinishi. Lekin uni qanday ishlavotganini tushunish va tushuntirish ohho bir olamdek🙈🙈😭

BFS approach for https://t.iss.one/solutions_py/200


https://t.iss.one/solutions_py

#heap
Title: 215. Kth Largest Element in an Array
URL: leetcode.com
Level: Medium

#heap
Title: 347. Top K Frequent Elements
URL: leetcode.com
Level: Medium

#heap
Title: 703. Kth Largest Element in a Stream
URL: leetcode.com
Level: Easy

#heap
Title: 253. Meeting rooms 2
URL: leetcode.com
Level: Medium

#heap
Title: 1046. Last Stone Weight
URL: leetcode.com
Level: Easy

#heap
Title: 1167. Minimum Cost to Connect Sticks
URL: leetcode.com
Level: Medium

My latest accomplishment these days😎😎

Another 50 days Badge for 2024.
To be honest I haven't been solving problems for the last 3 months, and today this image is appearing after long time break😊😊 It made my day.