"# LeetcodeSolutions"
Note: 17 : Backtracking, BFS, DFS
226: Simple recursion, 2 ways 206: recursive linkedlist 867 : Transpose of a matrix 98, 102, 104, 235, 105, 106, 108, 109, 230: tree
Bit Manipulation : https://youtu.be/NLKQEOgBAnw 2'c complement : https://youtu.be/4qH4unVtJkE
Bit related: 231, 326, 342, 461, 191, 190, 338, [371]- approach2 pending Left/Right Rotate bits https://youtu.be/S2yXCBu3NdQ Swap all odd and even bits https://youtu.be/GWLCF808oVI
Graph : 207, 210
Pending: 0312_burst_ballons, 1010, 0008, 1345, 160, 605. LRU cache and implement in 139, approach 2
new: 1935
Global Variable: https://www.w3schools.com/python/python_variables_global.asp
ASCII and Unicode: https://youtu.be/5aJKKgSEUnY https://youtu.be/I-pQH_krD0M https://youtu.be/ut74oHojxqo
Matrix Initialization in Python: https://www.geeksforgeeks.org/python-using-2d-arrays-lists-the-right-way/
Sort a List using Lambda Expression- Python https://youtu.be/zk15irJMms0
Dictionaries documentation: https://docs.python.org/3/library/collections.html Using sorted on dictionaries: https://towardsdatascience.com/sorting-a-dictionary-in-python-4280451e1637 https://stackoverflow.com/questions/20950650/how-to-sort-counter-by-value-python
Max Heap in Python https://www.geeksforgeeks.org/max-heap-in-python/ Heap queue (or heapq) in Python https://www.geeksforgeeks.org/heap-queue-or-heapq-in-python/ In Python, heapq.heapify() can turn nums into a heap in O(N) time. heappush, heappop -> O(n) get min and max -> O(1) Building a heap: https://www.geeksforgeeks.org/time-complexity-of-building-a-heap/ Understanding heap: 347
The Four Basic Properties of Logs
- log_b(x.y) = log_b(x) + log_b(y).
- log_b(x/y) = log_b(x) - log_b(y).
- log_b(x^n) = n.log_b(x).
- log_b(x) = log_a(x) / log_a(b).
Regex: 459. Repeated Substring Pattern (Pending basics)
https://www.geeksforgeeks.org/python-map-function/