Rakim's Blog

October 31

October 30

   for (int i = 0; i < n / 2; i++) {
        int cnt = (i + 1) % 4;
        for (int t = i; t < n - i; t++) {
            v[i][t] = cnt; // marks (0,1)
            v[t][i] = cnt; // marks (1,0)
            v[n-1-i][t] = cnt; // marks diagonally opposite
            v[t][n-1-i]= cnt; //marks diagonally opposite
        }
    }

October 29

October 28

map.try_emplace(map.end(), v.key, v.value);
map.try_emplace(map.begin(), v.key, v.value);

October 27

October 26

October 25

Traveled to home so nothing done. Reached safely 😌

October 24

October 23

October 22

queue<TreeNode*> q;
q.push(root);
while(!q.empty()) {
    int size = q.size();
    long long sum = 0;
    while(size) {
        TreeNode* temp = q.front();
        q.pop();
        if (temp->left) {
            q.push(temp->left);
        }
        if (temp->right) {
            q.push(temp->right);
        } 
        size--;
    }
}

October 21

Tough day ngl. When you try to help someone and mess up yourself ugh. Should've just made excuse and not go tbh.
Had Sparkplug as well which was ok ok. Prolly not good enough for second round. It's fine today I sleep early, tomorrow will be a good day!

October 20

Ending the day with a win!

October 19

October 18

October 17

October 16

October 15

October 14

October 13

October 12

October 11

October 10