👋 Welcome — You've Landed on My Signature Page
Hey, I'm Brain Dump — software engineer at Unisala.com .
You're viewing my Signature, a space where I share what I'm learning, building, and thinking about — all in one place.
This is not a portfolio in the traditional sense — it's more like a public digital notebook. Every article, thread, or note you see here was written by me, mostly to document useful things and help others who are on the same path.
What You'll Find Here:
- ✍️ My thoughts on algorithms, systems, and software design
- 🧠 Insights from real-world engineering work
- 🔗 Direct links to every article I've published on Unisala
Signature of Brain Dump
EasyDesign Parking System (87.1%)Make Array Zero by Subtracting Equal Amounts (73.3%)Maximum Units on a Truck (74.3%)MediumLRU Cache (45.2%)Number of Islands (6
High Frequency Problems (Sorted by Frequency)https://unisala.com/llm/conversation/87DITfU?leafId=3676cfa1-37c8-4168-8211-df0cd93d07d7🟢 Easy Problems202. Happy
List of question to upgrade your javascript skill.3373. Maximize the Number of Target Nodes After Connecting Trees II2618. Check if Object Instance of Class2619
A example of linear regression:1.Statistical assumptions:Underlying trend is linearData deviations from predicted values are Gaussian.B/c above, MSE cost functi
Spiking Neurons vs traditional artificial neurons.Spiking neurons:Computational neuron models that mimic the biological neurons more closely than traditional ar
🌊 The ProblemWe have a 2D map grid filled with '1's land and '0's water. An island is a group of connected '1's (horizontally or verti
Given the roots of two binary trees p and q, return true if the trees are equivalent, otherwise return false.Two binary trees
This problem check if a certain part of a tree is same tree as a given subtree.So before we solve this problem, we need to know how to check if two trees are sa
Binary search tree is great for searching or comparing things?We know using a hash-table we have O(1) for look up, then why study Binary Search Tree?Why is this
Given a binary tree, return true if it is height-balanced and false otherwise.A height-balanced binary tree is defined a
Maximum Depth (Height):Performance Indicator Tells you how efficient your BST operations will beOperations like search, insert, delete take O(h) time, where h i
When the game is over, the King and the pawn go in the same box.
Let me try a different approach with a simpler example.Imagine counting down from 5 to 0:for (i=5; i>=0; i=i-1) { // do something } The loop needs to:Sta
What is Rust?Rust is a system programming language that focuses on speed, memory safety, and parallelism. It was developed by Mozilla and has been gaining popul
Imagine a social network like Facebook, every user is connected to their friends, who are connected to their friends, and so on. Or think about Google Maps navi
You are given an array of integers stones where stones[i] represents the weight of the ith stone.We want to run a simulation on th
You are given an array of distinct integers nums and a target integer target. Your task is to return a list of all unique combinat
Subsets: Given an array nums of unique integers, return all possible subsets of nums.The solution set must not contain duplic
Backtracking solves a similar problems as what dynamic programming solves. The only thing about backtracking is that we care about returning all of the solution
Why Do we Care about Binary Search Tree?It's a fundamental building block for databases and data structures used in Big Tech, Common interview question at tech
First before we looking into the problem, let's first understand the application why is this helpful?Real world ExampleCourse Prerequisites: Finding common prer
Given the roots of two binary trees p and q, return true if the trees are equivalent, otherwise return false.Two binary trees
decode(str) { const result = [] let i = 0 while (i < str.length) { const delimeter = str.indexOf('#', i) const length = str.substring(i, delimeter) const
Implement the Least Recently Used (LRU) cache class LRUCache. The class should support the following operationsLRUCache(int capacity) Initia
Easy (35/288)Two SumPalindrome NumberRoman to IntegerLongest Common PrefixValid ParenthesesMerge Two Sorted ListsRemove Duplicates from Sorted ArrayRemove Eleme
