🔗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
🟢 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
🔗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
🟢 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
Given an array of size n, find the majority element. The element that appears more than ⌊ n/2 ⌋ times in the array. Note: Input will be a non-empty and unsorted array. Example Solution Approach 1. Sorting On sorting the given array, the element occurring more than [n/2] times will… Read More »Majority Element in an Array – LeetCode