} \subset s : a+b \le d|$ in o( ) i am struggling with exercise from the old algorithmic exam: $d$ is const for the whole structure. propose a structure for which you can do: init(s) //called only time insert(x, s):: $ s := s \... algorithms data-structures avl-trees asked hours ago tester bronze badges...
substring of a given binary string a binary string is given to us and we need to find number of awesome substring of that string .definition of awesome string : a string is awesome if its length is divisible by number of 's in it. ... algorithms data-structures strings asked yesterday shawn bronze badges...