StandCon CTF Writeup
· ☕ 5 min read
Introduction This is our first CTF Competition hosted by n0h4ts. We managed to complete 3 challenges which was a decent accomplishment for our first attempt. This is a small writeup of the challenges that my team and I completed. Fetus Crypto A ROT encryption Featus Crypto was an easy one. The hint given had the keyword “ROT”, hinting at a ROT Cipher. There are many cipher decryptors online and this challenge was cracked quickly upon release.

Rust - Swap Numbers
· ☕ 3 min read · 🐺 Devoalda
Swapping 2 numbers without a temp variable

Rust Merge Sort
· ☕ 1 min read · 🐺 Devoalda
Merge Sort in Rust

Rust Binary Search
· ☕ 1 min read · 🐺 Devoalda
Binary Search in Rust

Mysterio
· ☕ 1 min read · 🐺 Devoalda
Desktop Screenshots

Leetcode - Build Array From Permutation (1920)
· ☕ 1 min read · ✍️ devoalda
Description Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. A zero-based permutation nums is an array of distinct integers from 0 to nums.length - 1 (inclusive). Example 1 2 3 4 5 6 Input: nums = [0,2,1,5,3,4] Output: [0,1,2,4,5,3] Explanation: The array ans is built as follows: ans = [nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]] = [nums[0], nums[2], nums[1], nums[5], nums[3], nums[4]] = [0,1,2,4,5,3] {: file="Input/Output”}

ARM Assembly - Hello World!
· ☕ 3 min read · ✍️ devoalda
Installation I’m using WSL to build and run the ARM assembly code, these are the installation packages I used: 1 sudo apt install gcc-arm-linux-gnueabi make git-core ncurses-dev qemu qemu-user {:file="Installation on Windows WSL”} Code Simple program to return a number to shell .global _start .section .text _start: mov r7, #0x1 @ System call number for exit (0x1) mov r0, #32 @ Exit code 32 (Returns 32 to the shell) swi 0 @ Software interrupt .