- 121
- 2 406
ADevOpsBeginner
Australia
เข้าร่วมเมื่อ 16 พ.ค. 2024
What a devops beginner can do in 10 minutes, step-by-step.
devops | how to create an ansible role | ansible practice | playbooks | step-by-step
devops | how to create an ansible role | ansible practice | playbooks | step-by-step
มุมมอง: 3
วีดีโอ
leetcode contest 2Feb2025| Q2. Maximum Manhattan Distance After K Changes | python practice|medium
มุมมอง 76719 ชั่วโมงที่ผ่านมา
leetcode contest 2Feb2025 | Q2. Maximum Manhattan Distance After K Changes | python practice | medium
leetcode contest 2Feb2025 | Q1. Maximum Difference Between Even and Odd Frequency I | python
มุมมอง 8619 ชั่วโมงที่ผ่านมา
leetcode contest 2Feb2025 | Q1. Maximum Difference Between Even and Odd Frequency I | python practice | easy
leetcode daily challenge | 1752. Check if Array Is Sorted and Rotated| python practice | easy
มุมมอง 1221 ชั่วโมงที่ผ่านมา
leetcode daily challenge | 1752. Check if Array Is Sorted and Rotated| python practice | easy
leetcode | 1897. Redistribute Characters to Make All Strings Equal| python practice | easy
มุมมอง 921 ชั่วโมงที่ผ่านมา
leetcode | 1897. Redistribute Characters to Make All Strings Equal| python practice | easy
leetcode | 1893. Check if All the Integers in a Range Are Covered| python practice | easy
มุมมอง 1421 ชั่วโมงที่ผ่านมา
leetcode | 1893. Check if All the Integers in a Range Are Covered| python practice | easy
leetcode | Q1. Find Valid Pair of Adjacent Digits in String| python practice | easy
มุมมอง 1602 ชั่วโมงที่ผ่านมา
leetcode | Q1. Find Valid Pair of Adjacent Digits in String| python practice | easy
leetcode | 1886. Determine Whether Matrix Can Be Obtained By Rotation| python practice | easy
มุมมอง 142 ชั่วโมงที่ผ่านมา
leetcode | 1886. Determine Whether Matrix Can Be Obtained By Rotation| python practice | easy
leetcode | 1880. Check if Word Equals Summation of Two Words| python practice | easy
มุมมอง 82 ชั่วโมงที่ผ่านมา
leetcode | 1880. Check if Word Equals Summation of Two Words| python practice | easy
leetcode | 1876. Substrings of Size Three with Distinct Characters| python practice | easy
มุมมอง 132 ชั่วโมงที่ผ่านมา
leetcode | 1876. Substrings of Size Three with Distinct Characters| python practice | easy
leetcode | 1869. Longer Contiguous Segments of Ones than Zeros| python practice | easy
มุมมอง 192 ชั่วโมงที่ผ่านมา
leetcode | 1869. Longer Contiguous Segments of Ones than Zeros| python practice | easy
leetcode | 1863. Sum of All Subset XOR Totals| python practice | easy
มุมมอง 182 ชั่วโมงที่ผ่านมา
leetcode | 1863. Sum of All Subset XOR Totals| python practice | easy
leetcode | 1859. Sorting the Sentence| python practice | easy
มุมมอง 92 ชั่วโมงที่ผ่านมา
leetcode | 1859. Sorting the Sentence| python practice | easy
leetcode | 1854. Maximum Population Year| python practice | easy
มุมมอง 212 ชั่วโมงที่ผ่านมา
leetcode | 1854. Maximum Population Year| python practice | easy
leetcode | 1848. Minimum Distance to the Target Element| python practice | easy
มุมมอง 122 ชั่วโมงที่ผ่านมา
leetcode | 1848. Minimum Distance to the Target Element| python practice | easy
leetcode | 1844. Replace All Digits with Characters| python practice | easy
มุมมอง 92 ชั่วโมงที่ผ่านมา
leetcode | 1844. Replace All Digits with Characters| python practice | easy
leetcode | 3151. Special Array I | python practice | easy
มุมมอง 152 ชั่วโมงที่ผ่านมา
leetcode | 3151. Special Array I | python practice | easy
leetcode | 1837. Sum of Digits in Base K | python practice | easy
มุมมอง 94 ชั่วโมงที่ผ่านมา
leetcode | 1837. Sum of Digits in Base K | python practice | easy
leetcode | 1832. Check if the Sentence Is Pangram | python practice | easy
มุมมอง 94 ชั่วโมงที่ผ่านมา
leetcode | 1832. Check if the Sentence Is Pangram | python practice | easy
leetcode | 1827. Minimum Operations to Make the Array Increasing | python practice | easy
มุมมอง 144 ชั่วโมงที่ผ่านมา
leetcode | 1827. Minimum Operations to Make the Array Increasing | python practice | easy
leetcode | 1822. Sign of the Product of an Array | python practice | easy
มุมมอง 134 ชั่วโมงที่ผ่านมา
leetcode | 1822. Sign of the Product of an Array | python practice | easy
leetcode | 1816. Truncate Sentence | python practice | easy
มุมมอง 84 ชั่วโมงที่ผ่านมา
leetcode | 1816. Truncate Sentence | python practice | easy
leetcode | 1812. Determine Color of a Chessboard Square | python practice | easy
มุมมอง 94 ชั่วโมงที่ผ่านมา
leetcode | 1812. Determine Color of a Chessboard Square | python practice | easy
leetcode | 1805. Number of Different Integers in a String | python practice | easy
มุมมอง 104 ชั่วโมงที่ผ่านมา
leetcode | 1805. Number of Different Integers in a String | python practice | easy
leetcode | 827. Making A Large Island | python practice | hard
มุมมอง 84 ชั่วโมงที่ผ่านมา
leetcode | 827. Making A Large Island | python practice | hard
leetcode | 1800. Maximum Ascending Subarray Sum | python practice | easy
มุมมอง 167 ชั่วโมงที่ผ่านมา
leetcode | 1800. Maximum Ascending Subarray Sum | python practice | easy
leetcode | 1796. Second Largest Digit in a String | python practice | easy
มุมมอง 157 ชั่วโมงที่ผ่านมา
leetcode | 1796. Second Largest Digit in a String | python practice | easy
leetcode | 1791. Find Center of Star Graph | python practice | easy
มุมมอง 207 ชั่วโมงที่ผ่านมา
leetcode | 1791. Find Center of Star Graph | python practice | easy
--- - name: Playbook - how to create an ansible role hosts: all roles: - hostname tasks: - name: Show hostname ansible.builtin.debug: var: ansible_hostname
class Solution: def leetcode(self, s: str, k: int) -> int: nwse = [0,0,0,0] result = 0 ll = len(s) for ii in range(ll): if s[ii] == "N": nwse[0] += 1 elif s[ii] == "W": nwse[1] += 1 elif s[ii] == "S": nwse[2] += 1 elif s[ii] == "E": nwse[3] += 1 minns = min(nwse[0],nwse[2]) minew = min(nwse[1],nwse[3]) maxns = max(nwse[0],nwse[2]) maxew = max(nwse[1],nwse[3]) manhattan = maxns-minns + maxew-minew + min(k,minns+minew)*2 #print(ii,nwse,manhattan, result) result = max(result, manhattan) return result
code
yes, sir
class Solution: def leetcode(self, s: str) -> str: dd = defaultdict(int) for each in s: dd[int(each)] += 1 result = "" ll = len(s) # for each in dd: # print(each,dd[each]) for ii in range(ll-1): #print(ii,s[ii],s[ii+1],result) if int(s[ii]) == dd[int(s[ii])] and int(s[ii+1]) == dd[int(s[ii+1])] and s[ii] != s[ii+1]: result = s[ii]+s[ii+1] break # for each in dd: # if each == dd[each]: # result += str(each) if len(result) < 2: return "" return result
hola
hola, Mr.L, feliz ano nuevo
I watch your video and quite liked your unique way of solving. But it would be nice if you could voice over your video.
It is very nice of your words. I believe that is the right thing to do, but I still need to prepare more for now, hopefully in the future
github.com/adevopsbeginner/ansible/blob/main/playbooks/hostname.yml
github.com/adevopsbeginner/python/blob/main/leetcode/easy/1544-make-the-string-great.py
github.com/adevopsbeginner/python/blob/main/leetcode/easy/1550-three-consecutive-odds.py
github.com/adevopsbeginner/python/blob/main/leetcode/medium/2017-grid-game.py
github.com/adevopsbeginner/python/blob/main/leetcode/medium/2661-first-completely-painted-row-orcolumn.py
github.com/adevopsbeginner/python/blob/main/leetcode/medium/2683-neighboring-bitwise-xor.py
github.com/adevopsbeginner/python/blob/main/leetcode/medium/2425-bitwise-xor-of-all-pairings.py
github.com/adevopsbeginner/python/blob/main/leetcode/medium/2429-minimize-xor.py
github.com/adevopsbeginner/python/blob/main/leetcode/medium/2657-find-the-prefix-common-array-of-two-arrays.py
github.com/adevopsbeginner/python/blob/main/leetcode/easy/1539-kth-missing-positive-number.py
github.com/adevopsbeginner/python/blob/main/leetcode/easy/1534-count-good-triplets.py
github.com/adevopsbeginner/python/blob/main/leetcode/easy/1528-shuffle-string.py
github.com/adevopsbeginner/python/blob/main/leetcode/easy/1523-count-odd-numbers-in-an-interval-range.py
github.com/adevopsbeginner/python/blob/main/leetcode/easy/1518-water-bottles.py
github.com/adevopsbeginner/python/blob/main/leetcode/easy/1512-number-of-good-pairs.py