🔗LC136 🟢 Easy 🧩 Pattern – XOR Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. Example Solution Bitwise XOR operator ^ is the only way to solve this question, personally, I don’t… Read More »Missing Number – 268
🔗LC136 🟢 Easy 🧩 Pattern – XOR, Hashmap Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Example Solution Bitwise XOR operator ^ is the only way to solve… Read More »Single Number – 136
Fibonacci – Iterative Solution Time Complexity: O(n) time, O(1) space Finds the nth Fibonacci number using iteration. Using a for loop we can get the n number by adding the previous numbers. Generate Fibonacci Series Time Complexity: O(n) time, O(n) space Generates the first n Fibonacci numbers: Fibonacci – Recursive… Read More »Fibonacci – Iterative vs Recursive JS
🟢 Easy 🧩 Pattern – Strings, Regex and Loops From the given string of Characters (can be a mix of numbers, alphabets, and other special characters), we need to find the sum of all numbers in the string. Examples JS Solution
🟢 Easy 🧩 Pattern – Strings and Loops From the given string of Characters (can be a mix of numbers, alphabets, and other special characters) and we need to find the maximum occurring character. Examples JS Solution
🔗LC977 🟢 Easy 🧩 Pattern – Arrays and Loops Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. Example Solution We use two pointers left and right and keep pushing the largest values first to the end… Read More »Squares of a Sorted Array – 977