saulmaldonado/ds-and-algorithms

Data structures and algorithm problems with solution explanations and implementations for JavaScript, TypeScript, Go, and Java

JavaMIT

Data Structures and Algorithm Problems Using JavaScript, TypeScript, Go and Java

Data structures and algorithm problems with solution explanations and implementations for different languages

📊 Organized by topic

Math

Reverse Integer - Easy
Integer To Roman - Medium
Maximum Score From Removing Stones - Medium
Reordered Power Of 2 - Medium
Permutation Sequence - Hard
Powx N - Medium
Minimum Operations To Make Array Equal - Medium
Broken Calculator - Medium
Add Binary - Easy
Nim Game - Easy
Plus One - Easy
Palindrome Number - Easy
Generate Random Point In A Circle - Medium

Stacks

Largest Rectangle In Histogram - Hard
Find The Most Competitive Subsequence - Medium
Flatten Nested List Iterator - Medium
Maximum Frequency Stack - Hard
Valid Parentheses - Easy
Validate Stack Sequences - Medium
Score Of Parentheses - Medium
Maximal Rectangle - Hard

Bit Manipulation

Concatenation Of Consecutive Binary Numbers - Medium
Number Of Steps To Reduce A Number To Zero - Easy
Number Of 1 Bits - Medium
Missing Number - Easy
Single Number - Easy
Divide Two Integers - Medium

Arrays

Create Sorted Array Through Instructions - Hard
Contains Duplicate - Easy
Longest Harmonious Subsequence - Easy
Shortest Unsorted Continuous Subarray - Medium
Global And Local Inversions - Medium
Russian Doll Envelopes - Hard
Longest Consecutive Sequence - Hard
Can Make Arithmetic Progression From Sequence - Easy
Kth Missing Positive Number - easy
Check If All 1s Are At Least Length K Places Away - Easy
Beautiful Arrangement Ii - Medium
Remove Elements - Easy
Best Time To Buy And Sell Stock Ii - Easy
Distribute Candies - Easy
Fibonacci Number - Easy
Search In Rotated Array Ii - Medium
3sum - Medium
Container With Most Water - Medium
First Missing Positive - Hard
Best Time To Buy And Sell Stock - Easy
Merge Intervals - Medium
Minimum Operations To Reduce X To Zero - Medium
Insert Interval - Medium
Set Mismatch - Easy
Search In Rotated Array - Medium
Average Waiting Time - Medium
Sort Colors - Medium
Substring With Concatenation Of All Words - Hard
Next Permutation - Medium
Peeking Iterator - Medium
2sum - Easy
Brick Wall - Medium
Remove Duplicates From Sorted Array - Easy
Sum Of Absolute Differences In A Sorted Array - Medium
Max Number Of K Sum Pairs - Medium
Merge Sorted Array - Easy
Kth Largest Element In An Array - Medium
Shortest Distance To A Character - Easy
Boats To Save People - Medium
3sum With Multiplicity - Medium
Check If Array Is Sorted And Rotated - Easy

Strings

Minimum Remove To Make Valid Parentheses - Medium
Stamping The Sequence - Hard
Vowel Spellchecker - Medium
Text Justification - Hard
Longest Common Prefix - Easy
Count And Say - Easy
Multiply Strings - Medium
Custom Sort String - Medium
Remove Palindromic Subsequences - Easy
Check If A String Contains All Binary Codes Of Size K - Medium
Group Anagrams - Medium
Valid Number - Hard
Minimum Window Substring - Hard
Determine If Two Strings Are Close - Medium
Wildcard Matching - Hard
Length Of Last Word - Easy
Palindromic Substrings - Medium
Check If Two String Arrays Are Equivalent - Easy
Longest Word In Dictionary Through Deleting - Medium
Valid Anagram - Easy
String To Integer - Medium
Word Subsets - Medium
Verifying An Alien Dictionary - Easy
Determine If String Halves Are Alike - Easy
Letter Combinations Of A Phone Number - Medium
Longest Valid Parentheses - Hard
Reconstruct Original Digits From English - Medium
Edit Distance - Hard
Generate Parentheses - Medium
Roman To Integer - Easy
StrStr - Easy
Longest Palindromic Substring - Medium
Zigzag Conversion - Medium
Longest Substring Without Repeating Characters - Medium

Breadth First Search

Dynamic Programming

Ones And Zeroes - Medium
Remove Boxes - Hard
Cherry Pickup Ii - Hard
Coin Change - Medium
Best Time To Buy And Sell Stock With Transaction Fee - Medium
Get Maximum In Generated Array - Easy
Binary Trees With Factors - Medium
Unique Paths Ii - Medium
Arithmetic Slices - Medium
Minimum Path Sum - Medium
Maximal Square - Medium
Unique Paths - Medium
Regular Expression Matching - Hard
Climbing Stairs - Easy
Trapping Rain Water - Hard

Binary Search

Find First And Last Position Of Element In Sorted Array - Medium
Sqrtx - Easy
Search Insert Position - Easy
Median Of Two Sorted Arrays - Hard

Matrices

Greedy

Jump Game Ii - Hard
Jump Game - Medium
Wiggle Subsequence - Medium
Advantage Shuffle - Medium
Smallest String With A Given Numeric Value - Medium

Linked Lists

Copy List With Random Pointer - Medium
Palindrome Linked List - Easy
Partition List - Medium
Simplify Path - Medium
Linked List Cycle - Easy
Add Two Numbers - Medium
Swapping Nodes In A Linked List - Medium
Remove Duplicates From Sorted List - Easy
Reverse Nodes In K Group - Hard
Merge K Sorted Lists - Hard
Merge Two Sorted Lists - Easy
Lru Cache - Medium
Intersection Of Two Linked Lists - Easy
Remove Nth Node From End Of List - Medium

Binary Trees

Binary Tree Right Side View - Medium
Flip Binary Tree To Match Preorder Traversal - Medium
Find A Corresponding Node Of A Binary Tree In A Clone Of That Tree - Easy
Convert Bst To Greater Tree - Medium
Vertical Order Traversal Of A Binary Tree - Hard
Trim A Binary Search Tree - Medium
N Ary Tree Preorder Traversal - Easy

Tries

Implement Trie Prefix Tree - Medium
Short Encoding Of Words - Medium

Hashmap

Backtracking

Sudoku Solver - Hard
Letter Case Permutation - Medium
Combination Sum - Medium
N Queens - Hard
N Queens Ii - Hard
Combination Sum Ii - Medium
Permutations Ii - Medium
Combinations - Medium
Permutations - Medium
Subsets - Medium

Heap

Priority Queue - Medium
Minimize Deviation In Array - Hard

Dijkstras

Path With Minimum Effort - Medium

👤 Author

Saul Maldonado

🐱 Github: @saulmaldonado
🤝 LinkedIn: @saulmaldonado4
🐦 Twitter: @saul_mal
💻 Website: saulmaldonado.tech

Show your support

Give a ⭐️ if this project helped you!