Quant Researcher at Algorithm Trading/Computer Science NSIT/Competitive Coding

Shaksham Garg

The course is about Stacks and Queues. Stacks and Queues are widely used in competitive programming and are of significant importance in solving many real life problems like expression conversion. Recursion in any programming language is internally implemented by using stacks only. Similarly Queues have their own importance like solving of first come first serve scheduling algorithms.

Programming

English

Data Structures and Algorithms - Stacks and Queues

Competitive Programming

Stacks & Queues

Basics

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

Introduction to Stack

In this lesson, Shaksham discusses the array based implementation of the stack.

Stack: Array Based Implementation

In this lesson, Shaksham discusses linked list implementation of the stack.

Stack: Linked List Based Implementation

In this lesson, Shaksham discusses the comparison between the implementation of array-based and linked list based stack.

Comparison between Array and Linked List Based Implementation of Stack

In this lesson, Shaksham discusses balanced braces.

Application of Stack: Balanced Expression

In this lesson, Shaksham gives an introduction to algebraic expressions.

Algebraic Expression

In this lesson, Shaksham discusses Evaluation of Prefix Expressions.

Prefix Expressions Evaluation

In this lesson, Shaksham discusses conversion from infix to postfix expression.

Infix to Postfix Conversion

In this lesson, Shaksham discusses evaluation of postfix expression.

Postfix Expression Evaluation

In this lesson, we will discuss stack based search problem and their solution.

Stack: Backtracking Problems

In this lesson, we will discuss recursion based search problem and their solution.

Recursion: Backtracking Problems

This lesson provides an introduction to queues.

Introduction to Queues

This lesson is about pointer based implementation of queue.

Pointers Based Implementation of Queue

This lesson is on c++ code for pointer-based implementation of queue.

Code for Pointer-Based Implementation of Queue

This lesson is about array based implementation of queue.

Array-Based Implementation of Queue

This lesson is on c++ code for array based implementation of queue.

Code for Array-Based Implementation of the Queue

This lesson is about comparison of the array based and linked list based implementation of queue.

Comparison of Pointer-Based and Array-Based Implementation of the Queue

This lesson is about using stack and queue to recognise whether string is palindrome or not.

Application of Queues

This series aims to take your programming to the next level. The series focuses on aspiring programmers who aim to be better at coding.

Hackerearth Inc.

This collection begins with the explanation of Euclid's Algorithm. Thereby the next lesson talks about Number Theory and discusses prime numbers. Also the need and implementation of a powerful algorithm, the Modular Exponentiation are also being discussed. In the next lesson, problems are discussed that requires one to compute a huge value. For reference please follow this link:  https://www.hackerearth.com/notes/number-theory-1 

Diving Into Number Theory

The collection provides a basic introduction to Stacks and Queues. The first lesson talks about the Stack data structure and why and how it is used. Thereby Queue data structure and its domain of application are discussed. The last two lessons help in solving an elementary problem using the Stack Data Structure and Queue Data Structure. Also, follow the links provided in the lessons for better understanding. 

Studying The Basic Data Structures - Stacks & Queues

 A student at NIT Durgapur pursuing B.Tech currently in my final year. Interested in Data Structures, Algorithms and Web Development.


Sarfraz Baig

This course deals with the Abstract Data Type Queue and its implementation. In these series of lessons, we will try to do an in-depth analysis of queue and its implementations. The course also deals with solving competitive programming questions based on queue along with some typical questions asked in an interview.

Introduction To Queues

The course is about linked list data structure. The prerequisites for the course are: Pointers; Dynamic Memory Allocation. 
The course first gives an introduction to linked list then discusses about operation that can be performed on linked list.

Data Structure and Algorithms - Linked List

Computer science background. Passionate about solving real life problems through algorithms. Intern at GeeksforGeeks. Freelancer.

Dhiman Mayank

This course will discuss algorithms and data structures with important interview questions.

(Hindi) Data Structures - Stack, Queue, Linked List, Sorting and Binary Search

The collection begins with an indispensable searching algorithm, Binary Search and tries to get a basic understanding of where it can be used. The next two lessons solve problems for the important application of Binary Search in Competitive Programming. In these two lessons, one can Binary Search for the answer in a range of values and learn how to exploit the behavior of a variable.

Lessons

18 lessons • 3h 6m

Invalid Date

NaN

Introduction to Stack

Invalid Date

NaN

Stack: Array Based Implementation

Invalid Date

NaN

Stack: Linked List Based Implementation

Invalid Date

NaN

Comparison between Array and Linked List Based Implementation of Stack

Invalid Date

NaN

Application of Stack: Balanced Expression

Invalid Date

NaN

Algebraic Expression

Invalid Date

NaN

Prefix Expressions Evaluation

Invalid Date

NaN

Infix to Postfix Conversion

Invalid Date

NaN

Postfix Expression Evaluation

Invalid Date

NaN

Stack: Backtracking Problems

+ See all lessons