The course will involve rigorous practice of questions based on Sorting, Searching, Greedy Algorithms, Text processing, Backtracking, Dynamic Programming along with comprehensive revision of Data Structures likes Stacks, Queues, Linked-Lists, Trees, Graphs, Heaps, Range Queries etc. using both JAVA and C++. It is ideal for all those students who find it difficult to deal with advanced topics and desire to gain expertise in them.


Recursion & Backtracking (Lecture 1 - 8)


  1. Basics and Control Flow in recursion
  2. Recursion with arrays
  3. Recursion with ArrayLists
  4. Recursion on the way up
  5. Recursion and combinatorics
  6. Recursion with queens and knights
  7. Recursion and memory maps
  8. Advanced recursion – sudoku, crossword, bit masking

Outcome: This part lays a strong foundation for trees and graphs. “Peppers” invariably perform better than peers at recursive codes.

Complexity Analysis (Lecture 9-10)

  1. Time Complexity analysis
  2. Space Complexity
  3. Optimised Searching, Sorting and Hashing

Outcome:This part enables the student in analysing complexity of their codes and optimising them.

DP & Greedy (Lecture 11-16)

  1. Recursion to DP
  2. Memoization and Tabulation
  3. 1d DP
  4. 2d DP
  5. Classical DP Problems
  6. DP with Bit Masking
  7. Greedy vs DP

Outcome:This part prepares the student for competitive programming contests by laying a fairly strong foundation in dynamic programming.

Data Structures (Lecture 17-28 )

Lesson Titles


Stack and Queues

Introduction and Implementation of Stack and Queue

Adapter Design Pattern

Application of Stack and Queue

Interview Questions

Linked Lists

Implementation of Linked List Data Structure

Application of Linked List

Iterator Design Pattern

Interview Questions

Generic Tree

Introduction of hierarchical data structure

Implementation of Generic Tree

Application of Generic Tree

Interview Questions

Binary Tree

Implementation of Binary Tree

Application of Binary Tree

Interview Questions

Outcome:This part emphasises on subtleties of linear and hierarchical data structures. Linked Lists and Trees feature very prominently in interviews.

Advanced Data Structure (Lecture 29-36)



Lesson Title



Balancing Property

Implementation of BST & AVL

Application of BST & AVL

Interview Questions


Applications od HashMap

Iterable vs Iterator

Interview Questions

Priority Queue

Applications of Priority Queue

Adapter Design Pattern

Array.sort & Collection.sort

Comparable vs Comparator

Interview Questions


OOPs – generics, exceptions, interfaces

Generic Priority Queue creation

Generics Linked List creation

Generics HashMap creation

Range Queries

Segment Tree

Modular Segment Tree

Lazy Segment Tree

Square Root Decomposition

Sparse Table

Outcome:Besides preparing the student via a lot of interview questions, this part makes the student industry ready by retouching on key OOPs concepts..

Graphs & Text Processing (Lecture 37-44)

  1. Adj. matrix implementation
  2. DFS and it’s Applications
  3. BFS and its Applications
  4. Dijkstra, Prims, Kruskals, Bipartite
  5. DAG implementation, Topological sort
  6. Bellman ford & Floyd Warshall
  7. Trie and Huffman Encoder
  8. Rabin Karp, KMP, Z, Manachers

Outcome:This part adds the “x-factor” in student by doing a lot of practice on graphs and key text processing algorithms.

“Pep” Effect

  1. Videos: Online videos for important topics to help revise and cover missed classes.
  2. Assignment: Practice hundreds of high-quality questions given as Hacker rank Assignment.
  3. Doubt Support: Online TAs help in prompt doubt support. 1-12 TA to student ratio in classes.
  4. Revision Option: We provide our students with unlimited revision option so they can revise as many times they want that to free of cost.
  5. Back-up Class: We provide catch up classes via doubts teacher in case you miss one.


This course covers a lot of ground for a starter. Now you are ready to explore more.

  1. You may like to compete online for bagging placements and internships. We have a “Interview Prep” course for that purpose.
  2. You might like to make real world websites, Web Apps, Mobile Apps, deploying them on cloud or automating your boring task. “DEV-101” will be the prefect pick for your choices.


  1. Call us on 011-4019-4461, or
  2. Walk in our centre at PepCoding, 3rd Floor, 15 Vaishali, Pitampura, Opposite Metro Pillar 347, Above Karur Vysya Bank, Nearest Metro - Kohat Enclave, New Delhi, Delhi 110034. or
  3. Our FB page – com/pepcoding
  4. Visit www.pepcoding.com.