function-to-create-linked-list-of-all-the-nodes-at-each-depth-in-a-bst-bt

game-of-life-full-implementation-with-file-input

go-practice

google-drive-pdf-downloader-master

hash-table-with-chaining

hoaxshell

A Windows reverse shell payload generator and handler that abuses the http(s) protocol to establish a beacon-like reverse shell.

invisibilitycloak

Proof-of-concept obfuscation toolkit for C# post-exploitation tools

java-hello-world

josephus-problem-using-circular-linked-list

The Josephus problem is the following game: N people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After M passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. Thus, if M = 0 and N = 5, players are eliminated in order, and player 5 wins. If M = 1 and N = 5, the order of elimination is 2, 4, 1, 5.

jugaadu-flex

jugaadu-flex-2

jugaadu-gcr

libeom

An open source library for C

lime-rat

LimeRAT | Simple, yet powerful remote administration tool for Windows (RAT)

linkfinder

A python script that finds endpoints in JavaScript files

malware-collection

🔬Collection(-BIGGEST-) of malware, ransomware, RATs, botnets, stealers, etc.

mangle

Mangle is a tool that manipulates aspects of compiled executables (.exe or DLL) to avoid detection from EDRs

matrixmultiplication-pdc

max-heap-full-implementation

merge-sort-real-life-problem

A race is organized among N horses of a kingdom. Every horse has a velocity (in m/sec) that is denoted by an array Velocity [ ] where Velocity[i] represents the velocity of the ith horse. All the horses are standing at different starting positions. The starting points are in the same order as the order of horses in the velocity array. A horse who is standing at ith position is considered to be ahead of the horse who is standing at position j if and only if i>j. The finish line of the race is 1000000 meters ahead. Count the number of overtakes that will occur during the race. Note: Implement it by using merge sort Input: 3 2 1 4 Output: 3

mergesort-pdc

mergesorting-pdc

oop-in-cpp-assignments

ordered-circular-doubly-linked-list-with-iterator

ordered-doubly-linked-list-with-iterator

p2p-python

pimpmykali

Kali Linux Fixes for Newly Imported VM's

priv2admin

Exploitation paths allowing you to (mis)use the Windows Privileges to elevate your rights within the OS.

producthunt

pycdc

C++ python bytecode disassembler and decompiler