imdhemy / leetCode

LeetCode Problems and Solutions

LeetCode

In this repo, I add my attempts and notes while solving Leet Code problems.

Basics

The following tables contain the basics that should be well studied:

Data Structures

Data Structure	Status
Linked Lists	[ ]
Trees	[ ]
Tries	[ ]
Graphs	[ ]
Stacks	[ ]
Queues	[ ]
Heaps	[ ]
Vectors	[ ]
ArrayLists	[ ]
Hash Tables	[ ]

Algorithms

Algorithm	Status
Breadth-First Search	[ ]
Depth-First Search	[ ]
Binary Search	[ ]
Merge Sort	[ ]
Quick Sort	[ ]

Concepts

Concepts	Status
Bit Manipulation	[ ]
Memory (Stack vs. heap)	[ ]
Recursion	[ ]
Dynamic Programming	[ ]
Big O Time & Space	[ ]

Notes

Below is a study notes, helpful courses and study materials.

• Bitwise Operators.
• Sequences.
• Recursion in Programming - Full Course.
• Solve Coding Interview Backtracking Problems - Crash Course.
• Lower bound & upper bound binary search in Python.
• Window Sliding Technique
• Toggling k-th bit of a number
• Edit Distance | Video | Geeks 4 Geeks

CTCI on LeetCode

I'll try to map the "Cracking the coding interview problems" into LeetCode problems.

• Chapter 1 : Arrays and Strings.
• Chapter 2 : Linked Lists.
• Chapter 3 : Stacks and Queues.
• Chapter 4 : Trees and Graphs.
• Chapter 5 : Bit Manipulation.
• Chapter 6 : Math and Logic Puzzles.
• Chapter 7 : Object-Oriented Design.
• Chapter 8 : Recursion and Dynamic Programming.
• Chapter 9 : System Design and Scalability.
• Chapter 10 : Sorting and Searching.
• Chapter 11 : Testing.
• Chapter 12 : C and C++.
• Chapter 13 : Java.
• Chapter 14 : Databases.
• Chapter 15 : Threads and Locks.
• Chapter 16 : Moderate.
• Chapter 17 : Hard.

Chapter 1 : Arrays and Strings

CTCI	LEETCODE
Is Unique	217. Contains Duplicate
Check Permutation	567. Permutation in String
Urilfy	Not Found
Palindrome Permutation	Premium
One Away	Premium
String Compression	443. String Compression