feat(528-swapping-nodes-in-a-ll): add py3 optimal solution

2022-04-04 23:14:20 +05:30
parent 2c0614e7df
commit 0730125496
2 changed files with 39 additions and 0 deletions
--- a/notes/linked_lists.md
+++ b/notes/linked_lists.md
@@ -0,0 +1,14 @@
+---
+category: ds
+title: Linked Lists
+---
+
+# Linked Lists
+
+## Finding nth node from beginning and nth node from end
+
+Use two pointer approach to avoid extra space. Initialize the `kth_node_from_end` pointer when the `tmp` pointer reaches `kth` node and keep incrementing from there on.
+
+### Related problems
+
+- https://leetcode.com/problems/swapping-nodes-in-a-linked-list