✨ [q5/restruct]

Author: enkr1

1/README.md

@@ -0,0 +1,34 @@
+https://leetcode.com/problems/two-sum/
+
+Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
+
+You may assume that each input would have exactly one solution, and you may not use the same element twice.
+
+You can return the answer in any order.
+
+
+
+Example 1:
+
+Input: nums = [2,7,11,15], target = 9
+Output: [0,1]
+Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
+Example 2:
+
+Input: nums = [3,2,4], target = 6
+Output: [1,2]
+Example 3:
+
+Input: nums = [3,3], target = 6
+Output: [0,1]
+
+
+Constraints:
+
+2 <= nums.length <= 104
+-109 <= nums[i] <= 109
+-109 <= target <= 109
+Only one valid answer exists.
+
+
+Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

1_two_sum/solution.ex 1/solution.ex

@@ -0,0 +1,29 @@
+https://leetcode.com/problems/add-two-numbers/
+
+You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
+
+You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+
+
+
+Example 1:
+
+
+Input: l1 = [2,4,3], l2 = [5,6,4]
+Output: [7,0,8]
+Explanation: 342 + 465 = 807.
+Example 2:
+
+Input: l1 = [0], l2 = [0]
+Output: [0]
+Example 3:
+
+Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
+Output: [8,9,9,9,0,0,0,1]
+
+
+Constraints:
+
+The number of nodes in each linked list is in the range [1, 100].
+0 <= Node.val <= 9
+It is guaranteed that the list represents a number that does not have leading zeros.

1_two_sum/solution.js 1/solution.js

@@ -0,0 +1,21 @@
+https://leetcode.com/problems/longest-palindromic-substring/
+
+Given a string s, return the longest
+palindromic substring in s.
+
+
+Example 1:
+
+Input: s = "babad"
+Output: "bab"
+Explanation: "aba" is also a valid answer.
+Example 2:
+
+Input: s = "cbbd"
+Output: "bb"
+
+
+Constraints:
+
+1 <= s.length <= 1000
+s consist of only digits and English letters.

2/README.md

@@ -0,0 +1,11 @@
+/**
+ * @param {string} s
+ * @return {string}
+ */
+const longestPalindrome = (s) => {
+  console.log(`input: ${s}`)
+  let P = [], center = 0, maxRight = 0;
+  console.log(`P: ${P}, c: ${center}, right: ${maxRight}`)
+};
+
+longestPalindrome("NBNNBR")

2_add_two_numbers/solution.ex 2/solution.ex

@@ -1,7 +1,22 @@
-# How to run?
-Simply run iex `filename`.
+# Leetcode Solutions
 
-For example:
+1. [Two Sum](./1/)
+2. [Add Two Numbers](./2/)
+3. -
+4. -
+5. [Longest Palindromic Substring](./5/)
+
+---
+## Run for JS
+```sh
+node ./.../solution.js
+```
+
+---
+
+## Run for Elixir
 ```sh
-iex ./leetcode_practices/q1_two_sum.ex
+iex ./.../solution.ex
 ```
+
+---