Apr 2 · 4 min read · Yesterday I read the 1986 backpropagation paper. Today I turned it into code. 58 lines of Python. No PyTorch. No TensorFlow. Just NumPy and the raw math from the paper. Here is every line explained so
Join discussionJan 17 · 3 min read · Problem You are given an array nums consisting of non-negative integers. You are also given a queries array, where queries[i] = [x<sub>i</sub>, m<sub>i</sub>]. (link) The answer to the i<sup>th</sup> query is the maximum bitwise XOR value of x<sub>i<...
Join discussionJan 15 · 2 min read · Problem Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n. (link) Example 1: Input: nums = [3,10,5,25,2,8] Output: 28 Explanation: The maximum result is 5 XOR 25 = 28. Example 2: Input: nums = [14,7...
Join discussionJan 9 · 6 min read · Bảng Giá Tham Khảo & Những Yếu Tố Quyết Định Giá Trị Thực Trong phân khúc công nghệ xa xỉ, điện thoại XOR là cái tên khiến nhiều người tò mò. Không quảng bá rầm rộ, không xuất hiện đại trà, nhưng XOR lại được giới doanh nhân và khách hàng cao cấp đặc...
Join discussion
Aug 26, 2025 · 2 min read · Introduction When we learn about swapping of 2 variables , we find 2 common methods -1. Using a temporary variable2. Using the xor trick #include <iostream> using namespace std; void swapWithTemp(int &x, int &y){ int temp = x; x = y; y =...
Join discussionJul 27, 2025 · 1 min read · In this challenge, we intercepted one of Cipher’s encrypted messages which supposedly contained details of their next target. The message was protected using a repeating-key XOR cipher. However, a critical mistake was made—every message from Cipher b...
Join discussion
