april leetcoding

Author: ramanaditya

leetcode/README.md

@@ -432,3 +432,6 @@
     | 4 | 622. | <span style="color:orange">Medium</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode/queue/design-circular-queue.py) |
     | 6 | 1551. | <span style="color:orange">Medium</span> | [Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/blob/main/leetcode/math/minimum-operations-to-make-array-equal.py) |
     | 7 | 1704. | <span style="color:green">Easy</span> | [Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode/string/determine-if-string-halves-are-alike.py) |
+    | 15 | 509. | <span style="color:green">Easy</span> | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode/array/fibonacci-number.py) |
+    | 18 | 19. | <span style="color:orange">Medium</span> | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode/linked-list/remove-nth-node-from-end-of-list/) |
+    | 20 | 589. | <span style="color:green">Easy</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/main/leetcode/tree/n-ary-tree-preorder-traversal.py) |