qiubit questions

• Count nodes bigger then root in each subtree of a given binary tree in O(n log n)
• Finding the biggest segment in array such that minimum value in it is greater or equal the segment's size
• C - Is realloc'ing arrays to arrays twice the size efficient in dynamic data structures?
• Assembler division x86 strange numbers [duplicate]
• Is a[n] really interchangeable with *(a+n) - why does sizeof return two different answers?
• OCaml - declaring n-dimensional arrays
• valgrind - address is 8 bytes before a block of size 16 alloc'd
• Check if a type is passed in variadic template parameter pack
• Data structure for dynamically changing n-length sequence with longest subsequence length query
• Missing integer variation - O(n) solution needed [closed]

qiubit answers