🟢 Easy 🧩 Pattern – Arrays and Hashmap Given an array of distinct integers and a target sum, return an array of unique pairs of numbers which add up to the target sum. Each pair should be represented as an array containing only two numbers. Example Solution
🔗LC169 🟢 Easy 🧩 Pattern – Arrays and Hashmap Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Example Solution
🟢 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