codeintuition-logo
Learning PathBlogsPremiumLogin
codeintuition-logo
Data structures
Algorithms

General resources

Learning Path

Blogs

Referral

Social

Linkedin

Twitter

Facebook

Legal

Terms of Service

Privacy Policy

codeintuition-logo
Copyright © 2025 codeintuition.io . All rights reserved.
Learning order

1. Array

Free

Start your learning journey by understanding the most fundamental data structure.

Show Index

2. Singly Linked List

Free

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

Show Index

3. Doubly Linked List

Premium

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

Show Index

4. Hash Table

Premium

Learn how applications deal with key value mappings efficiently

Show Index

5. Stack

Premium

The data structure behind recursion, memory management, and much more

Show Index

6. Queue

Premium

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

Show Index

7. Binary Tree

Premium

Learn all about the most critical data structure in computer science

Show Index

8. Binary Search Tree

Premium

Learn about the most critical search data structure in computer science

Show Index

9. Heap

Premium

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

Show Index

10. Graph

Premium

Learn about the most dynamic data structure in computer science

(Early Access)

Show Index

Array

Start your learning journey by understanding the most fundamental data structure.

31 Lessons
37 problems
8 Patterns
10 Illustrations

What you will learn

What is an array and what makes it 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 an 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 detailed explanations of various concepts that you need to master arrays intuitively. We explore different types of arrays and how they are stored in memory step by step, which will give you a deep insight into this awesome data structure. This will help you thoroughly understand the most basic data structure of all.

Problems Solving

This interactive course involves high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by explaining 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 that you can solve any array problem thrown at you.

Who this course is for

This all-rounder course 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 to arrays

0%
Understanding the memory model
Understanding the problem
Exploring a possible solution
Overview of supported operations
Internal mechanics of arrays
Working example

2. Multidimensional arrays

0%
Understanding the problem
Defining dimensions for arrays
Exploring a possible solution
Overview of supported operations
Internal mechanics of multidimensional arrays
Understanding row major order
Example of row major order
Row major traversal
code solution
Easy
Understanding column major order
Example of column major
Column major traversal
code solution
Easy

3. Pattern: Two pointers

0%
Understanding the two pointer pattern
Identifying direct application
Palindrome checker
code solution
Easy
+1
Flip characters
code solution
Easy
+2
Reverse segments
code solution
Easy
Vowel exchange
code solution
Easy
Ascending squares
code solution
Easy
+1
Reverse words
code solution
Easy
+1
Reverse word order
code solution
Medium

4. Pattern: Two pointers (Reduction)

0%
Identifying two pointer reduction
Two sum
code solution
Easy
+3
Duplicate aware two sum
code solution
Easy
+3
Target limited two sum
code solution
Easy
Largest container
code solution
Medium
+3
Quadratic array sorting
code solution
Medium

5. Pattern: Two pointers (Subproblem)

0%
Identifying two pointer subproblem
K rotations
code solution
Medium
+1
Three sum
code solution
Medium
+3
Approximate three sum
code solution
Medium
+2
Four sum
code solution
Medium

6. Pattern: Simultaneous traversal

0%
Understanding the simultaneous traversal pattern
Identifying the simultaneous traversal pattern
Subsequence checker
code solution
Easy
+1
Merge sorted arrays
code solution
Easy
+3
Unique intersections
code solution
Easy
Repeated intersections
code solution
Easy

7. Pattern: Fixed sized sliding window

0%
Understanding the fixed sized sliding window pattern
Identifying the fixed sized sliding window pattern
K subarray average
code solution
Easy
Subarray size equals K
code solution
Medium

8. Pattern: Variable sized sliding window

0%
Understanding the variable sized sliding window pattern
Identifying the variable sized sliding window pattern
Maximum subarray sum
code solution
Medium
+4
Largest product subarray
code solution
Medium
+1
Targeted sum subarray
code solution
Medium
+4
Targeted sum subarray II
code solution
Medium
Product conundrum
code solution
Medium
Consecutive ones
code solution
Easy
Consecutive ones with one flip
code solution
Medium
Consecutive ones with K flips
code solution
Medium
+1

9. Pattern: Interval merging

0%
Understanding the line sweep technique
Understanding the interval merging pattern
Identifying the interval merging pattern
Verify schedule
code solution
Easy
Overlap reduction
code solution
Medium
+3

10. Pattern: Maximum overlap

0%
Understanding the line sweep technique for points
Understanding the maximum overlap pattern
Identifying maximum overlap pattern
Minimum meeting rooms
code solution
Medium
+3
Remove intervals
code solution
Medium

11. Design

0%
Design a dynamic array
code solution
Hard

12. Assessments

0%
Assessment 1
Assessment 2

13. Certificate

Certificate
Start Learning →

Forever offer!: 70% OFF

Annual

$4

.97

/MO

Billed annualy at$199$59.7

Get Unlimited Access
Unlimited access
Code execution
Detailed solutions
Incremental Learning Path
High quality lessons

Completion Time: 10 hour
Difficulty: Easy
Level: Beginner
Start Learning →

Array

Start your learning journey by understanding the most fundamental data structure.

31 Lessons
37 problems
8 Patterns
10 Illustrations