Plus One | Python

Python for beginners: https://www.youtube.com/watch?v=egq7Z...

Code:

class Solution:

    def plusOne(self, digits: List[int]) -> List[int]:

        g="";

        for i in digits:

            g+=str(i);

        e=int(g);

        e=e+1;

        g=str(e);

        w=list(g);

        output=[];

        for i in w:

            output.append(int(i));

        return output;

Read More

Majority Element | Python

Check the problem statement here:
https://leetcode.com/problems/majorit... Python for beginners: https://www.youtube.com/watch?v=egq7Z...

Code:


class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        nums.sort();
        return nums[len(nums)//2];

Read More

Max Consecutive Ones | Python

Check the problem statement here: Max Consecutive Ones https://leetcode.com/problems/max-con... Python for beginners: https://www.youtube.com/watch?v=egq7Z...
Code: class Solution: def findMaxConsecutiveOnes(self, nums: List[int]) -> int: g=""; for i in nums: g=g+str(i); e=g.split('0'); max=0; for i in e: if(max<len(i)): max=len(i); return max;

Read More

Is Subsequence | Python

Prerequisite: String in Python | Part 2.3 | Castor Classes https://www.youtube.com/watch?v=65z1V... Check the problem statement here: https://leetcode.com/problems/is-subs... Python for beginners: https://www.youtube.com/watch?v=egq7Z...

Code:


class Solution:
    def isSubsequence(self, s: str, t: str) -> bool:
        g=0;
        for i in s:
            if(i in t):
                rs=t.index(i);
                t=t[rs+1:];
            else:
                g+=1;
        if(g==0):
            return True;
        else:
            return False;

Read More