LevelUp

Build onto your basic.

[3-MONTHS EXTENSIVE TRAINING]

New Batch from 9th May

Call Now Pay Now Have Queries?
dev

About This Program

    Students who are confident with their basics but find it difficult to deal with topics such as recursion, data structures, dynamic programming and graphs. This is best suited for the students who wish to take their coding skills a notch higher.

Course Curriculum

1 Recursion & Backtracking

  • Basics and Control Flow in recursion
  • Recursion with arrays
  • Recursion with ArrayLists
  • Recursion on the way up
  • Recursion and combinatorics
  • Recursion with queens and knights
  • Recursion and memory maps
  • Advanced recursion – sudoku, crossword, bit masking
  • Basics and Control Flow in recursion
  • Recursion with arrays
  • Recursion with ArrayLists
  • Recursion on the way up
  • Recursion and combinatorics
  • Recursion with queens and knights
  • Recursion and memory maps
  • Advanced recursion – sudoku, crossword, bit masking

2 Generic Tree (Trees)

  • Introduction of hierarchical data structure
  • Implementation of Generic Tree
  • Application of Generic Tree Interview Questions
  • Introduction of hierarchical data structure
  • Implementation of Generic Tree
  • Application of Generic Tree Interview Questions

3 Binary Tree (Trees)

  • Implementation of Binary Tree
  • Application of Binary Tree
  • Interview Questions
  • Implementation of Binary Tree
  • Application of Binary Tree
  • Interview Questions

4 BST & AVL (Trees)

  • Balancing Property
  • Implementation of BST & AVL
  • Application of BST & AVL
  • Interview Questions
  • Balancing Property
  • Implementation of BST & AVL
  • Application of BST & AVL
  • Interview Questions

5 Dp & Greedy

  • Recursion to DP
  • Memoization and Tabulation
  • 1d DP
  • 2d DP
  • Classical DP Problem
  • DP with Bit Masking
  • Greedy vs DP
  • Recursion to DP
  • Memoization and Tabulation
  • 1d DP
  • 2d DP
  • Classical DP Problem
  • DP with Bit Masking
  • Greedy vs DP

6 HashMap (HashMap & Heaps)

  • Applications of HashMap
  • Iterable vs Iterator
  • Interview Questions
  • Applications of HashMap
  • Iterable vs Iterator
  • Interview Questions

7 Heaps (HashMap & Heaps)

  • Applications of Heaps
  • Adapter Design Pattern
  • Array.sort & Collection.sort
  • Comparable vs Comparator
  • Interview Questions
  • Applications of Heaps
  • Adapter Design Pattern
  • Array.sort & Collection.sort
  • Comparable vs Comparator
  • Interview Questions

8 Generics (HashMap & heap)

  • OOPs – generics, exceptions, interfaces
  • Generic Priority Queue creation
  • Generics Linked List creation
  • Generics HashMap creation
  • OOPs – generics, exceptions, interfaces
  • Generic Priority Queue creation
  • Generics Linked List creation
  • Generics HashMap creation

9 Graphs

  • Adj. matrix implementation
  • DFS and it’s Applications
  • BFS and its Applications
  • Dijkstra, Prims, Kruskals, Bipartite
  • Classical DP Problems
  • DAG implementation, Topological sort
  • Bellman ford & Floyd Warshall
  • Adj. matrix implementation
  • DFS and it’s Applications
  • BFS and its Applications
  • Dijkstra, Prims, Kruskals, Bipartite
  • Classical DP Problems
  • DAG implementation, Topological sort
  • Bellman ford & Floyd Warshall

10 Stack and Queues (Stack, Queues & Linked Lists)

  • Introduction and Implementation of Stack and Queue
  • Adapter Design Pattern
  • Application of Stack and Queue Interview Questions
  • Introduction and Implementation of Stack and Queue
  • Adapter Design Pattern
  • Application of Stack and Queue Interview Questions

11 Linked Lists (Stack, Queues & Linked Lists)

  • Implementation of Linked List Data Structure
  • Application of Linked List
  • Iterator Design Pattern Interview Questions
  • Implementation of Linked List Data Structure
  • Application of Linked List
  • Iterator Design Pattern Interview Questions

12 Basic Competitive Programming

  • Number Theory
  • Computational Geometry
  • Range Queries
  • Advanced CP
  • Advanced Graphs
  • Text Processing
  • Number Theory
  • Computational Geometry
  • Range Queries
  • Advanced CP
  • Advanced Graphs
  • Text Processing

The Time - Factor

Batch details will be as followed:


  Start Date: 9th May
  Duration - 3 Months
  Live classes
  Doubt Support via videos and one on one sessions
  Regular coding contests
  Placement Assistance: Referrals through existing alumni
Call Now Pay Now Have Queries?

Enroll Now For The Course!!!

If you wish to register for this course, contact us on +91-7048971481 or +91-7048994628. For any query - Kindly fill this
google form