https://blog.sksoumik.com/tags/problem-solving/ Recent content in problem solving on Sadman Kabir Soumik Hugo -- gohugo.io en Copyright © 2022, Sadman Kabir Soumik Sun, 26 Feb 2023 00:00:00 +0000 https://blog.sksoumik.com/software-engineering/optimized-python-solutions-blind-75-leetcode/ Sun, 26 Feb 2023 00:00:00 +0000 https://blog.sksoumik.com/software-engineering/optimized-python-solutions-blind-75-leetcode/ 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 LeetCode. For every problem on the list, I have provided both the naive brute force solution and an optimized solution. https://blog.sksoumik.com/software-engineering/all-leetcode-two-sum-problem-variations-with-python-solutions/ Fri, 21 Oct 2022 00:00:00 +0000 https://blog.sksoumik.com/software-engineering/all-leetcode-two-sum-problem-variations-with-python-solutions/ 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 order. 1Example 1: 2Input: nums = [2,7,11,15], target = 9 3Output: [0,1] 4Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]. https://blog.sksoumik.com/software-engineering/best_time_to_buy_all_sell_stocks_all_problems/ Wed, 15 Jun 2022 00:00:00 +0000 https://blog.sksoumik.com/software-engineering/best_time_to_buy_all_sell_stocks_all_problems/ 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 day. Find and return the maximum profit you can achieve. https://blog.sksoumik.com/software-engineering/python-code-snippets-tricks-tips/ Sun, 27 Jun 2021 00:00:00 +0000 https://blog.sksoumik.com/software-engineering/python-code-snippets-tricks-tips/ 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 = ('Soumik', 26, 'Bangladesh') 3 4new_dict = dict(zip(keys, values)) 5print(new_dict) Output 1# output 2{'name' : 'Soumik', 'age' : 26, 'location' : 'Bangladesh'} Create nested directory Program 1from pathlib import Path 2 3Path("father/child").mkdir(parents=True, exist_ok=True) We can also the os module. https://blog.sksoumik.com/software-engineering/understanding-graph-traversal-bfs-dfs/ Tue, 12 Mar 2019 00:00:00 +0000 https://blog.sksoumik.com/software-engineering/understanding-graph-traversal-bfs-dfs/ Breadth-first search (BFS) and depth-first search (DFS) are two algorithms for traversing graphs. These algorithms are used to search for specific nodes or to find the shortest path between two nodes in a graph. BFS The breadth-first search (BFS) algorithm is a graph traversal algorithm that explores all of the neighbors of a starting node before moving on to any of the neighbor's neighbors. It is called a "breadth-first" algorithm because it explores the neighbors at each level of the graph before moving on to the next level. https://blog.sksoumik.com/software-engineering/basic_coding_problems_that_you_must_know_as_a_cse_graduate/ Fri, 22 Feb 2019 00:00:00 +0000 https://blog.sksoumik.com/software-engineering/basic_coding_problems_that_you_must_know_as_a_cse_graduate/ 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 are 1, 2, 3, and 6. To determine if a number is prime, you can check if it has any positive integer divisors other than 1 and itself.