Preparation for Coding Competitions

with 20+ Leet CodE Challenges

Course Fee: PKR 10000/- PKR 5000/-

🎥 Recorded 📆 6 Weeks 📙 English & Urdu

🕒 Last Updated: June 2021

Become the next coding champion!

Do you want to learn the art of competitive programming? How to ace the programming competitions? How to become the most valuable programmer for the top tech IT firms? Where to start your career as a coding champion? Where to participate? Learn with us everything, about programming competitions and upgrade your skills to succeed in programming competitions.

How to begin competitive coding?

Today a bundle of good websites, reading material, hands-on coding practicing platforms available in your palm. Where to Start? This course is an ultimate platform for you and your fellows to start with. Live-interactive sessions, LeetCode of 20+ Challenges – practicing with international programmers, 24/7- 6 weeks continuous practice and feedback from instructors will prepare you to ace the coding competitions globally.

With 1-week Money Back Guarantee and Life-time Access to Recordings, join us now!

Major Topics Included

☑️ Array based Structures
☑️ Static and Growable Arrays
☑️ Vector Data Structures
☑️ Sorting Techniques

☑️ Searching Strategies
☑️ Stack
☑️ Queue

☑️ Pointers and References
☑️ Recursion and Backtracking
☑️ Divide and Conquer
☑️ Templates

☑️ Dynamic Programming
☑️ Greedy Algorithms
☑️ Time and Space

☑️ Linked Structures and Searching Strategies
Binary Trees
☑️ Binary Search Tree
☑️ Heap
☑️ Hashing

☑️ Graphs and their applications

We will learn in-depth technical skills and Hands-on practice with STL
  • How to do compact, efficient algorithmic coding?
  • How to use array based constructs?
  • Eliminating Time Limit Succeeding Errors
  • Coding with Competitive Platforms
  • Designing and Implementation of Recursive Codes
  • How to tackle Optimization Problems?
  • Why Dynamic Programming is Efficient?
  • Cracking Modeling Dependency Problems
Join Us with 1 Week Money Back Guarantee

Weekly Course Content

Week 1 – Using the Power of Array-based Constructs
Brainstorming with Array-based Problems
  • Understanding the Data
  • Deciding Problem Solving Strategies
  • Knowing your tool kit
    • Articulating your thought Process
    • Knowing what is efficiency – asymptotic vs practical 
    • Focus this week on Direct Access Techniques, String Processing, Hashing
    • What problems fall to hashing, Power, and verities of hashing, hat hashing can and cannot do
DAY 1 << STATIC VS GROWABLE ARRAYS – Vector Data Structures

☑️ Unique Characters in String
☑️ Check Permutation
☑️ Replace Spaces with %20
☑️ Check if a string is edited
{ Character Removed, Inserted or Replaced }
☑️ String Compression
{ aabcccccaaa to a2blc5a3 }
☑️ Matrices Rotation
{ Outplace, In-place }
☑️ String Rotation


☑️ N2 Sorting Algorithms
{ Bubble Sort, Selection Sort, Insertion Sort }
☑️ N log N Sorting Algorithms
{ Merge Sort, Quick Sort, AVL Sort (using STL Map), Heap Sort (using STL Priority Queue) }
☑️ Applications
{ Even and Odd Indices, Sorting in Ascending and Descending Order with Variants }


☑️ Static Fixed Size Stack
☑️ Dynamic Size Stack with Vector Implementation
☑️ Stack Applications
{ Stack Min, Queue via Stack, Sort Stack, Parenthesis Matching Problem, Number Conversion Problem }
☑️ Queue { Static Queue, Circular Queue, Problem with Linear Circular Queue }

Week 2 Eliminating Time Limit Exceeded Errors
Search Problem Strategies with Linked Structures
  • The linked Structures Repertoire, and What you Must Know about them 
  • Linked Structures vs Hashing Trade-offs

☑️ Linked List Creation
{ Forward and Double Directional Lists with Insert, Delete and Search }
☑️ Remove Duplicates
☑️ Return Kth to Last
☑️ Delete Middle Node
☑️ Partition around a value X
☑️ Sum Lists
{ (7-> 1 -> 6) + (5 -> 9 -> 2) }
☑️ Loop Detection
☑️ Lists Intersection
☑️ Is Palindrome


☑️ Binary Trees and Functionality
☑️ BSTs and Traversals
{ LNR – RNL, NLR – NRL, LRN – RLN, using STL Map }
☑️ BSTs Functionality
{ Printing Trees and Leaves, K Distant Nodes from Root, Prime and Even Count, Identical Trees and Content, Delete Leaves, Merge 2 BSTs of Same Type, Minimum and Maximum, Closest and Farthest Leaf from Root }


☑️ BSTs Functionalities
{ Path from Root to Closest and Farthest Leaf, Internal Nodes Count, Leaves Count, Trees Successor and Predecessor, Validate BST, In-order Traversal with Tree-Minimum, Height Count Initialization, BST Sort using Insert and In-Order Traversal }
☑️ Complexity Analysis
☑️ Hashing
☑️ Linked Structures vs Hashing

Week 3 Designing and Implementing Recursive Codes
Recursion and Backtracking
  • Recursion
  • Building the Recursive Imagination
  • The world of Solution Space Navigation with Recursion
  • Knowing when to use Brute Force and How to Code it
  • Divide and Conquer
    1. Merge Sort
    2. Quick Sort
    3. Counting Inversions
    4. Computing Skyline (2D Maximas)

☑️ Factorial and Fibonacci
{ Recursion and Trees }
☑️ Digit by Digit Print
☑️ Coin Change
☑️ Multiplication with Addition
☑️ Robot Path Finding from Point A to B
{ 1D Grid, N by N – 2D Grid }


☑️ All 0’s, 1’s strings of Length N
☑️ All Subsets of a Set of Size N
☑️ All Strings Permutation of Length N
☑️ Combinations of Balanced Parenthesis
☑️ Magic Index
☑️ Flood Fill Method


☑️ Finding Determinant of a Matrix
☑️ Prison Break
☑️ Dynamic Programming
☑️ Fibonacci Numbers
☑️ Catalan Numbers
{ Top Down and Bottom approaches }

Week 4 Techniques to Tackle Optimization Problems
Time Efficiency with Dynamic Programming
  • The apparatus: Dynamic Programming, Greedy Techniques 
Week 4 – Problems Covered

☑️ Finding Shortest Path in DAG
☑️ Two Approaches
{ Top-down Order and Bottom-up Path Finder, In Topological Order }
☑️ Finding Largest Path in DAG
☑️ Longest Increasing Subsequence
☑️ Rod Cutting Problem

☑️ Maximum Sum Subarray G
{ Kadane’s Algorithms }
☑️ Path in the 2D – Grid DAG
{ Longest/Shortest }
☑️ Edit Distance Problem
☑️ Longest Common Subsequence
☑️ Matrix Chain Multiplication
☑️ Knapsack Problem

Week 5 Modeling Problems as Graphs, The Graph Algorithm Kit
Modeling Dependency-based Problems – Hard and Easy Problems
  • Graphs Modeling of Dependency-based Problems

☑️ How to Design Facebook, Twitter using Undirected and Directed Graphs
{ Adjacency Matrix and List Representation}
☑️ Graphs Traversals
{ DFS Applications – Connected Components, Finding Topological Ordering }
{ BFS Applications – Finding Shortest and All Pair Shortest Path, Reaching to Closest Restaurants }
☑️ Shortest Path in Weighted Graphs
{ Dijkstra and Bellman-ford Algorithms }
☑️ Spanning Trees
{ Prims and Kruskal Algorithms with Applications}


☑️ Root between Nodes
☑️ Minimal Tree
☑️ List of Depths
☑️ Check Balanced
☑️ Validate BST
☑️ Successor
☑️ Build Order
☑️ First Common Ancestor
☑️ BST Sequences
☑️ Check Sub-tree
☑️ Random Node
☑️ Paths with Sum

Week 6 LeetCode Challenges Practice
20+ Problems Practice with LeetCode
  • Robust drill with LeetCode
  • Learn to apply all previous practice to do real challenging problems
  • Learn about the competitive programming competitions platforms
  • Where and how participate
Level Up your skills

Our Services

7 Days Money Back Guarantee

If you get dissatisfied with any course, then within the 1st week of your any Live Courses, you can contact us and get a full fee refund

Life time Access to Lecture Recordings

Once you enrolled in any course, you will get life-time access to all recorded lectures and practice problems

Shareable Certificate

A shareable certificate provides proof for an employer, or an institution that you have successfully completed an online course

Learn from Anywhere

with Certified Teachers of Pakistan’s top Tech Institutes in Live Interactive Sessions And get Peers’ Feedback for Weekly Graded Assignments

Payment Methods

Easy – Paisa
Jazz Circle
Bank Transfer
Start Preps To Be A Next Coding Champion

Frequently Asked Questions

What are the pre-requisite of this course?
  • 3rd and 4th year students of BS – Computer Science and BS – Software Engineering
  • Fundamental level knowledge of
    • Coding in any Language (C++, Java, C#, Python)
    • Object-Oriented Programming
    • Data Structures
    • Algorithms
Who can join this course?
  • Primarily this course is for 3rd and 4th year BS-CS and BS-SE students who want to participate in
    • Programming competitions locally and globally
  • Any candidate can join us with Fundamentals level knowledge of
    • Coding in any language (C++, C#, JAVA, Python)
    • Object-Oriented Programming Course
    • Data Structures and Algorithms Course
  • This course will also be of great interest to those (of-course with prerequisite knowledge) who want to
    • learn the tips and tricks of Competitive Programming
    • understand the optimized applications for complex and real problems
How this course prepare me for a programming competition?
  • We will be practicing and spending 2-3 hours every day. You will be given assignments to code or reading.
  • We will be going to spend 20+ Challenges with Leet Code
    • Approximately, half hour will be served in every class
  • On Saturday and Sunday, you will get huge assignments to practice on.
  • On average, you will have to spend 12 hours every week (for classes and practical coding work).

All you need, patience and constant practice to achieve final mastered version of you.

What programming languages will we work with in this course?
  • A programming interview is incomplete without practicing the problems in any of the supported coding language.
  • You must have the knowledge of any below languages
    • C++, C#, JAVA, Python etc.
  • Our one of major focuses in this course will be to make you understand the core concepts knowledge in a way simpler that you can test and code in any of above languages of your choice.
Where will the course be conducted?
  • Live classes are conducted on Microsoft Teams
  • Google Classroom is used for after class discussion and material exchange
  • Once you get enrolled in any course, all the details will be shared with you
What if I do not find a course useful?
  • Our instructors will always be there for you to respond to your queries and to resolve any concerns you may have with the course. But if you are dissatisfied with the course, then within the 1st week of the Live Course, you can contact us and get a full fee refund
What Perks do I Get after registration in a this course?
  • Recordings of Live Online Interactive Sessions
  • Life-Time Access to Lecture Recordings and Reading Material
  • Recordings of Live Tech Personalities’ Talk, depending on course
  • Shareable Certificate
How to register for a Course?
  • Select a course, see details
  • Click on the ‘Get Course Now’ button, you will be seen on course page
  • Fill the registration form and submit your details. (*your details will not be shared with anyone)
  • After form submission, you will receive an email with the guidelines and details
  • Follow those guidelines (mentioned in the email)
  • You can transfer your payment through Easypaisa, JazzCash, or Bank transfer

Still Confused? 😕 Get your doubts resolved with Peers! 😊

Featured Recorded Courses

Cracking the Coding Interviews

Last Updated June 2021

Learn in-depth technical skills with 30+ LeetCode Challenges to crack placement procedures in top-notch tech firms.

Course Fee: PKR 15000/- PKR 8500/-

📆 8 Weeks 🕒 Recorded 📕 English & Urdu

Game Development Scratch to Unity

Last Updated – September 2021

Learn building your own 2D and 3D games in powerful gaming engines. Start your game development career!

Course Fee: PKR 8000/- PKR 5000/-

📆 4 Weeks 🕒 Recorded 📕 English & Urdu

Preparation for Coding Competitions

Last Updated – June 2021

Learn in-depth technical skills to excel the world of programming competitions. Get hands-on practice with STL

Course Fee: PKR 10000/- PKR 5000/-

📆 6 Weeks 🕒 Recorded 📕 English & Urdu