Algorithms, Data Structures, Competitive Coding, and problems from LeetCode with complete Solution Approach, Pseudocode, and Explanation.
🟢 Easy 🧩 Pattern – Arrays Given an array which contains even and odd numbers, we need to seperate them by putting the odd numbers first followed by the even numbers. Example Solution The oddPointer variable is used to keep track of the index where the next odd number should… Read More »Separate Even and Odd numbers in an array
🟢 Easy 🧩 Pattern – Arrays Given an array which contains only zeroes and ones, we need to seperate them by putting the zeroes first followed by the ones. Example Solution The zeroPointer variable is used to keep track of the index where the next zero should be placed.
🔗LC242 🟢 Easy 🧩 Pattern – Strings Given two strings s and t, return true if t is an of s, and false otherwise. Two strings are said to be anagrams if they contain same nuumber of characters in both of them, angrams are popular as puzzles and to hide… Read More »Valid Anagram – 242
🔗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