-
Blind-75 is a curated list of 75 LeetCode problems compiled by Yangshun Tay. The list can be accessed at this link. Initially, I solved each problem using a brute-force approach, which often resulted in a Time Limit Exceeded (TLE) error. Then, I solved each problem with an optimized method that was accepted on …
Read More -
Author: Sadman Kabir Soumik Original Two Sum Problem 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 …
Read More -
122.Best Time to Buy and Sell Stock II You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same …
Read More -
Combine two lists as a dictionary | dict(zip) Program 1keys = ['a', 'b', 'c'] 2values = [1, 2, 3] 3dictionary = dict(zip(keys, values)) 4print(dictionary) Output 1{'a': 1, 'b': 2, 'c': 3} Program 1keys = ('name', 'age', 'location') 2values = …
Read More -
Check Prime Number A prime number is a positive integer greater than 1 that has no positive integer divisors other than 1 and itself. For example, the first six prime numbers are 2, 3, 5, 7, 11, and 13. The number 6 is not a prime number because it has more than two positive integer divisors. In fact, the divisors of 6 …
Read More