GitHub | LinkedIn | Email | Telegram | Mobile: +998935820828
I am an experienced backend software engineer with a strong focus on developing backend services for various industries such as online media, medicine, e-commerce, and more. My passion lies in automating processes to streamline business operations and enhance efficiency.
SKILLS
| from typing import List | |
| from collections import defaultdict | |
| class Solution: | |
| def rob(self, nums: List[int]) -> int: | |
| N = len(nums) | |
| is_exists_cache = defaultdict(bool) | |
| cache_for_robbing = defaultdict(int) | |
| def rob_houses(index, sz): |
| public class MiniMaxSum { | |
| public static void main(String args[]) | |
| { | |
| Scanner in = new Scanner(System.in); | |
| PrintWriter out = new PrintWriter(System.out); | |
| long _max = 0, _min = 1000000000; | |
| long sum = 0; | |
| long n; | |
| for(int i = 0; i < 5; i++) { | |
| n = in.nextLong(); |
| msgid "" | |
| msgstr "" | |
| "Project-Id-Version: Soccer Engine\n" | |
| "POT-Creation-Date: 2015-05-17 02:59+0600\n" | |
| "PO-Revision-Date: 2015-05-27 06:32+0600\n" | |
| "Last-Translator: Shazzad Hossain <sajib1223@gmail.com>\n" | |
| "Language-Team: \n" | |
| "MIME-Version: 1.0\n" | |
| "Content-Type: text/plain; charset=UTF-8\n" | |
| "Content-Transfer-Encoding: 8bit\n" |
| import json | |
| import operator | |
| def dfs(graph, start): | |
| visited, stack = set(), [start] | |
| while stack: | |
| vertex = stack.pop() | |
| if vertex not in visited: | |
| visited.add(vertex) |
| import csv | |
| import operator | |
| from datetime import datetime | |
| def validate_date(d): | |
| try: | |
| datetime.strptime(d, r'%m/%d/%Y %H:%M:%S %p') | |
| return True | |
| except ValueError: | |
| return False |
| import requests | |
| import re | |
| a = input() | |
| b = input() | |
| counter = 0 | |
| r = requests.get(a) |
| __author__ = 'abdujabbor' | |
| t = int(input()) | |
| for i in range(t): | |
| n, a, b = [int(x) for x in input().split()] | |
| s = input() | |
| r = s[0] | |
| j = 1 | |
| aa = min(a, b) | |
| bb = max(a, b) |
| __author__ = 'abdujabbor' | |
| s = input() | |
| pattern = 'SOS' | |
| counter = 0 | |
| for i in range(0, len(s), 3): | |
| curr = s[i:i + 3] | |
| found = 0 | |
| for t in range(len(pattern)): | |
| if pattern[t] == curr[t]: |
| __author__ = 'abdujabbor' | |
| n, m = [int(x) for x in input().split()] | |
| lst = [0] * n | |
| zeros = sorted([int(x) for x in input().split()]) | |
| lz = len(zeros) | |
| if len(zeros) == n: | |
| print(0) | |
| else: | |
| for i in range(lz): |
