This is the scope of the project, I happily invite you to contribute!

Intro Topics(Continually Updated...)

• Big O Notation

Data Structures

Linear

• Arrays
• Hash-Tables
• Linked-Lists
  • Singly Linked-List
  • Doubly Linked-List
  • Circular Linked-List
• Queues
• Stacks
• Strings

Non-Linear

• Graphs
  • Cyclic vs Acyclic
  • Direct vs Undirect
  • Weighted vs Unweighted
• Trees
  • General Tree
  • Binary Tree
  • Binary Search Tree
  • Balanced Tree
  • AVL Tree
  • Red Black Tree
• Trie

Algorithms

• Recursion
• Sorting
  • Bubble sort
  • Quick Sort
  • Merge Sort
  • Insertion sort
  • Selection sort
  • Heapsort
  • Counting sort
  • Radix sort
• Searching
  • Breath First Search
  • Depth First Search
• Dynamic Programming
• Memoization
• Greedy

Data-structures - Coming soon...

Hash Map & Arrays

Frequency	Problem	Stated	Solution	Solution
High	Two Sum		js	py
High	Valid Anagram		js	py
Medium	Jewels and Stones		js
High	Contains duplicates		js	py
High	Group Anagrams		...	py
High	Encode and Decode Strings		...
High	Valid Sudoku		...
High	Longest Consecutive Sequence		...
High	Top K Frequent Elements		...

Binary Search

Frequency	Problem	Stated	Solution	Solution
High	Binary Search		js	py
Low	Two Sum II - Input Array Is Sorted		js

Linked List

Frequency	Problem	Stated	Solution	Solution
High	Reverse a Linked List		js	py

Stacks & Queues

Frequency	Problem	Stated	Solution	Solution
High	Implement Queue using Stacks		js
High	Valid Parentheses		...
High	Design Circular Queue		...
High	Design Hit Counter		...
High	Trapping Rain Water		js	py

Trees

Frequency	Problem	Stated	Solution
Low	test		...

Graphs

Frequency	Problem	Stated	Solution
Low	test		...

Trie

Frequency	Problem	Stated	Solution
Low	test		...

Heap

Frequency	Problem	Stated	Solution
Low	test		...

Algorithms

An Algorithm is a set of intructions on how to solve particular problems

Prefix Sum

Frequency	Problem	Stated	Solution
High	Running Sum of 1d Array		js
High	Find Pivot Index		js

Sliding Window

Frequency	Problem	Stated	Solution
Low	Longest Substring Without Repeating Characters		js

Running Pointers

Frequency	Problem	Stated	Solution
Low	Backspace String compare		js

Suffix Arrays

Frequency	Problem	Stated	Solution
Low	test		js

Breath First Search

Frequency	Problem	Stated	Solution
Low	test		...

Depth First Search

Frequency	Problem	Stated	Solution
Low	test		...

Divide && Conquer

Frequency	Problem	Stated	Solution
Low	test		...

Recursion

Frequency	Problem	Stated	Solution
Low	test		...

Dynamic Programming

Frequency	Problem	Stated	Solution
Low	test		...

Math

Frequency	Problem	Stated	Solution
Low	test		...

Greedy

Frequency	Problem	Stated	Solution
Low	Container With Most Water		js

Matrix

Frequency	Problem	Stated	Solution
Low	test		...

Geometry

Frequency	Problem	Stated	Solution
Low	test		...

---

How to use this repo

Getting Started

If you'd like to contribute to ace tech interview, please follow these steps;

How to Contribute

1. Clone the repo to your local machine using git clone
2. Navigate to the project directory using cd ace-technical-interview
3. Install the necessary packages and dependencies by running npm install.
4. Start the development server by running npm start
5. Open the app in your web browser by going to http://localhost:3000.

Features

Ace Tech Interview has the following features:

• Data structures
• Algorithms
• Leetcode Solutions in JavaScript && Python

Fork the repo

1. Clone your fork to your local machine using git clone here
2. Create a new branch for your changes using git checkout -b my-new-branch.
3. Make your changes and test them locally.
4. Push your changes to your fork using git push origin my-new-branch. 5 Create a pull request on GitHub.

License