DSA — [Index]Tarun Jain·Follow1 min read·Sep 11, 2023--ListenShare· DS approach mind map — [Notes]· Complexity analysis | Analysis of the Algorithm — Index· Recursion· Two Pointer | Sliding window· Dynamic Programming | DP — [Index]· Tree — [Index]· Monotone | Monotonic Stacks· DAG = Tree?DS approach mind map — [Notes]DS approach mind map — [Notes]· #2 — Check constraints is very important · #5 → Dry run ∘ Develop/Memorize dry run framework for all kind of…tarunjain07.medium.comComplexity analysis | Analysis of the Algorithm — IndexComplexity | Asymptotic AnalysisAmortized complexity analysisTower of Hanoi complexity analysis — [Notes]Complexity analysis | Analysis of the Algorithm — Indextarunjain07.medium.comRecursionRecursion — [Index]Recursion — [Index]Recursion — [Index]tarunjain07.medium.comTwo Pointer | Sliding windowTwo Pointers — [Notes]· Important points · Types of Two Pointers · Sample Problem · Problems · 3.1 Collision · 3.2 Forward · 3.3 Parallel ·…tarunjain07.medium.comDynamic Programming | DP — [Index]Dynamic Programming | DP· Identification · Steps to solve a DP problem · DP patternstarunjain07.medium.comTree — [Index]Tree -[Index]Tree basics, terminologies and types of treetarunjain07.medium.comMonotone | Monotonic StacksMonotone|Monotonic StacksMonotonic stack is a data structure that is used to solve problems that involve finding the next greater or next…tarunjain07.medium.comDAG = Tree?DAG = Tree?Refer this link for all DSA articlestarunjain07.medium.com