25:["$","title",null,{"children":"Data Structures and Algorithms Code Templates | Jon Sundin | Observable"}] 4b:[] 47:{"id":"f9f0c231ea8f850b","slug":"dsa-code-templates","title":"Data Structures and Algorithms Code Templates","thumbnail":"246515a7a1185c082304c6c6cd19e68d4ff1ea2e7f57d031a97e4dfec3cf278e","access_level":"public","create_time":"$D2023-10-27T20:22:49.686Z","update_time":"$D2023-10-27T20:28:58.958Z","view_time":null,"first_public_time":"$D2023-10-27T20:22:49.686Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"7b7f7fa7ca429840","login":"jmsundin","name":"Jon Sundin","avatar_url":"https://avatars-next.observableusercontent.com/6043a22ac664cd4184076efee342bd03ae711cd4d3bf18aa8ef6563f07039894","tier":"starter_2024","bio":"","followed_by_you":false,"follows_you":false},"version":23,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"008d4210803f5c62","login":"jmsundin","name":"Jon Sundin","avatar_url":"https://avatars-next.observableusercontent.com/6043a22ac664cd4184076efee342bd03ae711cd4d3bf18aa8ef6563f07039894","tier":null,"bio":"","followed_by_you":false,"follows_you":false}],"members":[{"type":"individual","id":"008d4210803f5c62","login":"jmsundin","name":"Jon Sundin","avatar_url":"https://avatars-next.observableusercontent.com/6043a22ac664cd4184076efee342bd03ae711cd4d3bf18aa8ef6563f07039894","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"titling":"auto","title":"Data Structures and Algorithms Code Templates","cells":[{"id":21,"value":"

Data Structures and Algorithms Code Templates

","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":0,"value":"\n

Two Pointers: One Input, Opposite Ends

\n      let fn = arr => {\n        let left = 0, ans = 0, right = arr.length - 1;\n\n        while (left < right) {\n          // do some logic here with left and right\n          if (CONDITION) {\n            left++;\n          } else {\n            right--;\n          }\n        }\n        return ans;\n      }\n    Two Pointers: Two Inputs, Exhaust Both\n\n      \n
\n    \nSliding Window
\n\n
\nBuild a Prefix Sum
\n\nlet fn = arr => {\n  let prefix = [arr[0]];\n  for (let i = 1; i < arr.length; i++) {\n    prefix.push(prefix[prefix.length - 1] + arr[i]);\n  }\n  \n  return prefix;\n}\n
\n\nEfficient String Building
\n\n  \n
\n\nLinked List: Fast and Slow Pointer
\n\n  \n
\n\nReversing a Linked List
\n\n\n
\n\nFind Number of Subarrays that Fit an Exact Criteria
\n\n\n
\n\n\nMonotonic Increasing Stack\n
\n\n\n
\n\n\nBinary Tree: DFS (recursive)\n
\n\n\n
\n\n\nBinary Tree: DFS (iterative)\n
\n\n\n
\n\n\nBinary Tree: BFS\n
\n\n\n
\n\n\nGraph: DFS (recursive)\n
\n\n\n
\n\nGraph: DFS (iterative
\n
\n\nGraph: BFS
\n
","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":18,"value":"Find Top K Elements with Heap
\n
","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":15,"value":"  Binary Search
\n  
","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":12,"value":" Binary Search: Duplicate Elements, Left-Most Insertion Point
\n    ","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"}],"files":"$W4b","stdlib":"1"}}
24:null