BEst

class Solution: def makePalindrome(self, s: str) -> bool: count=0 st=0 en=len(s)-1 for i in range(len(s)//2): if s[st]!=s[en]: count+=1 if count>2: return False st+=1 en-=1 return True

class Solution: def smallestCommonElement(self, mat: List[List[int]]) -> int: ans=set(mat[0]) for i in range(1,len(mat)): ans=ans& set(mat[i]) return min(ans) if len(ans)>=1 else -1

You are given a 0-indexed integer array nums, where nums[i] is a digit between 0 and 9 (inclusive). The triangular sum of nums is the value of the only element present in nums after the following process terminates: Let nums comprise of n elements. If n == 1, end the process. Otherwise, create a new 0-indexed integer array newNums of length n - 1. For each index i, where 0

You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers. You should rearrange the elements of nums such that the modified array follows the given conditions: Every consecutive pair of integers have opposite signs. For all integers with the same sign, the order in which they were present in nums is preserved. The rearranged array..

Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty). Implement the MyStack class: void push(int x) Pushes element x to the top of the stack. int pop() Removes the element on the top of the stack and returns it. int top() Returns the element on the top of the stack. boolean empty() R..

Web application server는 Web Server와 Web Container가 합친거야? Web Application Server는 일반적으로 Web Server와 Web Container를 모두 포함합니다. Web Server는 클라이언트에서 오는 HTTP 요청을 받아들이고, 요청에 대한 정적인 리소스 (HTML 파일, 이미지 파일, CSS 파일 등)를 제공하는 역할을 합니다. 예를 들어, Apache HTTP Server나 Nginx는 대표적인 Web Server입니다. Web Container는 동적인 컨텐츠를 생성하기 위해 Servlet/JSP와 같은 Java 웹 어플리케이션을 실행하고 관리합니다. 예를 들어, Tomcat, Jetty, JBoss와 같은 Java EE 서버는 Web ..

There are 3n piles of coins of varying size, you and your friends will take piles of coins as follows: In each step, you will choose any 3 piles of coins (not necessarily consecutive). Of your choice, Alice will pick the pile with the maximum number of coins. You will pick the next pile with the maximum number of coins. Your friend Bob will pick the last pile. Repeat until there are no more pile..

Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to node toi. Find the smallest set of vertices from which all nodes in the graph are reachable. It's guaranteed that a unique solution exists. Notice that you can return the vertices in any order. Example 1: Input: n = 6, edges = [[0,..

You want to water n plants in your garden with a watering can. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. There is a river at x = -1 that you can refill your watering can at. Each plant needs a specific amount of water. You will water the plants in the following way: Water the plants in order from left to right. Af..

You have an array arr of length n where arr[i] = (2 * i) + 1 for all valid values of i (i.e., 0