Gain insights into competitive programming, explore C++ skills with theory, code samples, practice problems, and master faster implementation for contests like ACM ICPC, Google CodeJam, and HackerCup.

Competitive programming can be a great way to build out your programming skills, get on any major company’s radar, and earn a little extra cash along the way.

In this course, you will learn to prepare for competitive programming contests like ACM ICPC, Google CodeJam, Facebook HackerCup, and many more.

Each topic is broken down with a healthy mix of theory, code samples, step-by-step solved sample problems, illustrations, useful practice problems, and tips and tricks for faster implementation.

You will need some solid C++ foundations coming into this course, but by the end it, you will be confident enough in your C++ skills to take home the win.

Competitive Programming in C++: The Keys to Success

# Structure
Each node contains a value and a pointer to the next node.



struct Node {
    int val;
    Node* next;

    Node (int val) {
        this->val = val;
        this->next = NULL;
    }
}

# Searching
Searching in a linked list is pretty straightforward.

Start iterating from the head. Move to the next element using the _*next*_ pointer until you reach the end or the element we are searching for.
In the worst case, we traverse the entire list. So, the time complexity is $O(N)$.



In this lesson, we'll learn how to represent and search in a singly linked list.


Introduction

Complexity Analysis

Number Theory

Arrays and Vectors

Sieve of Eratosthenes

Strings

Sorting

Linked List

Stack

Queue

Binary Tree

2 Pointers

Heap

Binary Search Tree

Balanced Binary Search Tree

Course Conclusion

Singly Linked List - Searching

Structure

Searching