Cracking the Coding Interviews

with 30 Days Of Leet Code

Course Fee: PKR 15000/- PKR 10500/-

🎥 Recorded 📆 8 Weeks 📙 English & Urdu

🕒 Last Updated: June 2021

Companies don’t invest in Liabilities

This course demands 8 weeks, 24-30 days, 12-15 hours every week of your life to invest for your career that isn’t a big deal. Huhh? Right. 30 days of preparation and be in a better position to bargain for a handsome salary is far better than going for an interview without practicing, placing at a low salary position for few years, bearing every-day stress for reaching to next level in your dreamy tech firms. We will help you in proving yourself as a valuable asset for the company, rather than an unpolished unskilled liability.

Where to Start?

Today a bundle of good websites, reading material, hands-on coding practicing platforms available at your one touch. Where to Start? This course is an ultimate platform for you and your fellows to start with. Live-interactive sessions, Leet Code of 30 days Challenge- practicing with global programmers, 24/7- 2 months feedback from instructors will prepare you for your next job interview at top-tech firms.

Learn in-depth technical skills to crack placement procedures in our 1-week Mock Interview Sessions with hiring experts of Software Houses.

With 1-week Money Back Guarantee and Life-time Access to Recordings, Master your Coding Interviews with us

Major Topics Included

☑️ Array based Structures
Static and Growable arrays
Vector Data structures
Sorting Techniques
Searching Strategies
Stacks and Queues

☑️ Recursion and Backtracking
☑️ Divide and Conquer

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

☑️ Dynamic Programming
☑️ Greedy Algorithms
☑️ Graphs and their applications

☑️ Logical Problems Solving

☑️ OOP concepts
☑️ Pointers and References
☑️ Templates
☑️ Databases concepts
☑️ Operating System concepts

☑️ Interview Problems Sets

We will cover all major topics (you need to succeed) of Programming Fundamentals, Object-Oriented Programming, Data Structures,  Algorithms, Databases, Discrete Math and Operating System
Join Us with 1 Week Money Back Guarantee

Weekly Course Content

Week 1 – Array-based Structures
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 Linked Structures and Searching Strategies
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 Recursion the Sledgehammer
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 Dynamic Programming
Techniques to tackle Optimization Problems
  • 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 Math and Logic Puzzles
Mathematics for Interviews
  • Typical Puzzles and How to Attack them
  • The Mathematics behind the Puzzle
  • Methods to Learn that Apply to a Range of Problems
Week 6 – Logical Math Problems Covered

☑️ Heaviest Ball
☑️ Pouring Oil into Drum
☑️ Shaking Hand
☑️ Chess Board Squares
☑️ Steps Count for Finding Heaviest Ball
☑️ Egg Dropping

☑️ Minimum Money Bags
☑️ Data Representation with Cube
☑️ Black and White Beans Pile
☑️ Regions for N Lines
☑️ Measuring Time with Burning String
☑️ River Crossing with Numbers

Week 7 Domain Knowledge for a Programming Interview
Object-Oriented Programming ( OOP )
  • Classes and their relationships
    • Composition, Aggregation
    • Association, Inheritance
  • Constructors and Destructor
    • The order in which they are called for composition and inheritance
  • Virtual Functions and VTable
  • When we need Virtual Destructor 
  • Playing with Operator Overloading
  • Pointers and References 
  • Templates
OOP – Interview Problems Covered

☑️ Deck of Cards
☑️ Call Center
☑️ Juke Box
☑️ Parking Lot
☑️ Online Book Reader
☑️ Jigsaw
☑️ Chat Server
☑️ Othello
☑️ Circular Array
☑️ File System
☑️ Minesweeper

☑️ Last K Lines
☑️ Reverse String
☑️ Hash Table vs STL Map
☑️ Virtual Functions
☑️ Shallow vs Deep Copy
☑️ Volatile
☑️ Virtual Base Class
☑️ Copy Node
☑️ Smart Pointer
☑️ Malloc
☑️ 2D Alloc

Databases ( DB )
  • SQL Syntax and Variations
  • De-normalized vs. Normalized Databases
  • SQL Statements
  • Small Database Design
  • Large Database Design
DB – Interview Problems Covered

☑️ Database Terminologies
☑️ Dealing with Scenario-based Database Schema
☑️ Implementing SQL Queries
☑️ Joins
{ Types and Need }

☑️ Normalization
{ 1NF, 2NF, 3NF, .. }
☑️ Denormalization
{ Pros and Cons }
☑️ Entity-Relationship Diagram
☑️ Design Grade Database

Operating System ( OS )
  • Threads in C++
  • Synchronization and Locks 
  • Deadlocks and Deadlock Prevention
OS – Interview Problems Covered

☑️ Operating System Terminologies
☑️ Thread vs Process
☑️ Context Switch
☑️ Dinning Philosophers

☑️ Call In-order
☑️ Deadlock Free Class
☑️ Synchronized Methods
☑️ Classic Fizz-Buzz Problem
☑️ Design Grade Database

Week 8 Mock Interview Sessions with Hiring Experts
Chance to land in Pakistan’s Top Tech Software Houses
  • Names get disclosed in the 6th Week of Course.
  • They will be asked to take our prepared trainees for Job Interviews.
  • They can potentially select the best suited candidate for themselves.
  • It will be a great chance for you to crack your first on spot job interview.
Train your technical intuition & understanding

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 for your Tech Career Today

Frequently Asked Questions

What are the pre-requisite of this course?
  • Fundamental level knowledge of
    • Coding in any Language (C++, Java, C#, Python)
    • Object-Oriented Programming
    • Data Structures
    • Algorithms
    • Databases
    • Operating Systems
Who can join this course?
  • Primarily this course is for graduated and final-year students preparing for
    • Programming interviews at top tech firms globally and locally
    • Programming competitions
  • 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 to ace the Programming Competitions
    • know the foundations behind Oriented Programming, Data Structures, Algorithmic techniques, Operating System, Databases
    • understand the optimized applications for complex and real problems
Why one should take this course after 4 years of the university-level degree program?
  • At university level, we mostly study concepts in a scattered shallow way and irrespective to the industrial needs and requirements. We all have skills and information about each course fundamentals, we studied or learned through a great project, did in our bachelors.
  • But how to use those skills and information to extract a meaningful knowledge and solving large-scale problems with optimization is the point where our students lag.
  • In this course, we will cover all major courses along a panoramic picture of Computer Science field.
  • All problems will be mapped on real scenarios and will be analyzed in depth from scratch. You will learn the tricks and techniques, how to solve a problem at its optimized level that is also the fundamental requirement of any tech firm – finding in its potential candidate.
  • After investment of 24 to 30 days in this course, you will be able to land at a handsome position in top software houses locally and globally.
  • We will help you in polishing all the necessary skills and understanding required for a 10/10 interview.
How this course prepare me for an interview?
  • 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 30 days Challenge 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).
  • In the 8th Week, Mock Interview sessions will be held with real Pakistan Software houses.
  • You will get a chance (icing on a cake) to appear in-front of the evaluators, learning from their valuable feedback and an opportunity of on-spot hiring..

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

What kind of companies I can apply after taking this course?
  • You can appear and be able to bargain in local software houses for handsome packages at good positions.
  • You will also be applicable for international firms like Facebook, Google, LinkedIn, Amazon etc.
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 major focus 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 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
  • Chance to meet the real IT hiring team from Pakistan’s Software houses
  • 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 10500/-

📆 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 5500/-

📆 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 12000/- PKR 8500/-

📆 6 Weeks 🕒 Recorded 📕 English & Urdu