sanjogj43
BAN USERThere must be some catch or constraint in this problem. Otherwise using arrays is the simplest solution. Toggle would be O(end index - start index) - > O(n) in worst case. How could anyone optimize that? Is there really a necessity to solve this using segment tree or interval tree or AVL tree or Fenwick tree.
- sanjogj43 November 20, 2016
Reppepsyfarely, Front-end Software Engineer at 247quickbookshelp
I am Pepsy , a security supervisor at Edge Services for the last 4 years managing security teams and corporate environments ...
Reprizzafilher, Java Developer at Achieve Internet
Sorter with 3+ years of experience , performs duties in a safe manner in compliance with all local, state, and federal ...
RepI'm from India, 26 years old. I want to travel, I want a job where I can earn money ...
Repdevlinadevid, CAD Designer at FeatureCAM
Experienced CAD drafter seeking an advanced architectural position. Interested in culinary arts and currently in a course for making sushi ...
Repharrytallh, Web Developer at Realty Depot
I am working as a Web developer . Here I create and maintain websites. Here I handle many responsibilities where I ...
Repseinarondal, Applications Developer at ABC TECH SUPPORT
I am Seina, a hardworking individual with many years of customer service experience seeking a position with a company utilizing ...
Use segment tree to find the elements in the given range in O(log n) complexity.
- sanjogj43 November 20, 2016