## 📄️ Algorithm Complexities

In the computer science world, there are terminologies that we use to better explain concepts.

## 📄️ Overlapping 2 numbers

Reference

## 📄️ Checking Around Grid

- Put in the constraints first around and exit if it is either lower than 0 or greater than grid length

## 📄️ Binary Search Tree

A prerequisite to doing a binary search is that the list we are searching from is SORTED otherwise it wouldn't work as we expected.

## 📄️ Cracking the Interview Code

- \[ \] 1.1 Implement an algorithm to determine if a string has all unique characters.What if you can not use additional data structures?

## 📄️ Queue

What is Queue? Queue is easier to understand compared to Stack, we see queues all the time in real world scenarios, like Queue of people for a movie or a bank. Generally it is a First Come First Serve, you aren't going to let in the movie house the last person that arrives right.

## 📄️ Disjoint Group

Save disjoint set group algorithm here

## 📄️ Learnings

- int\[\] test = new int\[1\]; test\[0\]++ -> will alter the value in the array

## 📄️ Learnings

- Always handle edge cases

## 📄️ MERGE SÖRT

## Excerpt

## 📄️ KVICK SÖRT

Quicksort is an efficient sorting algorithm based on a “divide and conquer” approach. Choosing the dividing element at random is a good strategy to avoid bad worst-case runtime.

## 📄️ Window Sliding Technique - GeeksforGeeks

This technique shows how a nested for loop in some problems can be converted to a single for loop to reduce the time complexity.