performing bfs on tree to find closest leaf

using min heap to find k smallest pairs from two arrays

getting the parents map and doing BFS to get all nodes distance K

using bfs to clone the graph

sort by start time and check

similar to wordbreak, but sorting words

updating with time complexity

using bfs to find levels from beginword and dfs to find all paths possible

creating a freq map with DLL as value.

using deque to maintain maximum elements of a window

storing results of substring breaks in hashmap

number of distinct islands using direction to create a DFS path taken string

shifted array search using binary search

repeating array state after few iterations

using counters to decide state of tic tac toe