BLUE 2.0 AI ENGINEER COURSE · ALGORITHMS & INTERVIEW PATTERNS

Blue Course: algorithms and interview prep for Google, Meta, Amazon

16 live online sessions with an instructor, in classes of 7–15. You learn interview problems one type at a time, so you still know how to solve a problem you have never seen.

Next class🔥 6 seats left

Blue Online 60 · Starts Dec 14, 2026

Mon + Fri evenings, 19:00 – 21:30 (Vietnam time, GMT+7) · Live online, taught in Vietnamese

6,500,000 VND7,500,000 VND1,000,000 VND off for the first 5 early registrants this month

Following class: Blue Online 61 · Jan 9, 2027 · Sat + Sun evenings · see the schedule

✓ 100% refund if you cancel at least 15 days before the start date✓ Installment payments available

Students and instructors in a Big-O Coding class
⭐ 5.0 / 400+ Google reviews🏆 100+ students in Big Tech

Big-O Coding students have received offers from

GoogleMetaAmazonMicrosoftAppleLinkedIn

See our students' real offers on the Hall of Fame →

Blue Course tuition, schedule and duration

Ideal forCS students preparing for internships or a job search; developers with 1–5 years of experience who want to move to a higher-paying job
LevelJunior → Senior
Duration16 main sessions + 8 tutoring sessions, 2 hours 30 minutes each
Programming languageC++, Python, Java
FormatOnline (live class, taught in Vietnamese), 7–15 students per class
Schedule2 sessions a week (Mon + Fri evenings or Sat + Sun evenings), 19:00 – 21:30 (Vietnam time, GMT+7)
Start dateBlue Online 60: Dec 14, 2026 (6 seats left) · Blue Online 61: Jan 9, 2027
Tuition6,500,000 VND (regular price 7,500,000 VND). 1,000,000 VND off for the first 5 early registrants this month. An extra 10% off for former students. Installment payments available
Free trial & refundFirst session free. 100% refund if you cancel at least 15 days before the start date (policy)
InstructorsPhạm Nguyễn Sơn Tùng (our team)
Student results100+ Big Tech offers (Hall of Fame), 5.0 from 400+ Google ratings (reviews)

✨ Who the Blue Course is for

  • ✓You want to pass interviews at Google, Meta, Amazon, Microsoft...
  • ✓You want to sharpen your algorithmic thinking.
  • ✓You're a CS student preparing for an internship / job search.
  • ✓You're a developer with 1–5 years of experience looking to move to a higher-paying job.
  • ✓You want to learn systematically from instructors with ACM-ICPC credentials.
  • ✓You want to apply AI in your work.

📅 Blue Course start dates and tuition

Blue Online 60 Dec 14, 2026 · Mon & Fri evenings, 19:00 – 21:30 (Vietnam time, GMT+7) 🔥 6 seats left
Blue Online 61 Jan 9, 2027 · Sat & Sun evenings, 19:00 – 21:30 (Vietnam time, GMT+7) ✅ Early registration is open
7,500,000 VND
6,500,000 VND
1,000,000 VND off for the first 5 early registrants this month
An extra 10% off for former students
✅ First session free ✅ 100% refund if you cancel 15 days before the start date ✅ Pay in installments

What Blue Course students say

“After a few years of working, I had forgotten almost everything I knew about algorithms. After finishing the BIG-O Blue course, I've pulled together a pretty good overview of algorithms again.”
Lê Văn HoàngBlue Course student
“After completing the Big-O blue course, I feel I code better and think things through better when solving problems.”
Nguyễn Phúc LợiBlue Course student
“After finishing the blue course, I feel like my brain got “unlocked” on so many things. Compared to before, I've improved a ton.”
Nguyễn Đỗ Chí ThảoBlue Course student

Read more student reviews →

Reserve your seat in the Blue Course

Big-O Coding will confirm by Zalo and email within 30 minutes.

More options: package, referrer, notes
Single course Blue Course only 6,500,000 VND Save more Bundle Blue + Orange, 25% off ~11,900,000 VND
❌ Something went wrong. Please call us directly at 0937 401 483

100% refund if you cancel at least 15 days before the start date. Installment payments available.

✅

You're registered!

Big-O Coding has received your details.

We will contact you by phone and email within the next 30 minutes.

📞 Phone: 0937 401 483

💬 Email: admin@bigocoding.com

Blue Course syllabus: 16 sessions of algorithms and Interview Patterns

Every session follows the model: Problem → Solution → Outcome

Click to see the detailed syllabus
PART 1 - FOUNDATIONAL THINKING & TOOLS
Lecture 01 - Algorithmic Complexity

Problem: Why does code that runs correctly still get rejected (Time Limit Exceeded)? How can you tell whether your code is fast or slow?

Content: Learn to "measure" performance with Big-O - O(1), O(N), O(N²). Build an optimization mindset from your very first line of code.

AI-Native: Use AI to analyze the complexity of sample code and explain abstract concepts.

📖 Read ahead: Algorithmic complexity and Big-O notation: how to work it out quickly, with C++ and Python examples

Lecture 02 - Sorting & Intervals

Problem: How do you sort in any custom order you want? How do you handle merging meeting schedules or overlapping time intervals?

Content: Master sorting algorithms and Interval techniques. Write custom Comparators in C++/Java/Python.

Outcome: Confidently solve scheduling and data statistics problems.

Lecture 03 - Prefix Sum

Problem: How do you calculate the total from day X to day Y in O(1) without a loop?

Content: The prefix sum array technique - a secret weapon that cuts O(N) down to O(1). Extended to 2D arrays and the Difference Array.

Outcome: Answer range sum queries at lightning speed, a foundation for optimization problems.

📖 Read ahead: Prefix sums and difference arrays: a simple explanation, with C++ and Python code

Lecture 04 - Two Pointers & Sliding Window

Problem: How do you find a substring that meets a condition without 2 nested O(N²) loops?

Content: Two Pointers "squeeze" the data, Sliding Window "sweeps" the data. Turn slow algorithms into O(N).

Outcome: Smoothly solve problems on strings and contiguous subarrays.

📖 Read ahead: The Sliding Window technique: fixed and variable-size windows, with C++ and Python code · The Two Pointers technique: a step-by-step explanation, with C++ and Python code

Lecture 05 - Fast & Slow Pointers (Tortoise and Hare)

Problem: How do you detect a cycle in a Linked List? How do you find the middle in a single pass?

Content: Floyd's Cycle Finding algorithm. 2 pointers moving at different speeds to solve Linked List problems.

Outcome: Master Linked Lists - a red-hot topic in Amazon/Google interviews.

PART 2 - CORE DATA STRUCTURES
Lecture 06 - Stack & Queue

Problem: How do you check for valid parentheses? Or find the Next Greater Element in O(N)?

Content: LIFO and FIFO mechanisms. The Monotonic Stack technique for nearest-element problems.

AI-Native: Use AI to generate edge test cases (empty Stack, Stack overflow) for debugging.

📖 Read ahead: What is a deque? The double-ended queue and the O(n) sliding window maximum · Queues: FIFO, circular queues, and C++ and Python code · Stacks: how LIFO works, checking brackets and evaluating postfix expressions in C++ & Python · Monotonic stacks: finding the next greater element and the largest rectangle

Lecture 07 - Binary Search

Problem: An O(N) search is too slow for 10^9 elements. Is there a faster way?

Content: Divide-and-conquer thinking. Binary Search on Answer - the technique that separates pro candidates from newbies.

Outcome: Search in O(log N), processing huge amounts of data in the blink of an eye.

📖 Read ahead: Binary search: a simple explanation, with C++ and Python code

Lecture 08 - Midterm Contest

Goals: Review all of the first 7 sessions. Systematize your thinking on Arrays, Strings and basic optimization techniques.

Activities: A test that simulates real pressure. Assess your skills to plan your strategy for the second half.

PART 3 - GRAPHS & ADVANCED ALGORITHMS
Lecture 09 - BFS & DFS (Graph Traversal)

Problem: Finding your way through a maze? Spreading information across a social network?

Content: BFS - spreads out breadth-first (shortest paths). DFS - goes depth-first (connectivity checks).

AI-Native: Use AI to visualize the order in which nodes are traversed.

📖 Read ahead: How do BFS and DFS differ? Choose based on what you need to find · BFS: breadth-first traversal and paths with the fewest edges · Graph representation: adjacency lists, adjacency matrices and edge lists · DFS: depth-first traversal and counting connected components

Lecture 10 - BST & Hash Map

Problem: How do you store data so that searching, inserting and deleting are all fast? When do you use a Map, and when a Set?

Content: BSTs and the power of the O(1) Hash Map. Frequency counting and fast lookup problems.

Outcome: Understand how STL map/set work under the hood so you can use them optimally.

📖 Read ahead: Hash tables: dict, unordered_map and counting pairs that sum to K · Binary search trees (BST): search, insertion and why a tree becomes skewed

Lecture 11 - Heap / Priority Queue

Problem: How do you always get the largest/smallest element of a dynamic dataset without re-sorting?

Content: The Heap structure and Priority Queue. Top K elements and CPU scheduling problems.

Outcome: The foundation for Dijkstra's algorithm.

📖 Read ahead: Priority queues and heaps: keeping the top K in C++ and Python

Lecture 12 - Dijkstra (Shortest Path)

Problem: How does Google Maps find the shortest route on a complex map?

Content: Dijkstra combined with a Heap. Shortest paths on graphs with non-negative weights.

Outcome: Implement the world's most famous routing algorithm with your own hands.

📖 Read ahead: Dijkstra's algorithm: shortest paths with non-negative edges

Lecture 13 - DSU / Union-Find

Problem: How can you tell whether 2 people on a social network have a mutual friend?

Content: Union-Find with Path Compression and Union by Rank.

Outcome: Solve graph connectivity and cycle problems with great efficiency.

📖 Read ahead: DSU (Union Find): merging groups, path compression and counting components

Lecture 14 - Trie (Prefix Tree)

Problem: How does Google's Auto-complete work?

Content: The Trie, a tree structure built specifically for string processing.

Outcome: Build dictionary, keyword suggestion and lightning-fast prefix filtering features.

📖 Read ahead: Tries (prefix trees): adding and finding words, and counting words by prefix

PART 4 - THE FINISH LINE
Lecture 15 - Mock Interview

Activities: A simulation of the real Coding Interview process at Big Tech. No theoretical coding - a real battle of wits.

AI-Native: Detailed section-by-section CV edits, challenging follow-up questions, Communication scoring.

Goals: Build exam-room composure, the skill of buying thinking time smartly, and the ability to present your solutions convincingly.

Lecture 16 - Final Contest

Activities: Solve a problem set covering everything you have learned, within a time limit.

Goals: Graduate with the mindset of an engineer ready to conquer any interview!

BONUS - 5 AI SESSIONS INTEGRATED THROUGHOUT THE COURSE
The Onboarding

Use AI as your personal Teaching Assistant. Simplify abstract concepts.

The Debugger

Find hard-to-spot Logical Bugs. Generate Corner Cases automatically.

The Visualizer

Explain the execution flow. Analyze the differences between solutions.

The Architect

Understand algorithm design. Prove optimality.

The Interviewer

Simulate interview pressure. Learn to explain concisely and convincingly.

Blue Course instructors

Phạm Nguyễn Sơn Tùng
Phạm Nguyễn Sơn TùngFounder Big-O Coding
  • 5 years as Head Coach of the HCMUS ACM-ICPC team.
  • Twice the coach representing Vietnam at the ACM-ICPC World Finals, in 2014 and 2016.
  • More than 40 awards at Programming Contest Asia Regionals.
  • Second prize at the Vietnamese Talent Awards (Nhân Tài Đất Việt) 2015.

Meet our instructors and teaching assistants →

Where Big-O Coding students work

Offers by company on the Hall of Fame, not counting 50+ offers that were not made public.

Facebook 9Google 8Amazon 5Microsoft 5Meta 3Grab 2Oracle 2Apple 1Bank of America 1Booking.com 1Confluent 1Deloitte 1Klaviyo 1LinkedIn 1Misfit 1Naver 1Shopee 1Snapchat 1TikTok 1Two Sigma 1Walmart 1Waymo 1Zoom 1

See the Hall of Fame →

Read ahead on our blog

See the Programming Handbook →

Frequently asked questions about the Blue Course

What does the Blue Course cover?

16 main sessions in 4 parts: foundational thinking and tools (complexity, sorting, prefix sums, two pointers, fast and slow pointers), core data structures (stack, queue, binary search, midterm test), graphs and advanced algorithms (BFS, DFS, BST, hash map, heap, Dijkstra, DSU, Trie) and the finish line (mock interview and final exam). Plus 8 tutoring sessions.

How do the online classes work, and how many students are in a class?

You learn live online with the instructor (live class, taught in Vietnamese), 2 sessions a week (Mon + Fri evenings or Sat + Sun evenings), 19:00 – 21:30 (Vietnam time, GMT+7). Each class has 7–15 students.

Which programming languages are used?

C++, Python, Java.

How much is the tuition, and can I pay in installments?

6,500,000 VND (regular price 7,500,000 VND). 1,000,000 VND off for the first 5 early registrants this month. An extra 10% off for former students. Installment payments available.

Can I try a class first, and what if I cancel?

First session free. 100% refund if you cancel at least 15 days before the start date.

Can I take Blue if I'm new to programming?

The Blue Course is for people who can already program, at Junior level or above. If you are just starting out, take the Green Course first.

Ready to start your journey?

Enroll Now