-
Algorithms and problems - Java Implementation
-
-
- MazeRunner: Source
- WordInMatrix: Source
- N-Queen problem
-
- Binary search
- Linear search
-
Sorting: Reference
- Bubble sort
- Heap sort: Source
- Selection sort
- Merge sort
- Bucket sort: Source
- Quick sort: Pseudocode
- Radix sort
-
- BFS: Pseudocode, Source code
- DFS: Pseudocode
-
- Dijktra's: Pseudocode
-
- Longest Path in a Matrix
- Kadane: Pseudocode
- Knapsack Problem: Source code
- Longest Palindromic Subsequence
- Longest Common Subsequence
- Longest Common Substring
- Subset sum: [DP] [Recursive]
-
-
Find unique character string using: [Brute force][ASCII]
-
Reverse string using:
-
Parsing:
- Parse String basics
- Sum of Numbers in a String Using: [Matcher] [Split]
- Sort On email domain and username
-
Substring:
-
Longest Substring Length without repeating characters using Set
-
Sliding Window Algorithm:
- Template
- Find All Anagrams in a String Using: [HashMap] [ASCII]
- Shortest Unique Substring using One HashMap
- Longest Palindromic Substring
- Longest Substring Length without repeating characters
-
- Factorial: [Iterative][Recursion]
- Fibonacci: [Iterative][Recusrion]
- Prime Numbers: [Iterative][Stream][Sieve of Eratosthenes : Pseudocode]
- FizzBuzz
- Reverse Numbers
- Biggest Number
- NBitString using nested recursion