Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

bunu23/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

History

96 Commits

Repository files navigation

LeetCode Solutions (JAVA)

Table of Contents

  1. Easy

  2. Medium

  3. Hard

🟒 Easy

# Problem Solution Type
1 Reverse Linked List Solution LinkedList
2 Merge Two Sorted Lists Solution LinkedList
3 Palindrome Linked List Solution LinkedList
4 Remove Duplicates Solution LinkedList
5 Linked List Cycle Solution LinkedList
6 Intersection of Two Linked Lists Solution LinkedList
7 Remove Linked List Elements Solution LinkedList
8 Middle of Linked List Solution LinkedList
9 Minimum String Length After Removing Substrings Solution Stack
10 Binary Tree InOrder Traversal Solution Stack, Tree
11 Binary Tree Preorder Traversal Solution Stack, Tree
12 Binary Tree Postorder Traversal Solution Stack, Tree
13 Minimum Number of Swaps to Make the String Balanced Solution Stack, String,Two Pointer
14 Palindrome Number Solution Math
15 Majority Element Solution Array
16 Missing Number Solution Array
17 Move Zeroes Solution Array
18 Roman to Integer Solution String
19 Longest Common Prefix Solution String
20 Valid Parenthesis Solution String , Stack
21 Find the Index of the First Occurrence in a String Solution String
22 Length of Last Word Solution String
23 Add Binary Solution String
24 Valid Palindrome Solution String
25 Excel Sheet Column Title Solution String
26 Excel Sheet Column Number Solution String
27 Valid Anagram Solution String
28 Binary Tree Paths Solution String
29 Contains Duplicate Solution HashSet, Array

Back to TOC

🟠 Medium

# Problem Solution Type
1 Add Two Numbers Solution LinkedList
2 Delete Nodes from Linked List Present in Array Solution LinkedList
3 Minimum Add to Make Parentheses Valid Solution String, Stack
4 Maximum Width Ramp Solution Array, Stack
5 The Number of the Smallest Unoccupied Chair Solution ArrayList, Priority Queue (Min-Heap)
6 Separate Black and White Balls Solution String
7 Longest Square Streak in an Array Solution Array, HashMap
8 Product of Array Except Self Solution Array

Back to TOC

πŸ”΄ Hard

# Problem Solution Type
1 First Missing Positive Solution Arrays

Back to TOC

Directory Structure

πŸ“‚ project-root
β”œβ”€β”€ πŸ“‚ easy
β”‚ β”œβ”€β”€ πŸ“‚ TwoSum
β”‚ β”‚ └── Solution.java
β”‚ β”œβ”€β”€ πŸ“‚ ValidPalindrome
β”‚ └── Solution.java
β”œβ”€β”€ πŸ“‚ medium
β”‚ β”œβ”€β”€ πŸ“‚ AddTwoNumbers
β”‚ β”‚ └── Solution.java
β”‚ β”œβ”€β”€ πŸ“‚ LongestSubstring
β”‚ └── Solution.java
β”œβ”€β”€ πŸ“‚ hard
β”‚ β”œβ”€β”€ πŸ“‚ MedianSortedArrays
β”‚ β”‚ └── Solution.java
β”‚ β”œβ”€β”€ πŸ“‚ RegexMatching
β”‚ └── Solution.java
└── README.md

AltStyle γ«γ‚ˆγ£γ¦ε€‰ζ›γ•γ‚ŒγŸγƒšγƒΌγ‚Έ (->γ‚ͺγƒͺγ‚ΈγƒŠγƒ«) /