Complete Data Structures & Algorithms (DSA) - InDepth Training

Master the Coding Interview for MAANG

Vimal Daga

The World Record Holder, Founder at LinuxWorld & #13, Sr. Principal IT Consultant, TEDx Speaker & Philanthropist

Save ₹ 2,000 if you do a One Time Payment
He has been featured at:

What will you learn in the training?

Understanding Data Structures

Static data structure

Classes And Objects

A brief overview of Linear Data Structures

A brief overview of Non-Linear Data Structures

Algorithms

Asymptotic Analysis

  • Space Complexity
  • Time Complexity

Anaconda And Jupyter Notebook

  • Arrays Introduction
  • List Datatype
  • Difference between List and Array
  • Where to Implement Arrays
  • Search, insert and delete operations in an unsorted array
  • Search, insert and delete operations in a sorted array
  • Program to reverse an array
  • Count Inversions in an array
  • Leaders in an array
  • Majority Element
  • Number Occurring Odd Number of Times
  • Largest Sum Contiguous Subarray
  • Find the Missing Number in an array
  • Search an element in a sorted and pivoted array
  • Merge an array of size n into another array of size m+n
  • Median of two sorted arrays
  • Program for array rotation
  • Reversal algorithm for array rotation
  • Block swap algorithm for array rotation
  • Maximum sum such that no two elements are adjacent
  • Sort elements by frequency
  • 2-D Arrays
  • Advance Manipulation of 2-D Arrays
  • Different Kind of arrays
    • Indexed Arrays
    • multidimensional array
    • Associative arrays
  • Linear Search
  • Binary Search
  • Jump Search
  • Interpolation Search
  • Exponential Search
  • Sublist Search (Search a linked list in another list)
  • Fibonacci Search
  • The Ubiquitous Binary Search
  • Linear Search VS Binary Search
  • Interpolation search vs Binary search
  • Recursive function to do substring search
  • LeetCode Questions
  • Asymptotic AnalysisBubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quicksort
  • Counting Sort
  • Radix Sort
  • Bucket Sort
  • Heap Sort
    • Binary Heap
    • Binomial Heap
    • Fibonacci Heap
    • Heap Sort
    • K’th Largest Element in an array
    • Tournament Tree (Winner Tree) and Binary Heap
  • Shell Sort
  • Cyclic Sort
  • Introduction to Stack
  • LIFO
  • Implementation of Stacks
  • Infix to Postfix Conversion using Stack
  • Evaluation of Postfix Expression
  • Reverse a String using Stack
  • Implement two stacks in an array
  • Reverse a stack using recursion
  • Sort a stack using recursion
  • Stock Span Problem
  • Implement Stack using Queues
  • Design a stack with operations on middle element
  • How to efficiently implement k stacks in a single array?
  • Sort a stack using recursion
  • Queue Introduction and Array Implementation
  • Linked List Implementation of Queue
  • Applications of Queue Data Structure
  • Priority Queue Introduction
  • Deque (Introduction and Applications)
  • Implementation of Deque using circular array
  • Implement Queue using Stacks
  • Find the first circular tour that visits all petrol pumps
  • Maximum of all subarrays of size k
  • How to efficiently implement k Queues in a single array?
  • Introduction to Linked List
  • Linked List vs Array
  • Traversing a Linked List
  • Insertion Deletion in Linked List
  • Find Length of a Linked List (Iterative and Recursive)
  • Swap nodes in a linked list without swapping data
  • Reverse a linked list
  • Merge two sorted linked lists
  • Merge Sort for Linked Lists
  • Reverse a Linked List in groups of a given size
  • Rotate a Linked List
  • Generic Linked List in C
  • Doubly Linked List Introduction and Insertion
  • Traversing a Doubly Linked List
  • Delete a node in a Doubly Linked List
  • Reverse a Doubly Linked List
  • The Great Tree-List Recursion Problem.
  • QuickSort on Doubly Linked List
  • Merge Sort for Doubly Linked List
  • Circular Linked List Introduction and Applications,
  • Circular Singly Linked List Insertion<
  • Circular Linked List Traversal
  • Split a Circular Linked List into two halves
  • Sorted insert for circular linked list
  • Binary Tree Introduction
  • Binary Tree Properties
  • Types of Binary Tree
  • Handshaking Lemma and Interesting Tree Properties
  • Enumeration of Binary Tree
  • Applications of tree data structure
  • Traversals of a Binary Tree
  • BFS vs DFS for Binary Tree
  • Level Order Tree Traversal
  • Diameter of a Binary Tree
  • Inorder Tree Traversal without Recursion
  • Threaded Binary Tree
  • Maximum Depth or Height of a Tree
  • Construct Tree from given Inorder and Preorder traversals
  • LeetCode Questions
  • Search and Insert in BST
  • Deletion from BST
  • Minimum value in a Binary Search Tree
  • Inorder predecessor and successor for a given key in BST
  • How to Check if a binary tree is BST or not
  • Lowest Common Ancestor in a Binary Search Tree.
  • Inorder Successor in Binary Search Tree
  • Floor and Ceil from a BST
  • In-place conversion of Sorted DLL to Balanced BST
  • Total number of possible Binary Search Trees with n keys
  • Merge Two Balanced Binary Search Trees
  • Binary Tree to Binary Search Tree Conversion
  • Applications of Binary Search Tree

Height Balanced Trees (AVL Trees)

  • Graph Introduction
  • Graph Terminologies
  • Types of Graphs
  • Graphs in Memory
  • Traversing Graph
  • Graph and its representations
  • Basic Properties of a Graph
  • Difference between Graph and Tree
  • Breadth First Traversal for a Graph
  • Depth First Traversal for a Graph
  • Applications of Depth First Search
  • Applications of Breadth First Traversal
  • Detect Cycle in a Directed Graph
  • Detect Cycle in a an Undirected Graph
  • Detect cycle in an undirected graph
  • Longest Path in a Directed Acyclic Graph
  • Topological Sorting
  • Snake and Ladder Problem
  • Boggle
  • Minimum Spanning Tree
  • Dijkstra’s shortest path algorithm
  • Dijkstra’s Algorithm for Adjacency List Representation
  • Bellman–Ford Algorithm
  • Floyd Warshall Algorithm
  • Advance Graph UseCases

Future aspects of Data Structure & Algorithms

  • Matrix Introduction
  • Search in a row wise and column wise sorted matrix
  • Print a given matrix in spiral form
  • Boolean Matrix 
  • Traverse unique rows in a given boolean matrix
  • Inplace M x N size matrix transpose 
  • Strassen’s Matrix Multiplication
  • Hashing Introduction
  • Hash Function
  • Hash Table
  • Hashing Working
  • Collision Resolution Techniques
  • Linear Probing
  • Double Hashing
  • Open Addressing for Collision Handling
  • Traverse a Binary Tree in Vertical Order
  • Application of Hashing Data Structure
  • Introduction on Dynamic Programing in Python
  • When to use Dynamic Programing
  • Recursion
  • How to identify Dynamic programing problems
  • Algorithms
    • Floyd Warshall Algorithm
    •  Bellman-Ford Algorithm
  • Multi stage decision process
  • Principle of Optimality
  • Backward induction
  • Optimal substructure Property
  • Time complexity and its effects
  • Memory profiler
  • Minimum Edit Distance In Dynamic Programming
  • Methods
    • Top down method / Memoization
    • Bottom up method / Tabulation
  • Concept and importance of space complexity
  • Advance Concepts
    • Bitmasking and Dynamic Programing
    •  Digit DP
  • Dynamic Programming Problems
    •  Knapsack Problem
    • Tower Of Hanoi Problem
    •  Overlapping structure problem
    • Traveling Salesman problem
  • Memory efficient doubly linked list
  • XOR Linked List 
  • Unrolled Linked List
  • Segment Tree
  • Lazy Propagation in Segment Tree
  • Persistent Segment Tree 
  • Binary Indexed Tree
  • Binary Indexed Tree 
  • Suffix Array Introduction
  • Suffix Array nLogn Algorithm
  • kasai’s Algorithm for Construction of LCP array from Suffix Array
  • Suffix Tree Introduction
  • Generalized Suffix Tree
  • Build Linear Time Suffix Array using Suffix Tree
  • Substring Check
  • Searching All Patterns
  • Longest Repeated Substring,
  • Longest Common Substring, Longest Palindromic Substring

Who is this training for?

Working IT Professionals
Freshers aspiring for an SDE role
College pursuing students
Anyone willing to start & pursue career in Software Engineer domain
Managers & Team Leaders
Technical Co-Founders
College HOD & Professors

4 Reasons to learn DSA under Mr Vimal Daga

01

Teaching beyond the certification

 

02

Practical Industry knowledge, Creator mentality

03

90 days technical support and a community for lifetime networking 

04

Exclusive training of most demanded & market valued DSA 

Still not sure if the training is for YOU?

Please see if you can resonate with any, tick where your answer is YES !

If you have ticked any of the above box, then you are invited to join Complete Data Structures & Algorithm - InDepth Training Program

Get Certified

Yes! You will be certified for this training once you submit the task given, if any

Official and verified:

Receive an instructor signed certificate with institution’s logo to verify your achievements and increase your job prospects

Easily shareable

Add the certificate to your CV or your Resume or post it directly on LInkedin. You can even post it on instagram and twitter.

Enhances Credibility

Use your certificate to enhance your professional credibility and stand out among your peers as an expert

Increase potential opportunities

By showcasing your achieved skill set using your certificate, attracting the employer for the desired job opportunities becomes easy

Know Your Mentor

None of the technologies is complex since created by human beings. Hence, anyone can learn it and create something new.

#13 proudly presents Vimal Daga as the mentor for this program

A world record holder, Mr. Vimal Daga is a Technologist, Philanthropist & A TEDx Speaker who is dedicatedly working atowards his vision- “Awakening the youth through a culture of right education”.

He is the first one in the world to become “RedHat Certified Architect Level 25 along with Enterprise Application Level 10”. Companies benefited from his 19+ years of experience.

He has expertise in multitude of latest and high-end technologies namely Machine Learning, Deep Learning, Delphix, AppDynamics, Docker, DevOps, Cloud Computing, AWS, and many more.
2,00,000+ Students Impacted
1,50,000+ Professionals trained
75+ Global Certifications
200+ Companies benefited

Vimal's Journey
From humble beginnings to winning learners' hearts across the globe

With the expertise to deliver any technology in an easy way and a heart to share his knowledge, Vimal Daga is a self-made IT enthusiast. He is meticulous about researching the skills needed for the future and making them available for the entrepreneurs & professionals of tomorrow. The masterly IT consultant has changed the lives of many students with his inspiring teachings. 

You can be the next!

Stepping Stones of Vimal’s vision: 

Vimal Daga, in his near 20 years of experience has earned many laurels. To mention a few:

  • Became Young Entrepreneur 
  • A TedX speaker
  • Trained more than 3,50,000+ students for free
  • Two-time world record holder
  • Fastest achiever of 11 AWS global certifications (in 11 days)
  • Highest RHCA level holder (25th level with 10th level EA)
  • Creating 100s and more of entrepreneurs through his trainings

Book your spot ! We will be increasing the price soon…

Complete Data Structures & Algorithm - InDepth Training Program - Launch Offer (Save ₹ 12,000)

₹ 13,000 ₹ 25,000 (+ taxes)

What you’ll learn...

And bonuses too...

For us, our learners are the heart of our institution.

Our community is a mix of students, professionals, and budding entrepreneurs, who come as learners and become the torchbearers of our vision. They are the source of our inspiration and the drivers of our passion.

Let’s look at what some of our learners have to say about us.

Frequently Asked Questions

Dates : 18th Oct, 2022 onwards (Tuesday to Friday)

Time : 6:45 pm to 8:15 pm IST

Duration : 60 hours

The program will be delivered LIVE, providing full interactive opportunities to participants for sustainable learning.

Yes, we do provide the access to the material which was covered in the training for your future reference for limited time span

No, we are not offering any corporate or group discount.

We start from the very basics, so no previous knowledge is required.

Yes DEFINITELY. You will be added to a community where technical support team members will answer your queries for 90 days from the completion of the program.

We have a “no questions asked” 100% refund policy till 24 hours prior to the start of the program. After that, no refund will be entertained. Amount will be refunded within 7 days. For related queries email us at info@hash13.com.

Our alumni works at: