Practice C++ - Learn C++ Programming

Basic Challenges

Challenge 1: FizzBuzz

Write a program that prints numbers from 1 to 100. For multiples of 3, print "Fizz". For multiples of 5, print "Buzz". For numbers that are multiples of both 3 and 5, print "FizzBuzz".

main.cpp

Output

Ready

Example Solution:

void fizzBuzz() {
    for(int i = 1; i <= 100; i++) {
        if(i % 15 == 0)
            cout << "FizzBuzz\n";
        else if(i % 3 == 0)
            cout << "Fizz\n";
        else if(i % 5 == 0)
            cout << "Buzz\n";
        else
            cout << i << "\n";
    }
}

Advanced Challenges

Challenge 2: Binary Search Tree

Implement a binary search tree with insert and search operations.

main.cpp

Output

Ready

Example Solution:

template<typename T>
class BST {
    struct Node {
        T data;
        Node *left, *right;
        Node(T d) : data(d), left(nullptr), right(nullptr) {}
    };
    
    Node* root;
    
    Node* insert(Node* node, T data) {
        if(!node) return new Node(data);
        
        if(data < node->data)
            node->left = insert(node->left, data);
        else if(data > node->data)
            node->right = insert(node->right, data);
            
        return node;
    }
    
public:
    BST() : root(nullptr) {}
    
    void insert(T data) {
        root = insert(root, data);
    }
};

Algorithm Challenges

Challenge 3: Merge Sort

Implement the merge sort algorithm.

main.cpp

Output

Ready

Example Solution:

void merge(vector<int>& arr, int left, int mid, int right) {
    vector<int> temp(right - left + 1);
    int i = left, j = mid + 1, k = 0;
    
    while(i <= mid && j <= right) {
        if(arr[i] <= arr[j])
            temp[k++] = arr[i++];
        else
            temp[k++] = arr[j++];
    }
    
    while(i <= mid)
        temp[k++] = arr[i++];
        
    while(j <= right)
        temp[k++] = arr[j++];
        
    for(i = 0; i < k; i++)
        arr[left + i] = temp[i];
}

void mergeSort(vector<int>& arr, int left, int right) {
    if(left < right) {
        int mid = left + (right - left) / 2;
        mergeSort(arr, left, mid);
        mergeSort(arr, mid + 1, right);
        merge(arr, left, mid, right);
    }
}