Learning PathBlogsPremiumLogin
Data Structures Learning Path

1. Array

Begin your learning journey with the most basic of all data structures

Show Index

2. Singly Linked List

Learn in-depth the most fundamental data structure in a programmer's life

Show Index

3. Doubly Linked List

Learn about the extension of the singly linked list that powers stacks and queues

Show Index

4. Hash Table

Learn how applications deal with key value mappings efficiently

Show Index

5. Stack

The data structure behind recursion, memory management and much more

Show Index

6. Queue

Learn about the data structure that powers CPU and disk scheduling algorithms

Show Index

7. Recursion

Take a deep dive into one of the most intuitive programming paradigm

Show Index

8. Backtracking

Learn about the ultimate recursive brute force technique

Show Index

9. Binary Tree

Learn all about the most critical data structure in computer science

Show Index

10. Binary Search Tree

Learn about the most critical search data structure in computer science

Show Index

11. Heap

Learn all how a tree can be used as a priority queue

Show Index

12. Graph

Learn about the most dynamic data structure in computer science

Show Index

13. Sorting

Learn all about algorithms to sort data blazingly fast

Show Index

14. Searching

Learn about the algorithms that speed up your searches exponentially

Show Index

15. Dynamic programming

Learn the most powerful optimization for recursive problems

Show Index

16. Bit manipulation

Learn about the fastest ways to manipulate data

Show Index

Array

Begin your learning journey with the most basic of all data structures

11 Lessons
36 Problems
6 Patterns
10 Illustrations

What you will learn

What is an array and what makes is so powerful

Single and multi-dimensional arrays and their structure in memory

Understand essential patterns behind common interview problems

Detailed code implementation and solution of all problems

Intuition through visual explanation of algorithms

Hands on practical experience in a setup free coding environment

Requirements

This is a complete course and assumes that you know nothing about arrays but are familiar with some basic foundational topics in any programming language.

  • Basic knowledge of programming in any language
  • Basic knowledge of functions and classes
  • Basic knowledge of memory management

Overview

Data structures are used extensively in software development and an array is the most fundamental of all data structures. Irrespective of the language, framework, or system that you use, you will always be using a array in some form or the other. 

Loading Image

Representation of an array

Fundamentals

This course teaches you the fundamentals of an array. It provides you with detailed explanations of various concepts that you need to master array in the most intuitive way. We go step by step to explore different types of arrays and how they are stored in memory which will give you a deep insight into this awesome data structure. This will help you gain a thorough understanding of the most basic data structure of all.

Problems Solving

This course is an interactive course with high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by providing detailed explanations of the most common interview problems on arrays. This will help you gain confidence and understand how to convert your learning into action. By the end of the course, you will be pretty confident to solve any array problems thrown at you.

Who this course is for

This course is an all-rounder course and targets a variety of audiences ranging from complete beginners to experienced programmers who want to take their knowledge to the next level. You will greatly benefit from this course if you identify yourself as one of the following

  • Non developers who want to start their journey to learn data structures
  • Developers who want to get deepest knowledge of arrays
  • Anyone interested in improving their problem solving skills
  • Anyone preparing for programming interviews

Course Contents

1. Introduction

0%
Memory model
What's the problem
A possible solution
Supported operations
Internal working

2. Multi dimension array

0%
What's the problem
A possible solution
Supported operations
Internal working
Row major order
Row major traversalnew
Easy
Column major order
Column major traversalnew
Easy

3. Pattern: Two Pointers

0%
Palindrome checkernew
Easy
+1
Flip charactersnew
Easy
+2
Reverse segmentsnew
Easy
Vowel exchangenew
Easy
Reverse wordsnew
Easy
+1
Reverse word ordernew
Medium
K rotationsnew
Medium
+1
Largest containernew
Medium
+3

4. Pattern: Two sum

0%
Two sumnew
Easy
+3
Duplicate aware two sumnew
Easy
+3
Target limited two sumnew
Easy
Three sumnew
Medium
+3
Approximate three sumnew
Medium
+2
Four sumnew
Medium

5. Pattern: Simultaneous Traversal

0%
Subsequence checkernew
Easy
+1
Merge sorted arraysnew
Easy
+3
Unique intersectionsnew
Easy
Repeated intersectionsnew
Easy

6. Pattern: Sliding Window

0%
Subarray size equals Knew
Medium
K subarray averagenew
Easy
Kadane's algorithmnew
Medium
+4
Largest product subarraynew
Medium
+1
Targeted sum subarraynew
Medium
+4
Subarray sum equals knew
Medium
Targeted sum subarray IInew
Medium
Product conundrumnew
Medium
Consecutive onesnew
Easy
Consecutive ones with one flipnew
Medium
Consecutive ones with K flipsnew
Medium