Skip to content

Instantly share code, notes, and snippets.

View cod3smith's full-sized avatar
🤩
Always Be Coding, Always Be Learning

Kelyn Paul Njeri cod3smith

🤩
Always Be Coding, Always Be Learning
107 followers · 96 following
View GitHub Profile
@cod3smith
cod3smith / symmetric_encryption.py
Last active June 8, 2023 06:12
from Crypto.Cipher import AES
import os
encryption_key = os.urandom(16)
def encrypt_AES(key, data):
cipher = AES.new(key, AES.MODE_ECB)
return cipher.encrypt(data)
def decrypt_AES(key, encrypted_data):
@cod3smith
cod3smith / circular_linked_list.go
Created June 6, 2023 18:23
package main
import "fmt"
type Node struct {
data interface{}
next *Node
}
type CircularLinkedList struct {
@cod3smith
cod3smith / circular_linked_list.py
Created June 6, 2023 18:22
class Node:
def __init__(self, data):
self.data = data
self.next = None
class CircularLinkedList:
def __init__(self):
self.head = None
def is_empty(self):
@cod3smith
cod3smith / doubly_linked_list.go
Created June 6, 2023 18:20
package main
import "fmt"
type Node struct {
data interface{}
prev *Node
next *Node
}
@cod3smith
cod3smith / doubly_linked_list.py
Created June 6, 2023 18:18
class Node:
def __init__(self, data):
self.data = data
self.prev = None
self.next = None
class DoublyLinkedList:
def __init__(self):
self.head = None
@cod3smith
cod3smith / singly_linked_list.go
Created June 6, 2023 18:13
package main
import "fmt"
type Node struct {
data interface{}
next *Node
}
type SinglyLinkedList struct {
@cod3smith
cod3smith / singly_linked_list.py
Created June 6, 2023 18:11
class Node:
def __init__(self, data):
self.data = data
self.next = None
class SinglyLinkedList:
def __init__(self):
self.head = None
def is_empty(self):
@cod3smith
cod3smith / deque.go
Created June 6, 2023 13:38
package main
type Deque struct {
items []interface{}
}
func NewDeque() *Deque {
return &Deque{
items: make([]interface{}, 0),
}
@cod3smith
cod3smith / deque.py
Created June 6, 2023 13:36
from collections import deque
class Deque:
def __init__(self):
self.items = deque()
def add_front(self, item):
self.items.appendleft(item)
def add_rear(self, item):
@cod3smith
cod3smith / priority_queue.go
Created June 6, 2023 13:34
package main
import "container/heap"
type Item struct {
value interface{}
priority int
index int
}