🔗LC1 🟢 Easy 🧩 Pattern – Hashtable and Array Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element… Read More »Two Sum – LC1 JS Solution
🔗LC150 🟡 Medium 🧩 Pattern – Stack You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation. Evaluate the expression. Return an integer that represents the value of the expression. Note that: Example Solution We use a stack to keep track of… Read More »Evaluate Reverse Polish Notation – 150
🟢 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
🔗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