- Duration: January 6, 2025 - February 14, 2025
- Schedule: Monday to Friday, 6 PM - 7 PM
- Trainers:
- Moderators:
- π Lecture Notes
- πΉ Recorded Lecture
- π» Colab Notebook
- Concepts Covered:
- Fundamentals of Data Structures and Algorithms
- Array Operations (Insertion, Deletion, Traversal)
- Array Implementation in Python
- π Lecture Notes
- πΉ Recorded Lecture
- π» Colab Notebook
- Concepts Covered:
- Big O Notation
- Time Complexity Analysis
- Space Complexity Analysis
-
πLeetCode problems Solved in Session
-
πΉ Two Sum
-
πΉ Single Number
-
Practice Problems:
- Array Manipulation
- Search and Sort
- Basic Problem-Solving
-
Present By hanzla | Problem no 217
-
βοΈ Contain duplicate
-
πΉ Recorded Lecture
- π Lecture Notes
- πΉ Recorded Lecture
- π» Colab Notebook
- Concepts Covered:
- String Basics
- String Operations
- Implementation Techniques
- π 1662. Check If Two String Arrays are Equivalent, 2185. Counting Words With a Given Prefix
- πΉ Recorded Lecture
- π Lecture Notes
- πΉ Recorded Lecture
- π» Colab Notebook
- Concepts Covered:
- Hashmap Fundamentals
- Implementation Strategies
- Common Operations
-
πLeetCode problems Solved in Session
-
πΉ Two Sum
-
Present By Safiullah Saleem and Ahmad Fakhar
-
βοΈ 706. Design HashMap
-
πΉ Recorded Lecture
- π Lecture Notes
- πΉ Recorded Lecture
- π» Colab Notebook
- Concepts Covered:
- Stack ADT
- Implementation Methods
- Basic Operations
- 1047. Remove All Adjacent Duplicates In String
- π Lecture Notes
- πΉ Recorded Lecture
- π» Colab Notebook
- Concepts Covered:
- Queue ADT
- Implementation Methods
- Basic Operations
- 232. Implement Queue using Stacks
- πΉ Saifullaha Saleem
- 844. Backspace String Compare
- Recorded Lecture
- π Lecture Notes
- πΉ Recorded Lecture
- Concepts Covered:
- Two Pointers Pattern
- Implementation Strategies
- Two Sum Problem
- Leetcode Problems:
-
πΉ DAY 2 recording
-
πΉ DAY 3 recording
-
πΉ DAY 4 recording
- πΉ Student Presentations
- 2810. Faulty Keyboard
- 75. Sort Colors
- π‘ Solution Approaches
- βοΈ Code Reviews
- πΉ DAY 5 recording
- π Lecture Notes
- πΉ Recorded Lecture
- Concepts Covered:
- Linked List Basics
- Singly Linked List Operations
- Implementation Methods
- Leetcode Problems
- Leetcode Problems
- π 876. Middle of the Linked List, 2095. Delete the Middle Node of a Linked List
- πΉ Recorded Lecture
- Leetcode Problems
- 203. Remove Linked List Elements
- πΉ Recorded Lecture
- Leetcode Problems
- 21. Merge Two Sorted Lists
- πΉ Recorded Lecture
- π Lecture Notes
- πΉ Recorded Lecture
- Concepts Covered:
- Binay search
- Implementation Methods
- One way & Two way
- Leetcode Problems
- π 704. Binary Search, 35. Search Insert Position
- πΉ Recorded Lecture
- Leetcode Problems
- String and its operations & 242. Valid Anagram
- πΉ Recorded Lecture
- Leetcode Problems
- Two Pointer + Example 153. Find Minimum in Rotated Sorted Array
- πΉ Recorded Lecture
- Leetcode Problems
- 374. Guess Number Higher or Lower 3174. Clear Digits
- πΉ Recorded Lecture
- π Course Repository
- π Additional Reading Materials
- β LeetCode Problem Set
- π¬ Discussion Forum
- Basic Python programming knowledge
- Understanding of basic mathematics
- Laptop with Python installed
- Present your solution approach
- Explain time and space complexity
- Code walkthrough
- Q&A session
- Open an issue for technical problems
- Use discussion forum for concept clarifications
- Contact moderators for administrative queries
Made with β€οΈ by BTAJI Crew