GitHub - Pronoy-Anirudhya/LeetCode: Welcome to my LeetCode repository! Here, you’ll find my solutions to various LeetCode problems written in C# mostly. I have organized this repository for easy reference I can show in the future. Happy coding, ya'll!

Welcome to my LeetCode repository! Here, you’ll find my solutions to various LeetCode problems written in C# mostly (as of 27 August 2024). I have organized this repository for easy reference I can show in the future. Happy coding, ya'll!

Name		Name	Last commit message	Last commit date
Latest commit History 169 Commits
100. Same Tree		100. Same Tree
1002. Find Common Characters		1002. Find Common Characters
1004. Max Consecutive Ones III		1004. Max Consecutive Ones III
1007. Minimum Domino Rotations For Equal Row		1007. Minimum Domino Rotations For Equal Row
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
1046. Last Stone Weight		1046. Last Stone Weight
105. Construct Binary Tree from Preorder and Inorder Traversal		105. Construct Binary Tree from Preorder and Inorder Traversal
1089. Duplicate Zeros		1089. Duplicate Zeros
11. Container With Most Water		11. Container With Most Water
110. Balanced Binary Tree		110. Balanced Binary Tree
1122. Relative Sort Array		1122. Relative Sort Array
1137. N-th Tribonacci Number		1137. N-th Tribonacci Number
1161. Maximum Level Sum of a Binary Tree		1161. Maximum Level Sum of a Binary Tree
118. Pascal's Triangle		118. Pascal's Triangle
120. Triangle		120. Triangle
1200. Minimum Absolute Difference		1200. Minimum Absolute Difference
1207. Unique Number of Occurrences		1207. Unique Number of Occurrences
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
1249. Minimum Remove to Make Valid Parentheses		1249. Minimum Remove to Make Valid Parentheses
125. Valid Palindrome		125. Valid Palindrome
128. Longest Consecutive Sequence		128. Longest Consecutive Sequence
130. Surrounded Regions		130. Surrounded Regions
133. Clone Graph		133. Clone Graph
1339. Maximum Product of Splitted Binary Tree		1339. Maximum Product of Splitted Binary Tree
134. Gas Station		134. Gas Station
1358. Number of Substrings Containing All Three Characters		1358. Number of Substrings Containing All Three Characters
1367. Linked List in Binary Tree		1367. Linked List in Binary Tree
138. Copy List with Random Pointer		138. Copy List with Random Pointer
14. Longest Common Prefix		14. Longest Common Prefix
141. Linked List Cycle		141. Linked List Cycle
1423. Maximum Points You Can Obtain from Cards		1423. Maximum Points You Can Obtain from Cards
143. Reorder List		143. Reorder List
1437. Check If All 1's Are at Least Length K Places Away		1437. Check If All 1's Are at Least Length K Places Away
144. Binary Tree Preorder Traversal		144. Binary Tree Preorder Traversal
1448. Count Good Nodes in Binary Tree		1448. Count Good Nodes in Binary Tree
145. Binary Tree Postorder Traversal		145. Binary Tree Postorder Traversal
146. LRU Cache		146. LRU Cache
1488. Avoid Flood in The City		1488. Avoid Flood in The City
1492. The kth Factor of n		1492. The kth Factor of n
1493. Longest Subarray of 1's After Deleting One Element		1493. Longest Subarray of 1's After Deleting One Element
15. 3Sum		15. 3Sum
150. Evaluate Reverse Polish Notation		150. Evaluate Reverse Polish Notation
1513. Number of Substrings With Only 1s		1513. Number of Substrings With Only 1s
153. Find Minimum in Rotated Sorted Array		153. Find Minimum in Rotated Sorted Array
155. Min Stack		155. Min Stack
1631. Path With Minimum Effort		1631. Path With Minimum Effort
165. Compare Version Numbers		165. Compare Version Numbers
1653. Minimum Deletions to Make String Balanced		1653. Minimum Deletions to Make String Balanced
1672. Richest Customer Wealth		1672. Richest Customer Wealth
1684. Count the Number of Consistent Strings		1684. Count the Number of Consistent Strings
169. Majority Element		169. Majority Element
1695. Maximum Erasure Value		1695. Maximum Erasure Value
1700. Number of Students Unable to Eat Lunch		1700. Number of Students Unable to Eat Lunch
1758. Minimum Changes To Make Alternating Binary String		1758. Minimum Changes To Make Alternating Binary String
1768. Merge Strings Alternately		1768. Merge Strings Alternately
1816. Truncate Sentence		1816. Truncate Sentence
1877. Minimize Maximum Pair Sum in Array		1877. Minimize Maximum Pair Sum in Array
1894. Find the Student that Will Replace the Chalk		1894. Find the Student that Will Replace the Chalk
19. Remove Nth Node From End of List		19. Remove Nth Node From End of List
1912. Design Movie Rental System		1912. Design Movie Rental System
1929. Concatenation of Array		1929. Concatenation of Array
1942. The Number of the Smallest Unoccupied Chair		1942. The Number of the Smallest Unoccupied Chair
1945. Sum of Digits of String After Convert		1945. Sum of Digits of String After Convert
198. House Robber		198. House Robber
1984. MinimumDiffBetweenHighestandLowestofKScores		1984. MinimumDiffBetweenHighestandLowestofKScores
199. Binary Tree Right Side View		199. Binary Tree Right Side View
2. Add Two Numbers		2. Add Two Numbers
20. Valid Parentheses		20. Valid Parentheses
200. Number of Islands		200. Number of Islands
202. Happy Number		202. Happy Number
203. Remove Linked List Elements		203. Remove Linked List Elements
2037. Minimum Number of Moves to Seat Everyone		2037. Minimum Number of Moves to Seat Everyone
204. Count Primes		204. Count Primes
205. Isomorphic Strings		205. Isomorphic Strings
2053. Kth Distinct String in an Array		2053. Kth Distinct String in an Array
206. Reverse Linked List		206. Reverse Linked List
207. Course Schedule		207. Course Schedule
2073. Time Needed to Buy Tickets		2073. Time Needed to Buy Tickets
208. Implement Trie (Prefix Tree)		208. Implement Trie (Prefix Tree)
2085. Count Common Words With One Occurrence		2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array		2089. Find Target Indices After Sorting Array
2095. Delete the Middle Node of a Linked List		2095. Delete the Middle Node of a Linked List
21. Merge Two Sorted Lists		21. Merge Two Sorted Lists
2109. Adding Spaces to a String		2109. Adding Spaces to a String
211. Design Add and Search Words Data Structure		211. Design Add and Search Words Data Structure
2110. Number of Smooth Descent Periods of a Stock		2110. Number of Smooth Descent Periods of a Stock
2140. Solving Questions With Brainpower		2140. Solving Questions With Brainpower
215. Kth Largest Element in an Array		215. Kth Largest Element in an Array
217. Contains Duplicate		217. Contains Duplicate
219. Contains Duplicate II		219. Contains Duplicate II
2202. Maximize the Topmost Element After K Moves		2202. Maximize the Topmost Element After K Moves
2221. Find Triangular Sum of an Array		2221. Find Triangular Sum of an Array
2225. Find Players With Zero or One Losses		2225. Find Players With Zero or One Losses
2257. Count Unguarded Cells in the Grid		2257. Count Unguarded Cells in the Grid
226. Invert Binary Tree		226. Invert Binary Tree
2270. Number of Ways to Split Array		2270. Number of Ways to Split Array
2273. Find Resultant Array After Removing Anagrams		2273. Find Resultant Array After Removing Anagrams
23. Merge k Sorted Lists		23. Merge k Sorted Lists

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Uh oh!

Uh oh!

Contributors

Uh oh!

Languages

Folders and files

Latest commit

History

Repository files navigation

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Uh oh!

Contributors

Uh oh!

Languages