Data-Structures-and-Algorithms-with-Python

Covering Most Topics of DSA, OOP, Mathematics, REGEX using JavaScript, Python3.

ARRAYS:

Time Complexity: Reading[O(1)], inserting[O(1)], Searching[O(n)].
Space Complexity: O(n).

Stack (LIFO):

Time Complexity: Reading[O(1)], inserting[O(1)], Searching[O(n)].
Space Complexity: O(n).

Queues (LIFO):

Time Complexity: Reading/dequeue[O(n)], inserting/enqueue[O(1)], Searching[O(n)].
Space Complexity: O(n).