Be Brave

LeetCode - Problems - Algorithms - 1. Two Sum Problem Description 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 twice. You can return the answer in any order. Example 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1]..

LeetCode - Problems - Algorithms - 1646. Get Maximum in Generated Array Problem Description You are given an integer n. An array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i] = nums[i] when 2

LeetCode - Daily Challenge - Boats to Save People Problem Description The i-th person has weight people[i], and each boat can carry a maximum weight of limit. Each boat carries at most 2 people at the same time, provided the sum of the weight of those people is at the most limit. Return the minimum number of boats to carry every given person. (It is guaranteed each person can be carried by boat...

LeetCode - Daily Challenge - Add Two Numbers Problem Description You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. Example 1 : In..

LeetCode - Daily Challenge - Merge Sorted Array Problem Description Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has enough space (size that is equal to m + n) to hold additional elements from nums2. Example 1: Input: nums1 = [1,2,3,0,0,0], m =..

LeetCode - Problems - Algorithms - 1684. Count the Number of Consistent Strings Problem Description You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the string appear in the string allowed. Return the number of consistent strings in the array words. Example: Constraints: My Solution (Python) class Solution..

LeetCode - Problems - Algorithms - 1678. Goal Parser Interpretation Problem Description You own a Goal Parser that can interpret a string command. The command consists of an alphabet of "G", "()" and/or "(al)" in some order. The Goal Parser will interpret "G" as the string "G", "()" as the string "o", and "(al)" as the string "al". The interpreted strings are then concatenated in the original or..

LeetCode - Problems - Algorithms - 1603. Design Parking System Problem Description Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size. Implement the ParkingSystem class: ParkingSystem(int big, int medium, int small) Initialized object of the ParkingSystem class. The number of slots for e..

LeetCode - Problems - Algorithms - 1528. Shuffle String Problem Description Given a string s and an integer indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string. Return the shuffled string. Example: Constraints: My Solution (Python) class Solution(object): def restoreString(self, s, indices): """ :type s:..

LeetCode - Problems - Algorithms - 1512. Number of Good Pairs Problem Description Given an array of integers nums. A pair (i, j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example: Constraints: My Solution (Python) class Solution(object): def numIdenticalPairs(self, nums): """ :type nums: List[int] :rtype: int """ answer = 0 length = len(nums) for i in range..