Hi,\n\nI have 11+ YOE and has been preparing for faang interviews from long time.\nSInce I have become rusty with DS and Algos, I\'m finding it hard and intimidating to remember so many patterns in all types of DS. For e.g. if we just consider Graph, below is list of different patterns:\n- Adj List\n- Adj Matrix\n- DFS\n- BFS\n- Union Find\n- Bipartite\n- Topological sort\n- MST\n- Dijstra\'s\n- Bellman Ford\n- And many more algos\n\nIf I plan to first learn the concept and then solve problems for each of them, it will take a month for me to just study graph.\n\nPlease help as I\'m getting overwhelmed day by day by the amount of things to study and remember of the interviews.

Hi,\n\nI have 11+ YOE and has been preparing for faang interviews from long time.\nSInce I have become rusty with DS and Algos, I\'m finding it hard and intimid