Update README.md organization (#9)

Author: ahcode0919

README.md

@@ -5,7 +5,7 @@
 Repository for examples of typical algorithm solutions and data structures in Javascript
 
 - [Freecodecamp - Javascript Algorithms & Data Structures](#freecodecamp-javascript-algorithms--data-structures)
-- [Leetcode](#leetcode)
+- [Algorithms](#algorithms)
 
 ## Freecodecamp: Javascript Algorithms & Data Structures
 
@@ -15,9 +15,9 @@ Algorithms from the Freecodecamp Javascript algorithms and data structures certi
 - [Intermediate Algorithms](./src/fcc-intermediate-algorithms/README.md)
 - [Algorithm Projects](./src/fcc-course-projects/README.md)
 
-## Leetcode
+## Algorithms
 
-- [Arrays](./src/leetcode/arrays/README.md)
+- [Arrays](./src/algorithms/arrays/README.md)
 
 ## Resources
 

src/leetcode/arrays/README.md renamed to src/algorithms/arrays/README.md

@@ -1,7 +1,7 @@
 # Arrays
 
-* [Merge Two Sorted Lists](#merge-two-sorted-lists)
-* [Two Sum](#two-sum)
+- [Merge Two Sorted Lists](#merge-two-sorted-lists)
+- [Two Sum](#two-sum)
 
 ## Merge Two Sorted Lists
 

src/leetcode/arrays/merge_two_sorted_lists.js renamed to src/algorithms/arrays/merge_two_sorted_lists.js

@@ -1,5 +1,4 @@
-
-export default function (nums, target) {
+export default function(nums, target) {
   const map = {};
 
   for (let i = 0; i < nums.length; i += 1) {

src/leetcode/arrays/two_sum.js renamed to src/algorithms/arrays/two_sum.js

@@ -1,4 +1,7 @@
-import { ListNode, mergeTwoLists } from '../../src/leetcode/arrays/merge_two_sorted_lists';
+import {
+  ListNode,
+  mergeTwoLists
+} from "../../src/algorithms/arrays/merge_two_sorted_lists";
 
 function createList(arr) {
   const head = new ListNode(arr[0]);
@@ -21,7 +24,7 @@ function getList(node) {
   return list;
 }
 
-test('should merge two arrays', () => {
+test("should merge two arrays", () => {
   const l1 = createList([1, 2, 5, 8]);
   const l2 = createList([2, 3, 4, 6]);
   const ans = getList(mergeTwoLists(l1, l2));

src/leetcode/README.md

@@ -0,0 +1,5 @@
+import twoSum from "../../src/algorithms/arrays/two_sum";
+
+test("should find sum", () => {
+  expect(twoSum([2, 7, 11, 15], 9)).toEqual([0, 1]);
+});