Book Online Tickets for Problem Solving - Data Structures and Al, . Online Training - Sat & Sunday 9am to 6PM
Demo Video
How to implement a Queue with two stacks?  Part 1 - 2 - 3 -

Problem Solving - Data Structures and Algorithms


  • Regular Registration

    Sale Date Ended

    INR 6500
    Sold Out

Invite friends

Contact Us

Page Views : 481

About The Event

Online Training - Sat & Sunday 9am to 6PM

Demo Video

How to implement a Queue with two stacks?  
Part 1 -
Part 2 -
Part 3 -

Course Content
This course will be useful for working software professionals or any job seekers who would like to land in top tier companies like Amazon, Apple, Google, Microsoft, PayPal, eBay, Samsung, etc.,

That's not all, you can stay on top in your current company by learning these problem solving techniques and become a top performer at your work place.
The intent of this course is not just discussing about datastructures and algorithms, we would be solving many interview questions and problem solving techniques that will land you in a good job or retain your job and stay/become a top performer or make you a better developer wherever you are.

Anyone can write code to solve a problem but by applying the right datastructure and algorithm you can write the most optimal code that gives the best performance, which is the sole motive of this course.

Problem Solving - Discuss and solve a whole bunch of interview questions applying all those Data Structures and Algorithms

  • Introduction
  • Data Structures & Algorithms
  • Various Models of Computation
  • Performance of Program vs Algorithm
  • What is an efficient algorithm?
  • Complexity Analysis of Algorithms
  • Asymptotic analysis of an algorithm
  • Best, Average and Worst case
  • Runtime Analysis of Algorithms
  • Arrays
  • Strings
  • Queue
  • Stacks
  • Singly Linked List
  • Doubly Linked List
  • Circular Linked List
  • Trees
  • Binary Tree
  • Binary Search Tree
  • AVL Tree
  • Red Black Tree
  • Priority Queue
  • Hash Tables
  • Graphs
  • Sorting Algorithms
  • Comparative Study of Sorting Algorithms
  • Pre Order, In Order and Post Order Traversals
  • Bread First and Depth First Traversal
  • Dynamic Programming
  • Greedy Approach
  • Backtracking
  • Recursion vs Iterative approach?

For enquires, please feel free to talk to the trainer @ +91 822-000-5626 or drop an email to him @