Skip to content

Latest commit

 

History

History
119 lines (80 loc) · 2.69 KB

README.md

File metadata and controls

119 lines (80 loc) · 2.69 KB

Data Structures & Algorithm in Python 😎


This repo contains solutions to algorithmic problems from various platforms like
NeetCode, Strivers A2Z DSA Course/Sheet, LeetCode, AlgoExpert, HackerRank, CodeSignal.


🔥 Note:

* The solutions are all written in **Python**.
* `a1.py` is an abbreviation of `all in one`. i.e.,  if a problem can be solved in multiple ways, then `a1.py` has all the solutions in a single file. (Just to make it easy, to compare and get the flow of how brute force can be changed to optimal solution)

🤔 How to use?

To run the programs, 
* First clone the repository
* Then cd into xxx folder,
* Now use `python3 filename.py` command to execute the code.🤝

📚 Topics

🏅 Algorithms:

-- Need to complete --
* Sorting Algorithm.
* Searching Algorithm

🚀 Data Structure:

1. Array & Hashing.
2. Two Pointers.
3.  Sliding Window.
4.  Stack.
5.  Binary Search.
6.  Linked List.
7.  Trees.
8.  Heaps.
9.  Back Tracking.
10.  Graphs.
11.  Dynamic Programming.
12.  Greedy.
13.  Tries.
14.  Intervals.
15.  Bit Manipulation.

🐒 NeetCode - Blind 75.

In this section, I use neetcode.io to solve algorithmic problems.


🐶 Strivers A2Z DSA Course/Sheet.

In this section, I use A2Z Sheet to solve algorithmic problems.


🐸 AlgoExpert

In this section, I use AlgoExpert to solve algorithmic problems.


🦧 LeetCode

In this section, I use leetcode to solve algorithmic problems.

1. Graph Theory: Essential Graph Problems


🦖 CTCI

Python solutions for 💥 Cracking the Coding Interview, 6th Edition by _Gayle Laakmann McDowell_.💥


🦦HackerRank

In this section, I use HackerRank to solve algorithmic problems.


🐲 Visuals

Understanding of sorting algorithms

Slide1