https://github.com/gouthampradhan/leetcode

Java
Leetcode solutions

Leetcode solutions in Java

My accepted leetcode solutions to some of the common interview problems.

Array

• Pascals Traiangle II (Easy)
• Product Of Array Except Self (Medium)
• Rotate Matrix (Medium)
• Set Matrix Zeroes (Medium)
• Third Maximum Number (Easy)
• TwoSum II (Easy)

Backtracking

• Combinations (Medium)
• Combinations Sum (Medium)
• Combinations Sum II (Medium)
• Letter Phone Number (Medium)
• Paliandrome Partitioning (Medium)
• Permutations (Medium)
• Permutations II (Medium)
• SubSets (Medium)
• SubSet II (Medium)
• WordSearch (Medium)

Binary Search

• Minimum Sorted Rotated Array (Medium)
• Search in a Rotated Sorted Array (Medium)

Bit Manipulation

• Gray Code (Medium)

Breadth First Search

• Binaray Tree Level Order Traversal (Medium)
• Word Ladder (Medium)
• Word Ladder II (Hard)

Depth First Search

• Minesweeper (Medium)
• Movie Recommend (Medium)
• Number Of Islands (Medium)

Design

• Copy List With Random Pointer (Medium)
• Encode and Decode Tiny URL (Medium)
• LFU Cache (Hard)
• LRU Cache (Hard)
• Insert Delete Get Random (Medium)
• Serialize Deserialize Binary Tree (Hard)
• Design Twitter (Medium)

Devide and Conquer

• Kth Largest Element In a Array (Medium)
• Search in a 2D Matrix (Medium)

Dynamic Programming

• Best Time To Buy and Sell Stocks (Easy)
• Climbing Stairs (Easy)
• Coin Change 2 (Medium)
• Decode Ways (Medium)
• House Robber (Easy)
• Longest Increasing Subsequence (Medium)
• Longest Paliandromic Substring (Medium)
• Longest Palindromic Subsequence (Medium)
• Maximum Product Subarray (Medium)
• Palindrome Partitioning II (Hard)
• UniqueBinary Search Trees (Medium)
• Unique Binary Search Trees II (Medium)
• WordBreak (Medium)
• WordBreak II (Hard)

Greedy

• Jump Game (Medium)
• Jump Game II (Medium)

Hashing

• Anagrams (Medium)
• Group Anagrams (Medium)
• Kdiff Pairs In a Array (Easy)
• Sort Character by Frequency (Medium)
• Two Sum (Easy)
• Valid Anagram (Easy)

Heap

• Sliding Window Maximum (Hard)

Linked List

• Intersection of two Linked-Lists (Easy)
• Linked List Cycle (Easy)
• Merge K Sorted Lists (Hard)
• Merge Two Sorted List (Easy)
• Paliandrome List (Easy)
• Reverse Linked List (Easy)

Math

• Add Two Numbers (Medium)
• Count Primes (Easy)
• Rotate Function (Medium)

Stack

• Min Stack (Easy)
• Valid Parentheses (Easy))

String

• First Unique Character In a String (Easy)
• Repeated Substring Pattern (Easy)
• ReverseWords II (Medium)
• String to Integer (Medium)
• Text Justification (Hard)

Tree

• Binaray Tree Right Side View (Medium)
• Binary Tree Maximum Path Sum (Hard)
• Boundary of Binary Tree (Medium)
• Convert sorted array to BST (Medium)
• Lowest Common Ancestor of a Binary Tree (Medium)
• Lowest Common Ancestor of a BST (Easy)
• Most Frequent Subtree Sum (Medium)
• Path Sum III (Easy)
• Convert Postorder and Inorder traversal to Binary Tree (Medium)
• Convert Preorder and Inorder traversal to Binary Tree (Medium)
• Sorted Array to BST (Medium)
• Valid Binary Search Tree (Medium)

Two Pointers

• Four Sum (Medium)
• Longest Substring Witout Repeats (Medium)
• Three Sum (Medium)
• Trapping Rain Water (Hard)