Tag: Programming

  • Why I deleted all my GitHub repos

    Why I deleted all my GitHub repos

    GitHub is a popular website to share Git repositories or repos as they’re usually called. When you create a Git repository on GitHub, you can share it with the public and be able to work together on the same project with various people.

  • 412. Fizz Buzz Python 3 Solution

    412. Fizz Buzz Python 3 Solution

    Input: integer n Output: string array answer (1-indexed) where: Using If elif and modulus operator to determine if the number i is divisible by 3 and 5 then by 3 then by 5 only.

  • Wrap text with tags in Notepad++

    Wrap text with tags in Notepad++

    Wrap text with tags in Notepad++ A macro can do that and it’s easier than you think. If you need to wrap the text with html tags or Wordpress Gutenberg code blocks or paragraph block or a heading block.

  • How to learn Python as a second language

    How to learn Python as a second language

    After watching and reading few tutorials you still can’t say that you know much Python and that’s probably true. How I try to learn it, still work in progress, is to use a project-based approach.

  • Random Password generator in Python

    Random Password generator in Python

    What I needed was a small script that I execute and generate a random password that is then copied to the clipboard and all I had to do was paste it Ctrl+V to use it.

  • 155. Min Stack

    155. Min Stack

    Design a stack that can return the minimum element in constant time and also support pus, pop and top methods. Example:Input[“MinStack”,”push: -3″,”push: 0″,”push: -5″,”getMin”,”pop”,”top”,”getMin”]

  • 20. Valid Parentheses Leetcode Solution

    20. Valid Parentheses Leetcode Solution

    Return boolean indicating wether the pairs of paranthesis are matching and there are no un-matched paranthesis found. Using a list to implement a stack in Python.Store all the pairs of opening and closing tags in a dictionary. Closing brackets are the key.Go.

  • 66. Plus One LeetCode Solution in Python

    66. Plus One LeetCode Solution in Python

    Given a non empty array of decimal digits representing a non-begative integer.Increment the integer, most significant digit is on the left. Each element contains a single digit.No leading zeros except for the number 0.

  • Google Interview 686. Repeated String Match

    Google Interview 686. Repeated String Match

    Given two strings a and b, return the minimum number of times you should repeat string a so that string b becomes a subscring of sring a.If b cannot be a substring of a after repeating it, return -1.

  • Google 844. Backspace String Compare

    Google 844. Backspace String Compare

    Given two strings s and t, return True if they are equal. ‘#’ means backspace. Solution 1: use a list to implement a stack. append adds an item and pop removes it.