From 4b3c6ba133d12234006995b4ce1b79403e5bb51d Mon Sep 17 00:00:00 2001
From: brendon <36212954+brendonmiranda@users.noreply.github.com>
Date: Thu, 31 Oct 2024 23:17:53 +0000
Subject: [PATCH] singly & doubly linked list

---
 README.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/README.md b/README.md
index 9a68c23..9e5d9b3 100644
--- a/README.md
+++ b/README.md
@@ -54,6 +54,10 @@ This repo register my evolution in the Cracking The Coding Interview book as I g
 
 [My Binary Search Implementation](https://github.com/brendonmiranda/CrackingTheCodingInterview/blob/main/src/main/java/cracking/the/code/interview/chapter4/BinarySearch.java)
 
+[My Singly Linked List Implementation](https://github.com/brendonmiranda/CrackingTheCodingInterview/blob/main/src/main/java/cracking/the/code/interview/chapter4/SinglyLinkedList.java)
+
+[My Doubly Linked List Implementation](https://github.com/brendonmiranda/CrackingTheCodingInterview/blob/main/src/main/java/cracking/the/code/interview/chapter4/DoublyLinkedList.java)
+
 # Chapter 5 | Bit Manipulation
 
 [**5.1** Insertion: You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j through i have enough space to fit all of M. That is, if M=10011, you can assume that there ate at least 5 bits between j and i. You would not, for example, have j=3 and i=2, because M could not fully fit between bit 3 and 2.](https://github.com/brendonmiranda/CrackingTheCodingInterview/blob/main/src/main/java/cracking/the/code/interview/chapter5/Question51.java)