iitm-pdsa-leet-code

KO | EN

gitlite — search

#javascript #hacktoberfest #react #llm #golang #go #machine-learning #deep-learning #macos #nodejs #awesome #cli #vue #awesome-list

iitm-pdsa-leet-code

(★ 16)

Collection of Leet Code problems for the IITM BS Degree PDSA Course

iitm-pdsa-leet-code 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# 📚 Programming, Data Structures, and Algorithms Using Python

Welcome to the supplementary GitHub repository for the course **Programming, Data Structures, and Algorithms Using Python (BSCS2002)** which is offered as part of the **IITM BS in Data Science and Applications** program. You can find more information about the course [here](https://study.iitm.ac.in/ds/course_pages/BSCS2002.html). There is also an [online textbook](https://pdsaiitm.github.io/) that you can use as reference throughout the course.

In this repository, you will find a solution explanations and code implementations for a list curated Leet Code problems that span the topics covered in the lectures. The problems are categorized such that they correspond to each week's course content.

## 📝 Overview of Course Topics:
- **Week 1**: Overview and recap of Python
- **Week 2**: Sorting and Searching Algorithms- Binary Search, Quick Sort, Merge Sort, Insertion Sort, Selection Sort.
- **Week 3**: Stacks, Heaps, Linked Lists, Arrays, and Hashing
- **Week 4**: Graph Algorithms- BFS, DFS, Topological Sorting, DAG
- **Week 5**: Graph Algorithms- Shortest Paths, Minimum Cost Spanning Trees
- **Week 6**: Union Find, Priority Queues, Heaps, Binary Search Trees
- **Week 7**: Balanced Search Trees, Greedy Algorithms- Huffman Coding, Interval Scheduling
- **Week 8**: Divide and Conquer- Quick Select, Closest Pair of Points, Counting Inversions
- **Week 9**: Dynamic Programming- Grid Paths, Edit Distance, Longest Common Subsequence
- **Week 10**: String Matching- Boyer-Moore, Rabin-Karp, KMP, Tries, Regular Expressions
- **Week 11**: Network Flows, Linear Programming, NP Hardness
- **Week 12**: Summary

## 🏗️ Repository Structure

This repository is organized into multiple files, one for each week of the course. Each file contains:

- **📝 LeetCode Questions**: A list of problems to solve, relevant to the week's topics.
- **🧠 Solution Approach**: An explanation of the thought process and strategies for solving the problems.
- **🔍 Solution Code**: Python code solutions for the problems.

## 🔎 About the Problems

The problems selected from LeetCode cover the range of difficulties, from easy to hard. Each problem is chosen to reinforce the concepts learned during the week, providing both practice and a deeper understanding of the topics. You are encouraged to attempt the problems before looking at the solution approach and code.

## 🙌 Credits

This repository is a collaborative effort between the course instructors, teaching assistants, and the enthusiastic community of students. Special thanks to Professor Madhavan Mukund Sir, the instructors Atul Pratap Singh Sir, S Satyanarayana Sir for their continued support, and a shoutout to the creators of the LeetCode platform for providing a wealth of coding challenges.

Happy coding! 🚀

iitm-pdsa-leet-code

iitm-pdsa-leet-code 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

iitm-pdsa-leet-code

iitm-pdsa-leet-code 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README