Skip to content

Phenzic/LeetCode-Solutions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

55 Commits
1031. Add to Array-Form of Integer
1031. Add to Array-Form of Integer
 
 
105. Construct Binary Tree from Preorder and Inorder Traversal
105. Construct Binary Tree from Preorder and Inorder Traversal
 
 
1063. Best Sightseeing Pair
1063. Best Sightseeing Pair
 
 
1116. Maximum Level Sum of a Binary Tree
1116. Maximum Level Sum of a Binary Tree
 
 
1236. N-th Tribonacci Number
1236. N-th Tribonacci Number
 
 
136. Single Number
136. Single Number
 
 
1441. Minimum Flips to Make a OR b Equal to c
1441. Minimum Flips to Make a OR b Equal to c
 
 
1474. Longest ZigZag Path in a Binary Tree
1474. Longest ZigZag Path in a Binary Tree
 
 
1502. Construct K Palindrome Strings
1502. Construct K Palindrome Strings
 
 
1524. String Matching in an Array
1524. String Matching in an Array
 
 
1537. Maximum Score After Splitting a String
1537. Maximum Score After Splitting a String
 
 
1544. Count Good Nodes in Binary Tree
1544. Count Good Nodes in Binary Tree
 
 
16. 3Sum Closest
16. 3Sum Closest
 
 
1894. Merge Strings Alternately
1894. Merge Strings Alternately
 
 
1895. Minimum Number of Operations to Move All Balls to Each Box
1895. Minimum Number of Operations to Move All Balls to Each Box
 
 
199. Binary Tree Right Side View
199. Binary Tree Right Side View
 
 
2059. Unique Length-3 Palindromic Subsequences
2059. Unique Length-3 Palindromic Subsequences
 
 
207. Course Schedule
207. Course Schedule
 
 
2102. Find the Middle Index in Array
2102. Find the Middle Index in Array
 
 
2121. Find if Path Exists in Graph
2121. Find if Path Exists in Graph
 
 
215. Kth Largest Element in an Array
215. Kth Largest Element in an Array
 
 
217. Contains Duplicate
217. Contains Duplicate
 
 
2221. Check if a Parentheses String Can Be Valid
2221. Check if a Parentheses String Can Be Valid
 
 
2292. Counting Words With a Given Prefix
2292. Counting Words With a Given Prefix
 
 
2358. Number of Ways to Split Array
2358. Number of Ways to Split Array
 
 
236. Lowest Common Ancestor of a Binary Tree
236. Lowest Common Ancestor of a Binary Tree
 
 
24. Swap Nodes in Pairs
24. Swap Nodes in Pairs
 
 
2413. Smallest Number in Infinite Set
2413. Smallest Number in Infinite Set
 
 
2465. Shifting Letters II
2465. Shifting Letters II
 
 
2553. Total Cost to Hire K Workers
2553. Total Cost to Hire K Workers
 
 
2562. Count Ways To Build Good Strings
2562. Count Ways To Build Good Strings
 
 
2636. Maximum Subsequence Score
2636. Maximum Subsequence Score
 
 
2691. Count Vowel Strings in Ranges
2691. Count Vowel Strings in Ranges
 
 
3309. Count Prefix and Suffix Pairs I
3309. Count Prefix and Suffix Pairs I
 
 
338. Counting Bits
338. Counting Bits
 
 
399. Evaluate Division
399. Evaluate Division
 
 
412. Fizz Buzz
412. Fizz Buzz
 
 
415. Add Strings
415. Add Strings
 
 
43. Multiply Strings
43. Multiply Strings
 
 
437. Path Sum III
437. Path Sum III
 
 
450. Delete Node in a BST
450. Delete Node in a BST
 
 
48. Rotate Image
48. Rotate Image
 
 
689. Maximum Sum of 3 Non-Overlapping Subarrays
689. Maximum Sum of 3 Non-Overlapping Subarrays
 
 
783. Search in a Binary Search Tree
783. Search in a Binary Search Tree
 
 
84. Largest Rectangle in Histogram
84. Largest Rectangle in Histogram
 
 
871. Keys and Rooms
871. Keys and Rooms
 
 
952. Word Subsets
952. Word Subsets
 
 
README.md
README.md
 
 

Repository files navigation

All Answered Leetcode Questions

About

All of my solutions for LeetCode problems. Made with LeetCode-to-GitHub: bit.ly/L2G-GH

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages