diff --git a/.gradle/2.13/taskArtifacts/cache.properties b/.gradle/2.13/taskArtifacts/cache.properties
new file mode 100644
index 0000000..658ce6b
--- /dev/null
+++ b/.gradle/2.13/taskArtifacts/cache.properties
@@ -0,0 +1 @@
+#Mon Sep 19 21:18:32 MSK 2016
diff --git a/.gradle/2.13/taskArtifacts/cache.properties.lock b/.gradle/2.13/taskArtifacts/cache.properties.lock
new file mode 100644
index 0000000..aa9f492
Binary files /dev/null and b/.gradle/2.13/taskArtifacts/cache.properties.lock differ
diff --git a/.gradle/2.13/taskArtifacts/fileHashes.bin b/.gradle/2.13/taskArtifacts/fileHashes.bin
new file mode 100644
index 0000000..6097ec5
Binary files /dev/null and b/.gradle/2.13/taskArtifacts/fileHashes.bin differ
diff --git a/.gradle/2.13/taskArtifacts/fileSnapshots.bin b/.gradle/2.13/taskArtifacts/fileSnapshots.bin
new file mode 100644
index 0000000..92f511b
Binary files /dev/null and b/.gradle/2.13/taskArtifacts/fileSnapshots.bin differ
diff --git a/.gradle/2.13/taskArtifacts/taskArtifacts.bin b/.gradle/2.13/taskArtifacts/taskArtifacts.bin
new file mode 100644
index 0000000..0284964
Binary files /dev/null and b/.gradle/2.13/taskArtifacts/taskArtifacts.bin differ
diff --git a/README.txt b/README.txt
new file mode 100644
index 0000000..e69de29
diff --git a/build.gradle b/build.gradle
new file mode 100644
index 0000000..577517f
--- /dev/null
+++ b/build.gradle
@@ -0,0 +1,14 @@
+group 'myLibs'
+version '1.0-SNAPSHOT'
+
+apply plugin: 'java'
+
+sourceCompatibility = 1.5
+
+repositories {
+    mavenCentral()
+}
+
+dependencies {
+    testCompile group: 'junit', name: 'junit', version: '4.11'
+}
diff --git a/gradle/wrapper/gradle-wrapper.jar b/gradle/wrapper/gradle-wrapper.jar
new file mode 100644
index 0000000..ca78035
Binary files /dev/null and b/gradle/wrapper/gradle-wrapper.jar differ
diff --git a/gradle/wrapper/gradle-wrapper.properties b/gradle/wrapper/gradle-wrapper.properties
new file mode 100644
index 0000000..98ee258
--- /dev/null
+++ b/gradle/wrapper/gradle-wrapper.properties
@@ -0,0 +1,6 @@
+#Mon Sep 19 21:18:32 MSK 2016
+distributionBase=GRADLE_USER_HOME
+distributionPath=wrapper/dists
+zipStoreBase=GRADLE_USER_HOME
+zipStorePath=wrapper/dists
+distributionUrl=https\://services.gradle.org/distributions/gradle-2.13-bin.zip
diff --git a/gradlew b/gradlew
new file mode 100644
index 0000000..27309d9
--- /dev/null
+++ b/gradlew
@@ -0,0 +1,164 @@
+#!/usr/bin/env bash
+
+##############################################################################
+##
+##  Gradle start up script for UN*X
+##
+##############################################################################
+
+# Attempt to set APP_HOME
+# Resolve links: $0 may be a link
+PRG="$0"
+# Need this for relative symlinks.
+while [ -h "$PRG" ] ; do
+    ls=`ls -ld "$PRG"`
+    link=`expr "$ls" : '.*-> \(.*\)$'`
+    if expr "$link" : '/.*' > /dev/null; then
+        PRG="$link"
+    else
+        PRG=`dirname "$PRG"`"/$link"
+    fi
+done
+SAVED="`pwd`"
+cd "`dirname \"$PRG\"`/" >/dev/null
+APP_HOME="`pwd -P`"
+cd "$SAVED" >/dev/null
+
+APP_NAME="Gradle"
+APP_BASE_NAME=`basename "$0"`
+
+# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
+DEFAULT_JVM_OPTS=""
+
+# Use the maximum available, or set MAX_FD != -1 to use that value.
+MAX_FD="maximum"
+
+warn ( ) {
+    echo "$*"
+}
+
+die ( ) {
+    echo
+    echo "$*"
+    echo
+    exit 1
+}
+
+# OS specific support (must be 'true' or 'false').
+cygwin=false
+msys=false
+darwin=false
+nonstop=false
+case "`uname`" in
+  CYGWIN* )
+    cygwin=true
+    ;;
+  Darwin* )
+    darwin=true
+    ;;
+  MINGW* )
+    msys=true
+    ;;
+  NONSTOP* )
+    nonstop=true
+    ;;
+esac
+
+CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar
+
+# Determine the Java command to use to start the JVM.
+if [ -n "$JAVA_HOME" ] ; then
+    if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
+        # IBM's JDK on AIX uses strange locations for the executables
+        JAVACMD="$JAVA_HOME/jre/sh/java"
+    else
+        JAVACMD="$JAVA_HOME/bin/java"
+    fi
+    if [ ! -x "$JAVACMD" ] ; then
+        die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME
+
+Please set the JAVA_HOME variable in your environment to match the
+location of your Java installation."
+    fi
+else
+    JAVACMD="java"
+    which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
+
+Please set the JAVA_HOME variable in your environment to match the
+location of your Java installation."
+fi
+
+# Increase the maximum file descriptors if we can.
+if [ "$cygwin" = "false" -a "$darwin" = "false" -a "$nonstop" = "false" ] ; then
+    MAX_FD_LIMIT=`ulimit -H -n`
+    if [ $? -eq 0 ] ; then
+        if [ "$MAX_FD" = "maximum" -o "$MAX_FD" = "max" ] ; then
+            MAX_FD="$MAX_FD_LIMIT"
+        fi
+        ulimit -n $MAX_FD
+        if [ $? -ne 0 ] ; then
+            warn "Could not set maximum file descriptor limit: $MAX_FD"
+        fi
+    else
+        warn "Could not query maximum file descriptor limit: $MAX_FD_LIMIT"
+    fi
+fi
+
+# For Darwin, add options to specify how the application appears in the dock
+if $darwin; then
+    GRADLE_OPTS="$GRADLE_OPTS \"-Xdock:name=$APP_NAME\" \"-Xdock:icon=$APP_HOME/media/gradle.icns\""
+fi
+
+# For Cygwin, switch paths to Windows format before running java
+if $cygwin ; then
+    APP_HOME=`cygpath --path --mixed "$APP_HOME"`
+    CLASSPATH=`cygpath --path --mixed "$CLASSPATH"`
+    JAVACMD=`cygpath --unix "$JAVACMD"`
+
+    # We build the pattern for arguments to be converted via cygpath
+    ROOTDIRSRAW=`find -L / -maxdepth 1 -mindepth 1 -type d 2>/dev/null`
+    SEP=""
+    for dir in $ROOTDIRSRAW ; do
+        ROOTDIRS="$ROOTDIRS$SEP$dir"
+        SEP="|"
+    done
+    OURCYGPATTERN="(^($ROOTDIRS))"
+    # Add a user-defined pattern to the cygpath arguments
+    if [ "$GRADLE_CYGPATTERN" != "" ] ; then
+        OURCYGPATTERN="$OURCYGPATTERN|($GRADLE_CYGPATTERN)"
+    fi
+    # Now convert the arguments - kludge to limit ourselves to /bin/sh
+    i=0
+    for arg in "$@" ; do
+        CHECK=`echo "$arg"|egrep -c "$OURCYGPATTERN" -`
+        CHECK2=`echo "$arg"|egrep -c "^-"`                                 ### Determine if an option
+
+        if [ $CHECK -ne 0 ] && [ $CHECK2 -eq 0 ] ; then                    ### Added a condition
+            eval `echo args$i`=`cygpath --path --ignore --mixed "$arg"`
+        else
+            eval `echo args$i`="\"$arg\""
+        fi
+        i=$((i+1))
+    done
+    case $i in
+        (0) set -- ;;
+        (1) set -- "$args0" ;;
+        (2) set -- "$args0" "$args1" ;;
+        (3) set -- "$args0" "$args1" "$args2" ;;
+        (4) set -- "$args0" "$args1" "$args2" "$args3" ;;
+        (5) set -- "$args0" "$args1" "$args2" "$args3" "$args4" ;;
+        (6) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" ;;
+        (7) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" ;;
+        (8) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" ;;
+        (9) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" "$args8" ;;
+    esac
+fi
+
+# Split up the JVM_OPTS And GRADLE_OPTS values into an array, following the shell quoting and substitution rules
+function splitJvmOpts() {
+    JVM_OPTS=("$@")
+}
+eval splitJvmOpts $DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS
+JVM_OPTS[${#JVM_OPTS[*]}]="-Dorg.gradle.appname=$APP_BASE_NAME"
+
+exec "$JAVACMD" "${JVM_OPTS[@]}" -classpath "$CLASSPATH" org.gradle.wrapper.GradleWrapperMain "$@"
diff --git a/gradlew.bat b/gradlew.bat
new file mode 100644
index 0000000..832fdb6
--- /dev/null
+++ b/gradlew.bat
@@ -0,0 +1,90 @@
+@if "%DEBUG%" == "" @echo off
+@rem ##########################################################################
+@rem
+@rem  Gradle startup script for Windows
+@rem
+@rem ##########################################################################
+
+@rem Set local scope for the variables with windows NT shell
+if "%OS%"=="Windows_NT" setlocal
+
+set DIRNAME=%~dp0
+if "%DIRNAME%" == "" set DIRNAME=.
+set APP_BASE_NAME=%~n0
+set APP_HOME=%DIRNAME%
+
+@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
+set DEFAULT_JVM_OPTS=
+
+@rem Find java.exe
+if defined JAVA_HOME goto findJavaFromJavaHome
+
+set JAVA_EXE=java.exe
+%JAVA_EXE% -version >NUL 2>&1
+if "%ERRORLEVEL%" == "0" goto init
+
+echo.
+echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
+echo.
+echo Please set the JAVA_HOME variable in your environment to match the
+echo location of your Java installation.
+
+goto fail
+
+:findJavaFromJavaHome
+set JAVA_HOME=%JAVA_HOME:"=%
+set JAVA_EXE=%JAVA_HOME%/bin/java.exe
+
+if exist "%JAVA_EXE%" goto init
+
+echo.
+echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME%
+echo.
+echo Please set the JAVA_HOME variable in your environment to match the
+echo location of your Java installation.
+
+goto fail
+
+:init
+@rem Get command-line arguments, handling Windows variants
+
+if not "%OS%" == "Windows_NT" goto win9xME_args
+if "%@eval[2+2]" == "4" goto 4NT_args
+
+:win9xME_args
+@rem Slurp the command line arguments.
+set CMD_LINE_ARGS=
+set _SKIP=2
+
+:win9xME_args_slurp
+if "x%~1" == "x" goto execute
+
+set CMD_LINE_ARGS=%*
+goto execute
+
+:4NT_args
+@rem Get arguments from the 4NT Shell from JP Software
+set CMD_LINE_ARGS=%$
+
+:execute
+@rem Setup the command line
+
+set CLASSPATH=%APP_HOME%\gradle\wrapper\gradle-wrapper.jar
+
+@rem Execute Gradle
+"%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" org.gradle.wrapper.GradleWrapperMain %CMD_LINE_ARGS%
+
+:end
+@rem End local scope for the variables with windows NT shell
+if "%ERRORLEVEL%"=="0" goto mainEnd
+
+:fail
+rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of
+rem the _cmd.exe /c_ return code!
+if  not "" == "%GRADLE_EXIT_CONSOLE%" exit 1
+exit /b 1
+
+:mainEnd
+if "%OS%"=="Windows_NT" endlocal
+
+:omega
diff --git a/settings.gradle b/settings.gradle
new file mode 100644
index 0000000..bae8af6
--- /dev/null
+++ b/settings.gradle
@@ -0,0 +1,2 @@
+rootProject.name = 'myCollections'
+
diff --git a/src/main/java/ru/spbau/lobanov/collections/MyHashMap.java b/src/main/java/ru/spbau/lobanov/collections/MyHashMap.java
new file mode 100644
index 0000000..e7a5807
--- /dev/null
+++ b/src/main/java/ru/spbau/lobanov/collections/MyHashMap.java
@@ -0,0 +1,136 @@
+package ru.spbau.lobanov.collections;
+
+public class MyHashMap {
+
+    private static class Entry<K, V> {
+        final K key;
+        final int hash;
+        V value;
+
+        Entry(K key, V value) {
+            this.key = key;
+            this.value = value;
+            this.hash = key.hashCode();
+        }
+
+        @Override
+        public boolean equals(Object obj) {
+            if (obj.getClass() != Entry.class) return false;
+            Entry another = (Entry) obj;
+            return hash == another.hash && key.equals(another.key);
+        }
+
+        @Override
+        public int hashCode() {
+            return hash;
+        }
+    }
+
+
+    public static final double DEFAULT_LOAD_FACTOR = 0.75;
+    public static final int DEFAULT_INITIAL_SIZE = 256;
+
+    private int size;
+    private MyLinkedList<Entry<String, String>>[] table;
+    private final double loadFactor;
+
+    public MyHashMap(int initialSize, double loadFactor) {
+        if (Double.isNaN(loadFactor) || loadFactor <= 0 || initialSize < 0)
+            throw new IllegalArgumentException();
+        this.loadFactor = loadFactor;
+        table = new MyLinkedList[initialSize];
+        for (int i = 0; i < initialSize; i++) {
+            table[i] = new MyLinkedList<>();
+        }
+    }
+
+    public MyHashMap(int initialSize) {
+        this(initialSize, DEFAULT_LOAD_FACTOR);
+    }
+
+    public MyHashMap(double loadFactor) {
+        this(DEFAULT_INITIAL_SIZE, loadFactor);
+    }
+
+    public MyHashMap() {
+        this(DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR);
+    }
+
+    private void rebuild() {
+        MyLinkedList<Entry<String, String>>[] oldTable = table;
+        table = new MyLinkedList[table.length * 2];
+        for (int i = 0; i < table.length; i++) {
+            table[i] = new MyLinkedList<>();
+        }
+        size = 0;
+        for (MyLinkedList<Entry<String, String>> list : oldTable) {
+            MyLinkedList.ListIterator<Entry<String, String>> iterator = list.iterator();
+            while (iterator.hasNext()) {
+                addEntry(iterator.next());
+            }
+        }
+    }
+
+    private void validate() {
+        if (size >= table.length * loadFactor) {
+            rebuild();
+        }
+
+    }
+
+    private void addEntry(Entry<String, String> entry) {
+        table[getIndex(entry.hash)].addFirst(entry);
+        size++;
+    }
+
+    private int getIndex(int hash) {
+        return Math.abs(hash % table.length);
+    }
+
+    public int size() {
+        return size;
+    }
+
+    public boolean contains(String key) {
+        Entry<String, String> template = new Entry<>(key, null);
+        return table[getIndex(template.hash)].find(template) != null;
+    }
+
+    public String get(String key) {
+        Entry<String, String> template = new Entry<>(key, null);
+        Entry<String, String> entry = table[getIndex(template.hash)].find(template);
+        return entry == null? null : entry.value;
+    }
+
+    public String put(String key, String value) {
+        Entry<String, String> template = new Entry<>(key, null);
+        Entry<String, String> entry = table[getIndex(template.hash)].find(template);
+        if (entry == null) {
+            table[getIndex(template.hash)].addFirst(template);
+            entry = template;
+            size++;
+            validate();
+        }
+        String oldValue = entry.value;
+        entry.value = value;
+        return oldValue;
+    }
+
+    public String remove(String key) {
+        Entry<String, String> template = new Entry<>(key, null);
+        Entry<String, String> entry = table[getIndex(template.hash)].find(template);
+        if (entry == null) {
+            return null;
+        }
+        table[getIndex(template.hash)].remove(template);
+        size--;
+        return entry.value;
+    }
+
+    public void clear() {
+        for (MyLinkedList<Entry<String, String>> list : table) {
+            list.clear();
+        }
+        size = 0;
+    }
+}
\ No newline at end of file
diff --git a/src/main/java/ru/spbau/lobanov/collections/MyLinkedList.java b/src/main/java/ru/spbau/lobanov/collections/MyLinkedList.java
new file mode 100644
index 0000000..42d6161
--- /dev/null
+++ b/src/main/java/ru/spbau/lobanov/collections/MyLinkedList.java
@@ -0,0 +1,92 @@
+package ru.spbau.lobanov.collections;
+
+public class MyLinkedList<E> { // implements Iterable<E>, is Iterable a part of std lib?
+    private static class Node<E> {
+
+        E value;
+        Node<E> next;
+        Node(E value) {
+            this.value = value;
+        }
+
+    }
+
+    public static class ListIterator<E> { // implements Iterator<E>, is Iterator a part of std lib?
+        private Node<E> next;
+
+        private ListIterator(Node<E> next) {
+            this.next = next;
+        }
+
+        public boolean hasNext() {
+            return next != null;
+        }
+
+        public E next() {
+            E value = next.value;
+            next = next.next;
+            return value;
+        }
+    }
+
+    private Node<E> head;
+
+    private int size;
+    public MyLinkedList() {}
+
+    public void addFirst(E object) {
+        Node<E> tmp = head;
+        head = new Node<>(object);
+        head.next = tmp;
+        size++;
+    }
+
+    private boolean equals(E first, E second) {
+        if (first == null)
+            return second == null;
+        return first.equals(second);
+    }
+
+    public E find(E value) {
+        Node<E> current = head;
+        while (current != null) {
+            if (equals(value, current.value))
+                return current.value;
+            current = current.next;
+        }
+        return null;
+    }
+
+    public boolean remove(E value) {
+        Node<E> previous = null;
+        Node<E> current = head;
+        while (current != null) {
+            if (equals(value, current.value)) {
+                if (previous == null) {
+                    head = current.next;
+                } else {
+                    previous.next = current.next;
+                }
+                size--;
+                return true;
+            }
+            previous = current;
+            current = current.next;
+        }
+        return false;
+    }
+
+    public int size() {
+        return size;
+    }
+
+    public void clear() {
+        head = null;
+        size = 0;
+    }
+
+    public ListIterator<E> iterator() {
+        return new ListIterator<>(head);
+    }
+
+}
diff --git a/src/test/java/ru/spbau/lobanov/collections/MyHashMapTest.java b/src/test/java/ru/spbau/lobanov/collections/MyHashMapTest.java
new file mode 100644
index 0000000..6e7154e
--- /dev/null
+++ b/src/test/java/ru/spbau/lobanov/collections/MyHashMapTest.java
@@ -0,0 +1,106 @@
+package ru.spbau.lobanov.collections;
+
+import org.junit.Test;
+
+import static org.junit.Assert.*;
+import static org.junit.Assert.assertEquals;
+
+public class MyHashMapTest {
+    @Test
+    public void size() throws Exception {
+        MyHashMap map = new MyHashMap();
+        for (int i = 0; i < 512; i++) {
+            map.put("key" + i, "value" + i);
+        }
+        assertEquals(512, map.size());
+        for (int i = 0; i < 512; i += 2) {
+            map.remove("key" + i);
+        }
+        assertEquals(256, map.size());
+        for (int i = 1; i < 512; i += 2) {
+            map.put("key" + i, "value" + i);
+        }
+        assertEquals(256, map.size());
+        map.clear();
+        assertEquals(0, map.size());
+    }
+
+    @Test
+    public void contains() throws Exception {
+        MyHashMap map = new MyHashMap();
+        for (int i = 0; i < 512; i++) {
+            map.put("key" + i, "value" + i);
+            assertTrue(map.contains("key" + i));
+        }
+
+        for (int i = 0; i < 512; i += 2) {
+            map.remove("key" + i);
+            assertFalse(map.contains("key" + i));
+        }
+        for (int i = 1; i < 512; i += 2) {
+            assertTrue(map.contains("key" + i));
+        }
+        map.clear();
+        for (int i = 0; i < 512; i++) {
+            assertFalse(map.contains("key" + i));
+        }
+    }
+
+    @Test
+    public void get() throws Exception {
+        MyHashMap map = new MyHashMap();
+        for (int i = 0; i < 512; i++) {
+            map.put("key" + i, "value" + i);
+        }
+        for (int i = 0; i < 512; i ++) {
+            assertEquals("value" + i, map.get("key" + i));
+        }
+        for (int i = 1; i < 512; i += 2) {
+            map.put("key" + i, "newValue" + i);
+        }
+        for (int i = 0; i < 512; i += 2) {
+            assertEquals((i % 2 == 1? "newV" : "v") + "alue" + i, map.get("key" + i));
+        }
+        map.clear();
+        for (int i = 0; i < 512; i ++) {
+            assertSame(null, map.get("key" + i));
+        }
+    }
+
+    @Test
+    public void put() throws Exception {
+        MyHashMap map = new MyHashMap();
+        for (int i = 0; i < 512; i++) {
+            map.put("key" + (i % 30), "value" + i);
+            assertEquals("value" + i, map.get("key" + (i % 30)));
+        }
+    }
+
+    @Test
+    public void remove() throws Exception {
+        MyHashMap map = new MyHashMap();
+        for (int i = 0; i < 512; i++) {
+            map.put("key" + i, "value" + i);
+        }
+        for (int i = 0; i < 512; i += 2) {
+            map.remove("key" + i);
+        }
+        for (int i = 0; i < 512; i ++) {
+            assertEquals(i % 2 != 0, map.contains("key" + i));
+        }
+    }
+
+    @Test
+    public void clear() throws Exception {
+        MyHashMap map = new MyHashMap();
+        for (int i = 0; i < 512; i++) {
+            map.put("key" + i, "value" + i);
+        }
+        map.clear();
+        assertEquals(0, map.size());
+        for (int i = 0; i < 512; i ++) {
+            assertSame(null, map.get("key" + i));
+        }
+    }
+
+}
\ No newline at end of file
diff --git a/src/test/java/ru/spbau/lobanov/collections/MyLinkedListTest.java b/src/test/java/ru/spbau/lobanov/collections/MyLinkedListTest.java
new file mode 100644
index 0000000..f1696dc
--- /dev/null
+++ b/src/test/java/ru/spbau/lobanov/collections/MyLinkedListTest.java
@@ -0,0 +1,97 @@
+package ru.spbau.lobanov.collections;
+
+import org.junit.Test;
+
+
+import static org.junit.Assert.*;
+import static org.junit.Assert.assertEquals;
+
+
+public class MyLinkedListTest {
+    @Test
+    public void addFirst() throws Exception {
+        MyLinkedList<Integer> list = new MyLinkedList<>();
+        for (int i = 255; i >= 0; i--) {
+            list.addFirst(i);
+        }
+        MyLinkedList.ListIterator<Integer> iterator = list.iterator();
+        for (int i = 0; i < 256; i++) {
+            assertTrue(iterator.hasNext());
+            assertEquals((Integer) i, iterator.next());
+        }
+        assertFalse(iterator.hasNext());
+    }
+
+    @Test
+    public void find() throws Exception {
+        MyLinkedList<Integer> list = new MyLinkedList<>();
+        for (int i = 255; i >= 0; i--) {
+            list.addFirst(i);
+        }
+        for (int i = 0; i < 256; i++) {
+            assertEquals((Integer) i, list.find(i));
+        }
+    }
+
+    @Test
+    public void remove() throws Exception {
+        MyLinkedList<Integer> list = new MyLinkedList<>();
+        for (int i = 255; i >= 0; i--) {
+            list.addFirst(i);
+        }
+        for (int i = 0; i < 256; i += 2) {
+            list.remove(i);
+            assertNull(list.find(i));
+        }
+        for (int i = 1; i < 256; i += 2) {
+            assertEquals((Integer) i, list.find(i));
+        }
+    }
+
+    @Test
+    public void size() throws Exception {
+        MyLinkedList<Integer> list = new MyLinkedList<>();
+        assertEquals(0, list.size());
+        for (int i = 0; i < 256; i++) {
+            list.addFirst(i);
+            assertEquals(i + 1, list.size());
+        }
+        for (int i = 0; i < 128; i++) {
+            list.remove(i);
+            assertEquals(256 - i - 1, list.size());
+        }
+        list.clear();
+        assertEquals(0, list.size());
+    }
+
+    @Test
+    public void clear() throws Exception {
+        MyLinkedList<Integer> list = new MyLinkedList<>();
+        for (int i = 0; i < 256; i++) {
+            list.addFirst(i);
+        }
+        list.clear();
+        for (int i = 0; i < 256; i++) {
+            assertNull(list.find(i));
+        }
+        assertEquals(0, list.size());
+    }
+
+    @Test
+    public void iterator() throws Exception {
+        MyLinkedList<Integer> list = new MyLinkedList<>();
+        for (int i = 255; i >= 0; i--) {
+            list.addFirst(i);
+        }
+        for (int i = 0; i < 256; i += 2) {
+            list.remove(i);
+        }
+        MyLinkedList.ListIterator<Integer> iterator = list.iterator();
+        for (int i = 1; i < 256; i += 2) {
+            assertTrue(iterator.hasNext());
+            assertEquals((Integer) i, iterator.next());
+        }
+        assertFalse(iterator.hasNext());
+    }
+
+}
\ No newline at end of file