GitHub - premmsharma122/Algo-Sheet-Question: In this repository, I share some important LeetCode questions that I found particularly valuable. While solving them, I realized they involve key concepts, logical patterns, or important problem-solving techniques

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 84 Commits
1026. Maximum Difference Between Node and Ancestor		1026. Maximum Difference Between Node and Ancestor
1049. Last Stone Weight II		1049. Last Stone Weight II
1110. Delete Nodes And Return Forest		1110. Delete Nodes And Return Forest
114. Flatten Binary Tree to Linked List		114. Flatten Binary Tree to Linked List
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
127. Word Ladder		127. Word Ladder
1293. Shortest Path in a Grid with Obstacles Elimination		1293. Shortest Path in a Grid with Obstacles Elimination
130. Surrounded Regions		130. Surrounded Regions
133. Clone Graph		133. Clone Graph
134. Gas Station		134. Gas Station
135. Candy		135. Candy
1353. Maximum Number of Events That Can Be Attended		1353. Maximum Number of Events That Can Be Attended
1376. Time Needed to Inform All Employees		1376. Time Needed to Inform All Employees
1472. Design Browser History		1472. Design Browser History
1514. Path with Maximum Probability		1514. Path with Maximum Probability
1584. Min Cost to Connect All Points		1584. Min Cost to Connect All Points
1642. Furthest Building You Can Reach		1642. Furthest Building You Can Reach
1751. Maximum Number of Events That Can Be Attended II		1751. Maximum Number of Events That Can Be Attended II
1834. Single-Threaded CPU		1834. Single-Threaded CPU
198. House Robber		198. House Robber
200. Number of Islands		200. Number of Islands
2034. Stock Price Fluctuation		2034. Stock Price Fluctuation
213. House Robber II		213. House Robber II
23. Merge k Sorted Lists		23. Merge k Sorted Lists
236. lowest comman ancestor		236. lowest comman ancestor
295. Find Median from Data Stream		295. Find Median from Data Stream
322. Coin Change(recursion + memo)		322. Coin Change(recursion + memo)
3307. Find the K-th Character in String Game II		3307. Find the K-th Character in String Game II
347. Top K Frequent Elements		347. Top K Frequent Elements
354. Russian Doll Envelopes.java		354. Russian Doll Envelopes.java
373. Find K Pairs with Smallest Sums		373. Find K Pairs with Smallest Sums
416. Partition Equal Subset Sum		416. Partition Equal Subset Sum
417. Pacific Atlantic Water Flow		417. Pacific Atlantic Water Flow
45. Jump Game II		45. Jump Game II
452. Minimum Number of Arrows to Burst Balloons		452. Minimum Number of Arrows to Burst Balloons
480. Sliding Window Median		480. Sliding Window Median
494. Target Sum(By two approaches)		494. Target Sum(By two approaches)
502. IPO		502. IPO
518. Coin Change II		518. Coin Change II
542. 01 Matrix		542. 01 Matrix
543. Diameter of Binary Tree		543. Diameter of Binary Tree
547. Number of Provinces		547. Number of Provinces
56. Merge Intervals		56. Merge Intervals
632. Smallest Range Covering Elements from K Lists		632. Smallest Range Covering Elements from K Lists
652. Find Duplicate Subtrees		652. Find Duplicate Subtrees
669. Trim a Binary Search Tree		669. Trim a Binary Search Tree
673. Number of Longest Increasing Subsequence.java		673. Number of Longest Increasing Subsequence.java
684. Redundant Connection		684. Redundant Connection
690. Employee Importance		690. Employee Importance
703. Kth Largest Element in a Stream		703. Kth Largest Element in a Stream
729. My Calendar I		729. My Calendar I
731. My Calendar II		731. My Calendar II
743. Network Delay Time		743. Network Delay Time
752. Open the Lock		752. Open the Lock
778. Swim in Rising Water		778. Swim in Rising Water
797. All Paths From Source to Target		797. All Paths From Source to Target
857. Minimum Cost to Hire K Workers		857. Minimum Cost to Hire K Workers
871. Minimum Number of Refueling Stops		871. Minimum Number of Refueling Stops
895. Maximum Frequency Stack		895. Maximum Frequency Stack
921. Minimum Add to Make Parentheses Valid		921. Minimum Add to Make Parentheses Valid
973. K Closest Points to Origin		973. K Closest Points to Origin
979. Distribute Coins in Binary Tree		979. Distribute Coins in Binary Tree
981. Time Based Key-Value Store		981. Time Based Key-Value Store
994. Rotting Oranges		994. Rotting Oranges
LC-593. Valid Square.java		LC-593. Valid Square.java
Minimize the Heights II		Minimize the Heights II
Path Sum-3 \| Tree-pre-order		Path Sum-3 \| Tree-pre-order
Tree-Pre-Order		Tree-Pre-Order
inorder_postoder_to_tree		inorder_postoder_to_tree
inorder_traversal		inorder_traversal
minimum-diff-bw-twoNodes		minimum-diff-bw-twoNodes
serialize_n_deserialize-tree		serialize_n_deserialize-tree
top_k_smallest_in_tree		top_k_smallest_in_tree
vallidate_tree		vallidate_tree

About

In this repository, I share some important LeetCode questions that I found particularly valuable. While solving them, I realized they involve key concepts, logical patterns, or important problem-solving techniques