First C++ Program

Hello World

Sum of Two Integers

test

Basics of C++

Input Output Formatting

Operators

Even or Odd

Compare Two Numbers

Largest of Three Numbers

Operator Precedence

Bitwise Operators

Logical Short Circuit

Data Types

Integer Overflow

Size of Data Types

Type Casting

Float vs Double

Boolean Logic

Character Arithmetic

Variables and Scope

Local vs Global Variables

Variable Scope Rules

Variable Shadowing

Const Correctness

Static Variable

Scope Resolution Operator

Decision Making – If Else

Leap Year

Positive Negative or Zero

Voting Eligibility

Grade Calculator

Triangle Validity

ATM Withdrawal Logic

Loops

Print Numbers 1 to N

Sum of First N Numbers

Multiplication Table

Count Digits

Reverse a Number

For vs While Loop

Infinite Loops

Loops (2)

Print Numbers 1 to N (Loops (2))

Sum of First N Numbers (Loops (2))

Multiplication Table (Loops (2))

Count Digits (Loops (2))

Reverse a Number (Loops (2))

For vs While Loop (Loops (2))

Infinite Loops (Loops (2))

Printing Patterns – Moderate

Number Triangle

Reverse Number Triangle

Diamond Pattern

Hollow Patterns

Butterfly Pattern

Printing Patterns – Advanced

Pascal's Triangle

Hourglass Pattern

Concentric Square Pattern

Advanced Pattern Collection

Printing Patterns – Advanced (2)

Pascal's Triangle (Printing Patterns – Advanced (2))

Hourglass Pattern (Printing Patterns – Advanced (2))

Concentric Square Pattern (Printing Patterns – Advanced (2))

Advanced Pattern Collection (Printing Patterns – Advanced (2))

Pointers

Pointer Basics

Swap Using Pointers

Pointer Arithmetic

NULL vs nullptr

Dangling Pointer

Revision Test

Even or Odd (Revision)

Largest of Three Numbers (Revision)

Sum of Digits

Reverse a Number (Revision)

Prime Number Check

Factorial (Revision)

Count Digits (Revision)

Simple Calculator (Revision)

Phase-1 Full Practice Set

Revision – C++ Core

Output Prediction 1

Output Prediction 2

Debug Snippet 1

Loop Output Trap

Operator Output

Pointer Output

Reference Output

Array Output

Recursion Trace

Mixed Output Test

Vectors

Running Sum

Build Array from Permutation

Contains Duplicate

Reverse Vector

Insert and Erase

Smaller Numbers Than Current

Sort Vector

Remove Duplicates (Sorted)

Find Max and Min

Frequency Count

Arrays

Maximum Subarray

Remove Duplicates

Rotate Array

Merge Sorted Array

Missing Number

Second Largest

Move Zeros

Subarray Sum

Rearrange Array

Count Inversions

Prefix Sum Basics

Kadane Variant

Output / Dry-Run Problems

Nested Loop Dry Run

Array Dry Run

Condition Dry Run

Pointer Dry Run

Recursion Dry Run

Mixed Dry Run 1

Mixed Dry Run 2

Loop Trap

Binary Search

First Occurrence

Last Occurrence

Count Occurrences

Binary Search – Advanced

Search in Rotated Sorted Array

Search Range

Peak Element

Square Root

Binary Search on Answer

Allocate Minimum Pages

Painter’s Partition

Aggressive Cows

Sorting Algorithms

Bubble Sort

Selection Sort

Insertion Sort

Merge Sort

Quick Sort

Counting Sort

Stable vs Unstable Sort

Sort 0s 1s 2s

Relative Sorting

Sort by Frequency

Strings

Valid Palindrome

Anagram Check

Reverse String

Longest Word

Count Vowels

Remove Duplicates (Strings)

Substring Count

String Compression

Rotation Check

Longest Substring Without Repeating Characters

First Unique Character

String to Integer (ATOI)

Pattern Matching

Case Conversion

Hashing

Two Sum

Frequency Count (Hashing)

Subarray with Zero Sum

Subarray Sum Equals K

Majority Element

Intersection of Arrays

Union of Arrays

Count Pairs with Given Sum

Longest Consecutive Sequence

Group Anagrams

Hash Collisions

Map vs Unordered Map

Bit Manipulation

Power of Two

Count Set Bits

XOR Trick

Find Unique Element

Single Number

Set Reset Bit

Toggle Bit

Swap Bits

Binary Representation

Missing Number XOR

Bit Masking

Generate Subsets

Subset Count

CF Bitmask Problem

Decode Subsets

Skill Selection

Masking States

All Subsequences

Interview Bitmask

Two Pointer & Sliding Window

Two Sum II

Reverse Array

Pair Sum

Container With Most Water

Minimum Window Size

Longest Substring Sliding Window

Longest Subarray Sum

Sliding Window Maximum

Triplet Sum

Remove Duplicates (Two Pointer & Sliding Window)

Trapping Rain Water

Character Replacement

Minimum Window Substring

Stack

Valid Parentheses

Next Greater Element

Stack Using Array

Stack Using Linked List

Min Stack

Infix to Postfix

Evaluate Postfix

Reverse Stack

Largest Rectangle in Histogram

Stock Span

Remove Adjacent Duplicates

Balanced Brackets

Queue

Queue Implementation

Circular Queue

Deque Usage

Sliding Window Max

Reverse Queue

First Negative Number

Stack Using Queue

Queue Using Stack

Heap

Kth Largest Element

Kth Smallest Element

Heap Sort

Priority Queue

Connect Ropes

Top K Frequent Elements

Nearly Sorted Array

Median from Stream

Max Heap

Min Heap

Linked List

Reverse Linked List

Detect Cycle

Remove Cycle

Merge Two Sorted Lists

Middle of Linked List

Delete Node

Remove Nth Node

Intersection Point

Palindrome Linked List

Add Two Numbers

Sort Linked List

Rotate Linked List

Clone Linked List

Flatten Linked List

Tree

Inorder Traversal

Preorder Traversal

Postorder Traversal

Level Order Traversal

Tree Height

Tree Diameter

Balanced Tree

Lowest Common Ancestor

Graph

Graph Representation

Breadth First Search

Depth First Search

Connected Components

Cycle Detection (Undirected)

Cycle Detection (Directed)

Number of Islands

Topological Sort

Bipartite Graph

Flood Fill

Rotten Oranges

Shortest Path (Unweighted)

You may also be interested in

test