Admission Deadline: 15 May, 2025
Class Starts on: 20 May, 2025
Course Fee: 6000/-
Course Features
🧑🏫 80+ Live Classes
🎯 20+ Industry-Specific Guideline Classes
🧩 400+ Handpicked LeetCode Problems
📽️ Videos of Each Class
🎥 Solution Videos for All 400+ Problems
📝 MCQ Tests for Each Topic
🤝 Mock Interviews
📄 CV Reviews and Soft Skills Development:
Weekly 3 Classes ( 2 Coding Classes, 1 CSE Fundamental )
Access to CP Course Module-1 ( Basic C/C++ and Problem solving ) to clear your basics
Who Can Join
Pre-requisite
✅ Must have a basic understanding of C++ programming.
🎓 3rd or Final-Year Students 💼 Job Seekers 🚀 Working Professionals
Preparing for their first Looking to crack Aspiring to join BD Big
job interviews and secure Tech or FAANG.
roles in top
companies.
Our Trainers
Rahat Khan Pathan Parvej Mia
Specialist, max. 1560 Expert, max. 1841
4*, max. 1865 5*, max. 2032
Software Engineer III @ Software Engineer @
Cracked ICPC Asia West finalists
Interviews and Got 2022
Recommendations
Our Teaching Assistants
Tahsin Arafat (JUST, CSE) Ahsanul Haque (JUST, CSE)
CF: TahsinArafat (max. candidate master, 1957) CF: _AhSaN_(max. specialist, 1572)
Pathao
SELISE
2 Students at
1 Students at
Brain Station
13 Students Vivasoft
at BD
5 Students at
1 Students at
WellDev
Big Tech
Appifylab
2 Students at
1 Students at
Kona SL
1 Students at
Core Foundations
Topics
Complexity Analysis,
Time and space complexity basics,
Big-O notation,
Array,
Vector,
Array simulations,
Array rotations and manipulations,
Matrix Operations,
2D matrix simulations and transformations.
Strings and Patterns:
Topics
String,
String Manipulations,
Simulation,
Reverse,
Parsing,
Palindromes and Anagrams,
String rotation,
Char count
Data Structures with STL:
Topics
Map,
Set,
Stack,
Queue,
Deque,
Priority Queue (Min-Heap, Max-Heap),
LRU Cache,
Circular Queue,
Custom Comparators in Priority Queues.
Mathematical and Bit Manipulation:
Topics
Bit Manipulation,
Efficient binary operations for problem-
solving,
Mathematical Foundations,
Number theory,
Modular arithmetic,
Digit manipulations,
Bit masking,
XOR operator and its magics.
Greedy Algorithms:
Topics
Solving optimization problems with local
decisions.
Recursion and Backtracking:
Topics
Problem-solving using recursion and exploring all possibilities,
N-Queens problem,
Subsets,
Permutations,
Generate Parentheses,
Fibonacci sequence.
Sorting:
Topics
Sorting Algorithms,
Bubble Sort,
Merge Sort,
Quick Sort,
Insertion Sort,
Difference between Merge Sort and Quick Sort,
Counting Sort,
Heap Sort
Searching, Two Pointers and Sliding
Windows:
Topics
Binary Search Variations,
Lower/Upper Bounds,
Bisection
Two Pointers
Sliding Windows
Linked Lists:
Topics
Singly, Doubly, and Circular Linked Lists,
Reverse, Rotate, Merge, and Detect Loops, a Linked List,
Detect and Remove Loops in a Linked List,
Merge Two Linked Lists,
Find the Middle Element of a Linked List,
Intersection of Two Linked Lists,
Clone a Linked List with Random Pointers,
Rotate a Linked List,
Add Two Numbers Represented by Linked Lists
Graphs and Trees:
Topics
DFS,
BFS,
Topological Sort,
Cycle Detection,
Island,
Dijkstra,
Bellman-Ford,
Floyd-Warshall.
Binary Tree and Binary Search Tree:
Topics
Introduction to Heap,
Balanced Trees,
Types of Heaps (Min-Heap, Max-Heap),
Balanced binary search tree,
Heap Operations (Insert, Extract,
Tree Construction from Traversals,
Peek),
Lowest Common Ancestor (LCA),
Heap Applications (Priority Queues,
Tree Diameter,
Heap Sort),
Tree Balancing Techniques,
Introduction to Binary Search Tree
Depth-First Search (DFS) and
(BST),
Breadth-First Search (BFS),
BST Operations (Insertion, Deletion,
Maximum Path Sum,
Search), Tree
Traversal (In-order, Pre-order, Post-
order)
Dynamic Programming:
Topics
0-1 Knapsack,
Coin Change,
Longest Increasing Subsequence (LIS),
Longest Common Subsequence (LCS).
Longest Palindromic Substring ( Manachers algorithm )
Advanced-Data Structures:
Topics
Trie: Insert, Search, and Applications (Autocomplete,
Spell Checker),
Segment Trees: Range queries and updates,
KMP string algorithm
Object-Oriented Programming (OOP)
Using C#:
Topics
1. Fundamentals: Practical Exercises
Classes and Objects Hotel Booking System
Encapsulation, Inheritance, Polymorphism, Parking Lot
and Abstraction Chat Server
2. Advanced Topics:
Constructor and Destructor
Method Overloading and Overriding
Abstract Classes and Interfaces
What is runtime and compile time
polymorphism
Database Management System
(DBMS):
Topics
1. Basics:
a. SELECT, INSERT, UPDATE, DELETE.
b. WHERE, GROUP BY, HAVING, and ORDER
BY.
2. Intermediate Concepts:
a. Joins: INNER, LEFT, RIGHT, FULL OUTER
JOIN.
3. Advanced Topics:
a. ACID Properties.
Design Principles:
Topics
1. Basics:
a. DRY, KISS, YAGNI
2. Intermediate Concepts:
a. SOLID Principles
System Design
Topics
Case Studies and Practical
1. Basic Components: Exercises
a. Load Balancers, Caching, Proxies, and Design a URL Shortener
Databases. System (e.g., TinyURL).
b. Horizontal and Vertical Scaling. Create a Messaging
2. Key Topics: System (e.g., WhatsApp).
a. Designing Scalable Systems: Design Instagram's
Consistency, Availability, and Partition Newsfeed System.
Tolerance (CAP Theorem).
b. Microservices vs. Monoliths.
c. Distributed Systems and Databases.
Operating Systems (OS):
Topics
1. Basics: Practical Exercises
a. Process vs. Thread. Implement a simple
b. CPU Scheduling Algorithms: FCFS, Multithreading Program in
SJF, Round Robin, Priority Scheduling. C#.
c. Memory Management: Paging, Solve deadlock problems
Segmentation, Virtual Memory. (e.g., detect or avoid
2. Intermediate Concepts: deadlocks).
a. Synchronization: Mutex, Semaphore,
Deadlock Avoidance (Banker’s
Algorithm).
b. File Systems and Disk Scheduling.
c. Interprocess Communication (IPC).
How to
Enroll
Please Send Message to Our
Facebook Page
THANK YOU