Tutorials Bitwise Operations XOR is minimized for adjacent sorted elements Minimum XOR Pair Code : Minimum XOR Pair Dynamic Programming LIS using Trie Push DP vs Pull DP The Hardest Easy DP problem General Technqiues Answering Queries Offline with Sweepline Prologue to Smaller Sum Code : Prologue to Smaller Sum Balanced Parenthesis on Segments Balanced Substrings Code : Balanced Substrings Contribution Technique on Trees Quirks of Non Existent Map Elements Time Travel in Greedy Algorithms Time Travel Code : Time Travel Graphs Dijkstra in the streets, BFS in the sheets Math Count Arrays with Fixed Product Code : Count Arrays with Fixed Product Strings Extending Binary Strings with DP Unconstrained Binary Strings Code : Unconstrained Binary Strings No Consecutive Zeroes Code : No Consecutive Zeroes K Zero Stream Code : K Zero Stream K Zero Stream (Hard) Code : K Zero Stream (Hard) Trees DP on induced subgraphs of a tree Count Induced Subgraphs Code : Count Induced Subgraphs Induced Subgraphs with Fixed Degree Code : Induced Subgraphs with Fixed Degree Induced Subgraphs with Compressed Degree Code : Induced Subgraphs with Compressed Degree Prologue to Leaf Color Code : Prologue to Leaf Color DP on spanning subgraphs of a tree Count Spanning Subgraphs Code : Count Spanning Subgraphs Swap on Tree Code : Swap on Tree Sum of Degree Sum Code : Sum of Degree Sum DP on Trees Downward Path with Only Last Vertex Black Code : Downward Path with Only Last Vertex Black Paths with Terminal Black Vertices Code : Paths with Terminal Black Vertices The big idea behind Diameter of a Tree Timer on Trees Ancestor Relation Code : Ancestor Relation Subtree Size Code : Subtree Size Subtree Sum Code : Subtree Sum Max Sum on Downward Path Code : Max Sum on Downward Path Happy Life in University Code : Happy Life in University
