alcatraz47 / analytical_ps

practice of analytical ps

My documentations on each problem

Algorithms

Sliding winow:

• A list or array or string will be applied.
• A window size will be given.
• Will be asked to find the sub-range of an array/list or string.
• Also, the problem setters can ask to provide the longest or shortest sequence.
• Can be asked to find the target values of a list/array or string.
• A condition will be provided to satisfy the output value.

Two pointers:

• Iterable(s) will be given. I.e.: array/lists.
• A pair(two values) a.k.a a two pointers will be key thing to ask.