fix(s_buffer): remove the id comparison when re-adjusting the stack

fix(s_buffer): remove the id comparison when re-adjusting the stack

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): re-balance the buffer following each insertion

feat(s_buffer): favor an iterative approach instead of recursion

chore(s_buffer): rename sb_node_t to span_t

chore(s_buffer): rename sb_node_t to span_t

feat(s_buffer): favor an iterative approach instead of recursion

feat(s_buffer): add an s-buffer implementation

feat(s_buffer): add an s-buffer implementation

feat(s_buffer): add an s-buffer implementation

feat(s_buffer): add an s-buffer implementation

feat(sr_sort): add mergesort implementation

feat(sr_sort): add mergesort implementation

feat(sr_sort): add mergesort implementation

feat(sr_sort): add mergesort implementation

feat(s_palind): implement manacher's algorithm

feat(s_palind): implement manacher's algorithm

feat(s_palind): implement manacher's algorithm

feat(s_palind): implement manacher's algorithm

feat(dp_dynprog): solve the leetcode problem #1335

feat(dp_dynprog): solve the leetcode problem #1335

fix(s_substring): remove all calls to S_FlipBit and a branching