sji

https://leetcode.com/problems/increasing-triplet-subsequence/ Increasing Triplet Subsequence - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com find increasing triplet sequence a < b < c a_i < b_i < c_i idea: moving minimum!!!!!! class Solution: def increasingTriplet(self, nums: Lis..

https://leetcode.com/problems/matchsticks-to-square/ Matchsticks to Square - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2200ms !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! import collections from functools import lru_cache class Solution: def makesquare(self, nums: List[int]) -> bool: i..

https://leetcode.com/problems/implement-magic-dictionary/ Implement Magic Dictionary - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com check whether the word made by flipping one charater of given word exists in the dictionary 500ms (Terrible solution) class TreeNode: def __init__(..

https://leetcode.com/problems/maximum-width-of-binary-tree/ Maximum Width of Binary Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com root -> left (x2) root -> right (x2 +1) 44ms # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, righ..

https://leetcode.com/problems/maximum-binary-tree/ Maximum Binary Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. find max & make it as a root 2. split array 3. repeat on splited array (left child / right child) 350ms # Definition for a binary tree node. # class TreeNode:..

https://leetcode.com/problems/count-binary-substrings/ Count Binary Substrings - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com idea: convert into [group_cnt, group_cnt, ... ] 290ms import collections class Solution: def countBinarySubstrings(self, s: str) -> int: buf = [] is_zero..

https://leetcode.com/problems/minimum-index-sum-of-two-lists/ Minimum Index Sum of Two Lists - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 270ms import collections class Solution: def findRestaurant(self, list1: List[str], list2: List[str]) -> List[str]: a = set(list1) b = set(..

https://leetcode.com/problems/longest-harmonious-subsequence/ Longest Harmonious Subsequence - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 450ms import collections class Solution: def findLHS(self, nums: List[int]) -> int: if len(nums) < 1: return 0 if len(set(nums)) == 1: retu..