python (12.9k questions)

javascript (9.2k questions)

reactjs (4.7k questions)

java (4.2k questions)

java (4.2k questions)

c# (3.5k questions)

c# (3.5k questions)

html (3.3k questions)

Questions - sliding-window

Apache Beam Performance Between Python Vs Java Running on GCP Dataflow

We have Beam data pipeline running on GCP dataflow written using both Python and Java. In the beginning, we had some simple and straightforward python beam jobs that works very well. So most recently ...
test-img

Jie Zhang

python

java

google-cloud-platform

apache-beam

sliding-window

Votes: 0

Answers: 1

Latest Answer

Yes, this is a very normal performance factor between Python and Java. In fact, for many programs the factor can be 10x or much more. The details of the program can radically change the relative perfo...
test-img

Kenn Knowles

Count Nice Subarrays - Understanding sliding window technique and not prefix sum

I am new to Two Pointer patters and in particular the Sliding Window technique. I encountered this problem on leetcode - Count Nice Subarrays. I have seen many solutions that change the array to 0's a...
test-img

Spindoctor

arrays

algorithm

pointers

data-structures

sliding-window

Votes: 0

Answers: 1

Latest Answer

In my answer, I have mentioned few lemmas. I have proved the first three in simple manners and provided only visual representation for the last 2. I have done so to avoid complexity and also because t...
test-img

AKSingh

Kusto for sliding window

I am new to Kusto Query language. Requirement is to alert when the continuous 15 minute value of machine status is 1. I have two columns with column1:(timestamp in every second) and column2:machine st...
test-img

Pinky

azure-data-explorer

kql

sliding-window

kusto-explorer

Votes: 0

Answers: 2

Latest Answer

Here is another option using time series functions: let dt = 1s; let n_bins = tolong(15m/dt); let coeffs = repeat(1, n_bins); let T = view(M:string) { range Timestamp from datetime(2022-01-11) to ...
test-img

Adi E

Why is a sliding window algorithm considered O(n) and not O(n^2)?

On leetcode 424. Longest Repeating Character Replacement - (https://leetcode.com/problems/longest-repeating-character-replacement) You are given a string s and an integer k. You can choose any charac...
test-img

NimaKapoor

algorithm

go

time-complexity

sliding-window

Votes: 0

Answers: 1

Latest Answer

The way you implemented the algorithm, the complexity is O(n^2). If you claim that "this type of algorithm is considered O(n)", then you didn't correctly implement this algorithm. Here is a ...
test-img

Visne

Posts

Questions

Blogs

Jobs