Name		Name	Last commit message	Last commit date
.vscode		.vscode
test		test
1. Two Sum.js		1. Two Sum.js
1002. Find Common Characters.js		1002. Find Common Characters.js
1020. Partition Array Into Three Parts With Equal Sum.js		1020. Partition Array Into Three Parts With Equal Sum.js
112. Path Sum.js		112. Path Sum.js
119. Pascal's Triangle II.js		119. Pascal's Triangle II.js
129. Sum Root to Leaf Numbers.js		129. Sum Root to Leaf Numbers.js
148. Sort List.js		148. Sort List.js
15. 3Sum.js		15. 3Sum.js
152. Maximum Product Subarray.js		152. Maximum Product Subarray.js
160. Intersection of Two Linked Lists.js		160. Intersection of Two Linked Lists.js
169. Majority Element.js		169. Majority Element.js
173. Binary Search Tree Iterator.js		173. Binary Search Tree Iterator.js
198. House Robber.js		198. House Robber.js
206. Reverse Linked List.js		206. Reverse Linked List.js
215. Kth Largest Element in an Array.js		215. Kth Largest Element in an Array.js
217. Contains Duplicate.js		217. Contains Duplicate.js
221. Maximal Square.js		221. Maximal Square.js
226. Invert Binary Tree.js		226. Invert Binary Tree.js
234. Palindrome Linked List.js		234. Palindrome Linked List.js
235. Lowest Common Ancestor of a Binary Search Tree.js		235. Lowest Common Ancestor of a Binary Search Tree.js
236. Lowest Common Ancestor of a Binary Tree.js		236. Lowest Common Ancestor of a Binary Tree.js
238. Product of Array Except Self.js		238. Product of Array Except Self.js
257. Binary Tree Paths.js		257. Binary Tree Paths.js
279. Perfect Squares.js		279. Perfect Squares.js
279. Perfect Squares.py		279. Perfect Squares.py
283. Move Zeroes.js		283. Move Zeroes.js
287. Find the Duplicate Number.js		287. Find the Duplicate Number.js
300. Longest Increasing Subsequence.js		300. Longest Increasing Subsequence.js
301. Remove Invalid Parentheses.js		301. Remove Invalid Parentheses.js
322. Coin Change.js		322. Coin Change.js
33. Search in Rotated Sorted Array.js		33. Search in Rotated Sorted Array.js
337. House Robber III.js		337. House Robber III.js
338. Counting Bits.js		338. Counting Bits.js
347. Top K Frequent Elements.js		347. Top K Frequent Elements.js
394. Decode String.js		394. Decode String.js
406. Queue Reconstruction by Height.js		406. Queue Reconstruction by Height.js
416. Partition Equal Subset Sum.js		416. Partition Equal Subset Sum.js
437. Path Sum III.js		437. Path Sum III.js
438. Find All Anagrams in a String.js		438. Find All Anagrams in a String.js
442. Find All Duplicates in an Array.js		442. Find All Duplicates in an Array.js
448. Find All Numbers Disappeared in an Array.js		448. Find All Numbers Disappeared in an Array.js
46. Permutations.js		46. Permutations.js
461. Hamming Distance.js		461. Hamming Distance.js
474. Ones and Zeroes.js		474. Ones and Zeroes.js
485. Max Consecutive Ones.js		485. Max Consecutive Ones.js
494. Target Sum.js		494. Target Sum.js
5. Longest Palindromic Substring.js		5. Longest Palindromic Substring.js
501. Find Mode in Binary Search Tree.js		501. Find Mode in Binary Search Tree.js
509. Fibonacci Number.js		509. Fibonacci Number.js
538. Convert BST to Greater Tree.js		538. Convert BST to Greater Tree.js
543. Diameter of Binary Tree.js		543. Diameter of Binary Tree.js
559. Maximum Depth of N-ary Tree.js		559. Maximum Depth of N-ary Tree.js
572. Subtree of Another Tree.js		572. Subtree of Another Tree.js
581. Shortest Unsorted Continuous Subarray.js		581. Shortest Unsorted Continuous Subarray.js
617. Merge Two Binary Trees.js		617. Merge Two Binary Trees.js
62. Unique Paths.js		62. Unique Paths.js
621. Task Scheduler.js		621. Task Scheduler.js
628. Maximum Product of Three Numbers.js		628. Maximum Product of Three Numbers.js
64. Minimum Path Sum.js		64. Minimum Path Sum.js
643. Maximum Average Subarray I.js		643. Maximum Average Subarray I.js
646. Maximum Length of Pair Chain.js		646. Maximum Length of Pair Chain.js
647. Palindromic Substrings.js		647. Palindromic Substrings.js
680. Valid Palindrome II.js		680. Valid Palindrome II.js
681. Next Closest Time.js		681. Next Closest Time.js
71. Simplify Path.js		71. Simplify Path.js
724. Find Pivot Index.js		724. Find Pivot Index.js
746. Min Cost Climbing Stairs.js		746. Min Cost Climbing Stairs.js
766. Toeplitz Matrix.js		766. Toeplitz Matrix.js
771. Jewels and Stones.js		771. Jewels and Stones.js
78. Subsets.js		78. Subsets.js
79. Word Search.js		79. Word Search.js
81. Search in Rotated Sorted Array II.js		81. Search in Rotated Sorted Array II.js
820. Short Encoding of Words.js		820. Short Encoding of Words.js
821. Shortest Distance to a Character.js		821. Shortest Distance to a Character.js
830. Positions of Large Groups.js		830. Positions of Large Groups.js
832. Flipping an Image.js		832. Flipping an Image.js
85. Maximal Rectangle.js		85. Maximal Rectangle.js
905. Sort Array By Parity.js		905. Sort Array By Parity.js
914. X of a Kind in a Deck of Cards.js		914. X of a Kind in a Deck of Cards.js
922. Sort Array By Parity II.js		922. Sort Array By Parity II.js
931. Minimum Falling Path Sum.js		931. Minimum Falling Path Sum.js
934. Shortest Bridge.js		934. Shortest Bridge.js
94. Binary Tree Inorder Traversal.js		94. Binary Tree Inorder Traversal.js
96. Unique Binary Search Trees.js		96. Unique Binary Search Trees.js
967. Numbers With Same Consecutive Differences.js		967. Numbers With Same Consecutive Differences.js
977. Squares of a Sorted Array.js		977. Squares of a Sorted Array.js
98. Validate Binary Search Tree.js		98. Validate Binary Search Tree.js
983. Minimum Cost For Tickets.js		983. Minimum Cost For Tickets.js
README.md		README.md
approaches.txt		approaches.txt
sortstackusingstack.js		sortstackusingstack.js

Repository files navigation

algorithms_and_problems

Leetcode problems I have worked on.

About

Prep (leetcode)

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages