ToDo: split the article later by topic.

  1. Construct binary Tree from inorder and postorder leetcode problem link

  2. cartesian tree problems in codeforces blog

  3. Given an inorder traversal of a cartesian tree, construct the tree. following js meetup works on this on 09-06, here's the google doc with work on code from few members.

Woud this help?

int findInorderPosition(int[] inorder, int value, int start, int end) {
    for (int i = start; i <= end; i++)
    if (inorder[i] == value)
        return i;
    return -1;

dynamic programming find max sum from array, SO hint

string problems

codeforces String Problems and Solutions

segment tree (probably a solution on Battle with you know who) code link

Competitive programming, with Lewin Gan

System Design Problems

  1. Design Twitter (Part 2)


Rezaul convolution

Problem set & Analysis from the Finals and Qualification rounds

Why does a = b (mod n) iff a - b is divisible by n?

may be related to some problem from innoworld

binary indexed tree

codeforces editorials on