Merge pull request #4247 from andreionoie/patch0

Correct time complexity for CSES Subarray Sum

Author: SansPapyrus683

solutions/silver/cses-1661.mdx

@@ -19,10 +19,10 @@ subarray with sum $x$. After every iteration, we just add our new prefix sum to
 the map.
 
 ## Implementation
-**Time Complexity:** $\mathcal{O}(N \log N)$
 
-<LanguageSection>
+**Time Complexity:** $\mathcal{O}(N)$
 
+<LanguageSection>
 <CPPSection>
 
 ```cpp
@@ -32,10 +32,6 @@ the map.
 
 using namespace std;
 
-/**
- * @author Qi Wang
- * (detemplifying courtesy to Kevin Sheng)
- */
 int main() {
 	ios_base::sync_with_stdio(0);
 	cin.tie(0);
@@ -65,7 +61,6 @@ int main() {
 ```
 
 </CPPSection>
-
 <JavaSection>
 
 ```java
@@ -114,12 +109,10 @@ public class SubarraySumsII {
 ```
 
 </JavaSection>
-
 <PySection>
 
 ```py
 def main():
-
 	N, X = map(int, input().split())
 	prefix, res = 0, 0
 	mp = {0: 1}  # mp[0] = 1
@@ -133,6 +126,6 @@ def main():
 
 main()
 ```
-</PySection>
 
+</PySection>
 </LanguageSection>