GitHub - Erlybird/LC

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 102 Commits
114.Flatten binary tree		114.Flatten binary tree
138.Copy List with Random Pointer		138.Copy List with Random Pointer
141.Linked list cycle		141.Linked list cycle
144.Binary Tree preorder traversal		144.Binary Tree preorder traversal
145.Binary Tree PostOrder Traversal		145.Binary Tree PostOrder Traversal
198. House robber		198. House robber
205. Isomorphic Strings		205. Isomorphic Strings
256. Paint House		256. Paint House
322.Coin change		322.Coin change
34. FInd first and Last Position of Elements in Sorted Array		34. FInd first and Last Position of Elements in Sorted Array
45.Jump game - II		45.Jump game - II
518. Coin Change II		518. Coin Change II
55.Jump Game		55.Jump Game
740. Delete and Earn		740. Delete and Earn
98.Validate BST		98.Validate BST
remove_Nth_Node_from_List_End		remove_Nth_Node_from_List_End
100. Same Tree.java		100. Same Tree.java
11. Container with Most Water.java		11. Container with Most Water.java
122. Best time to buy and sell stock - 2.java		122. Best time to buy and sell stock - 2.java
143. ReOrder List.java		143. ReOrder List.java
1481. Least Number of Unique Integers after K Removals.java		1481. Least Number of Unique Integers after K Removals.java
150.Evaluate reverse polish notation.java		150.Evaluate reverse polish notation.java
153. Find min in Rotated Sorted Array.java		153. Find min in Rotated Sorted Array.java
155.Min Stack.java		155.Min Stack.java
1609. Even Odd Tree.java		1609. Even Odd Tree.java
162. Find peak element.java		162. Find peak element.java
1669. Merger In Between Linked Lists.java		1669. Merger In Between Linked Lists.java
19. Remove Nth Node From End of List.java		19. Remove Nth Node From End of List.java
2.Add two numbers.java		2.Add two numbers.java
20.Valid Parenthesis.java		20.Valid Parenthesis.java
2007.Find Original Array From Doubled Array.java		2007.Find Original Array From Doubled Array.java
207.CourseSchedule.java		207.CourseSchedule.java
21. Merge Two Sorted Lists.java		21. Merge Two Sorted Lists.java
2149. Rearrange Array Elements by Sign.java		2149. Rearrange Array Elements by Sign.java
232. Implement Queue Using Stacks.java		232. Implement Queue Using Stacks.java
234. Palindrome Linked List.java		234. Palindrome Linked List.java
253.Meeting rooms 2.java		253.Meeting rooms 2.java
26. Remove duplicates from Sorted Array.java		26. Remove duplicates from Sorted Array.java
268. Missing Number.java		268. Missing Number.java
2864. Maximum Odd Binary Number.java		2864. Maximum Odd Binary Number.java
287. Find the Duplicate Number.java		287. Find the Duplicate Number.java
290. Word Pattern.java		290. Word Pattern.java
2958. Length of Longest Subarray With at Most K Frequency.java		2958. Length of Longest Subarray With at Most K Frequency.java
2962. Count Subarrays Where Max Element Appears at Least K Times.java		2962. Count Subarrays Where Max Element Appears at Least K Times.java
2971. Find Polygon With the Largest Perimeter.java		2971. Find Polygon With the Largest Perimeter.java
3005. Count Elements With Maximum Frequency.java		3005. Count Elements With Maximum Frequency.java
3044. Most frequent prime.java		3044. Most frequent prime.java
3046. Split the Array.java		3046. Split the Array.java
3062. Winner of the Linked List Game.java		3062. Winner of the Linked List Game.java
3069. Distribute Elements Into Two Arrays I.java		3069. Distribute Elements Into Two Arrays I.java
3070. Count Submatrices with Top-Left Element and Sum Less Than k.java		3070. Count Submatrices with Top-Left Element and Sum Less Than k.java
33.Search in Rotated Sorted Array.java		33.Search in Rotated Sorted Array.java
35.Search Insert Position.java		35.Search Insert Position.java
36. Valid Sudoku.java		36. Valid Sudoku.java
4. Median of two sorted Arrays.java		4. Median of two sorted Arrays.java
400. Nth Digit.java		400. Nth Digit.java
406.QueueReconstruction.java		406.QueueReconstruction.java
41. First Missing Positive.java		41. First Missing Positive.java
413. Arithmetic Slices.java		413. Arithmetic Slices.java
442. Find all duplicates in an Array.java		442. Find all duplicates in an Array.java
451.Sort Characters by Frequency.java		451.Sort Characters by Frequency.java
49. Group Anagrams.java		49. Group Anagrams.java
498. Diagonal Matrix.java		498. Diagonal Matrix.java
513. Find Bottom Left Tree Value.java		513. Find Bottom Left Tree Value.java
515. Find largest value in each tree row.java		515. Find largest value in each tree row.java
529.Minesweeper.java		529.Minesweeper.java
54. Spiral Matrix.java		54. Spiral Matrix.java
543. Diameter of a binary tree.java		543. Diameter of a binary tree.java
621.TaskScheduler.java		621.TaskScheduler.java
622. Design Circular Queue.java		622. Design Circular Queue.java
636.Exclusive time of functions.java		636.Exclusive time of functions.java
67. Add Binary.java		67. Add Binary.java
702. Search in a Sorted Array of Unknown Size.java		702. Search in a Sorted Array of Unknown Size.java
705.DesignHashset.java		705.DesignHashset.java
713. Subarray product less than k.java		713. Subarray product less than k.java
74. Search in a 2D matrix.java		74. Search in a 2D matrix.java
75. Sort Colors.java		75. Sort Colors.java
763.PartitionLabels.java		763.PartitionLabels.java
80. Remove Duplicates from Sorted Array II.java		80. Remove Duplicates from Sorted Array II.java
83. Remove Duplicates from Sorted List.java		83. Remove Duplicates from Sorted List.java
876. Middle of the linked list.java		876. Middle of the linked list.java
9. Palindrome Number.java		9. Palindrome Number.java
931. Minimum Falling Path Sum.java		931. Minimum Falling Path Sum.java
977. Squares of a Sorted Array.java		977. Squares of a Sorted Array.java
983. Minimum cost for tickets.java		983. Minimum cost for tickets.java
HR.Connected Cells in Grid.java		HR.Connected Cells in Grid.java
Notes.txt		Notes.txt
readme		readme

Repository files navigation

#LeetCode questions
This repository is for keep track and note of the LeetCode problems solved.

- Some of the questions are in folders, which mean they are solved in more than one way.

- Committed the time taken to run the program and the top percentile of the runtime and memory have been mentioned in the commits.