struct compare { bool operator()(node l, node r) { .... } };

We use above struct in the priority queue to define custom compare function.

Why () operator overloading works?

Thanks in advance..

In the code:

#include <bits/stdc++.h>
using namespace std;
int main() {
  int *arr = new int[15];

  for (int i = 0; i < 5; i++)
    arr[i] = 2 * i;

  for (int i = 0; i < 5; i++)
    cout << arr[i] << " ";
  cout << endl;

  delete[] arr;

  for (int i = 0; i < 5; i++)
    arr[i] = 3 * i + 1;

  for (int i = 0; i < 5; i++)
    cout << arr[i] << " ";
  cout << endl;

  return 0;
}

Output:

0 2 4 6 8

1 4 7 10 13

i.e. there is no error

How are we able to access and modify an array which does not exist in the memory? Edit: What is the lifetime of the above array? is it till delete operation or ending curly parenthesis?

Can someone help me with the problem, http://codeforces.com/contest/918/problem/C, any help would be appreciated.

I was trying to understand, https://en.wikipedia.org/wiki/Lexicographically_minimal_string_rotation, but was unable to grasp the algorithm. Can someone explain me the algorithm or suggest some good source for the same.

Thanks in advance..

Please help me with some doubts, I was reading 2D BIT, gfg implementation https://www.geeksforgeeks.org/two-dimensional-binary-indexed-tree-or-fenwick-tree/

In the updateBit and getSum function inner loop, "y" is not initialized again, can someone explain me how is it working and what is the need of outer loop as the same work can be done with the help of an "if" statement.

Thanks in advance..