This project consists of a series of 30 LeetCode questions, accompanied by videos where we discuss the solutions to these questions. The goal is to provide a solid preparation for interviews at major technology companies, covering asymptotic analysis and performance trade-offs.
Each day of the challenge corresponds to a file, numbered by date. Inside each exercise, you will find the solution code in C++, along with asymptotic analysis and performance trade-offs.
You can find the solution videos here -> HTGO
- Find Eventual Safe States
- Missing Number
- Valid Anagram
- Intersection Of Two Linked Lists
- Group Anagrams
- Inorder Traversal
- First Bad Version
- Insert Delete Get Random
- Candy
- Construct K palindrome Strings
- Minimum Right Shifts To Sort The Array
- Find If Path Exists In Graph
- Find Center Of Star Graph
- Clone Graph
- Average Of Levels Binary Tree
- All Paths From Source To Target
- Find Eventual Safe States
- Koko Eating Bananas
- Minimum Number Of Days To Make Bouquets
- Number Of Provinces
- Number Of Provinces
- Climbing Stairs
- Longest Increasing Subsequence
- Longest Common Subsequence
- Subdomain Visit Count
- Binary Tree Maximum Path Sum
- Evaluate Reverse Polish Notation
- Sudoku Solver
- Next Greater Element
- Implement Queue Using Stacks
Feel free to contribute by adding solutions in other languages or improving existing solutions ❤️