LiquidatorCoder / dsa-practice

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

DSA

Data Structures

1. Arrays

Problem Difiiculty Link Solved
Non-decreasing arrays 🟒 πŸ”— βœ”οΈ
Build Array from Permutation 🟒 πŸ”— βœ”οΈ
Two Sum 🟒 πŸ”— βœ”οΈ
Remove Duplicates from Sorted Array 🟒 πŸ”— βœ”οΈ
Maximize the sum 🟒 πŸ”— βœ”οΈ
Remove Element 🟒 πŸ”— βœ”οΈ
Maximum Subarray 🟒 πŸ”— βœ”οΈ
Transpose Matrix 🟒 πŸ”— βœ”οΈ
Degree of an Array 🟒 πŸ”— βœ”οΈ
Monk and Inversions 🟒 πŸ”— β›”
Contains Duplicate 🟒 πŸ”— βœ”οΈ
Merge Sorted Array 🟒 πŸ”— βœ”οΈ
Intersection of Two Arrays 🟒 πŸ”— βœ”οΈ
Intersection of Two Arrays II 🟒 πŸ”— βœ”οΈ
Best Time to Buy and Sell Stock 🟒 πŸ”— βœ”οΈ
Convert 1D Array Into 2D Array 🟒 πŸ”— βœ”οΈ
Reshape the Matrix 🟒 πŸ”— βœ”οΈ
Subsets 🟠 πŸ”— βœ”οΈ

2. Strings

Problem Difiiculty Link Solved
Sort the Substring 🟒 πŸ”— βœ”οΈ
Bracket sequences 🟒 πŸ”— β›”
Final Value of Variable After Performing Operations 🟒 πŸ”— βœ”οΈ
Valid Parentheses 🟒 πŸ”— βœ”οΈ
Reverse Words in a String III 🟒 πŸ”— βœ”οΈ

3. Linked List

Problem Difiiculty Link Solved
Convert Binary Number in a Linked List to Integer 🟒 πŸ”— βœ”οΈ
Middle of the Linked List 🟒 πŸ”— βœ”οΈ
Delete the Middle Node of a Linked List 🟠 πŸ”— βœ”οΈ
Swap Nodes in Pairs 🟠 πŸ”— βœ”οΈ
Remove Nth Node From End of List 🟠 πŸ”— βœ”οΈ
Remove Duplicates from Sorted List 🟒 πŸ”— βœ”οΈ

4. Tree

Problem Difiiculty Link Solved
Binary Tree Inorder Traversal 🟒 πŸ”— βœ”οΈ
Binary Tree Preorder Traversal 🟒 πŸ”— βœ”οΈ
Binary Tree Postorder Traversal 🟒 πŸ”— βœ”οΈ
Two Sum IV - Input is a BST 🟒 πŸ”— βœ”οΈ

Algos

1. Binary Search

Problem Difiiculty Link Solved
Binary Search 🟒 πŸ”— βœ”οΈ
First Bad Version 🟒 πŸ”— βœ”οΈ
Search Insert Position 🟒 πŸ”— βœ”οΈ

2. Two Pointers

Problem Difiiculty Link Solved
Squares of a Sorted Array 🟒 πŸ”— βœ”οΈ
Rotate Array 🟠 πŸ”— βœ”οΈ
Move Zeroes 🟒 πŸ”— βœ”οΈ
Two Sum II 🟒 πŸ”— βœ”οΈ
Reverse String 🟒 πŸ”— βœ”οΈ
Remove Nth Node From End of List 🟠 πŸ”— βœ”οΈ

3. Recursion/Backtracking

Problem Difiiculty Link Solved
Subsets 🟠 πŸ”— βœ”οΈ
Letter Case Permutation 🟠 πŸ”— βœ”οΈ

4. Dynamic Programming

Problem Difiiculty Link Solved
Fibonacci Number 🟒 πŸ”— βœ”οΈ
Climbing Stairs 🟒 πŸ”— βœ”οΈ
N-th Tribonacci Number 🟒 πŸ”— βœ”οΈ

5. Bit manipulation

Problem Difiiculty Link Solved
Subsets 🟠 πŸ”— βœ”οΈ

About