Category: Interview Questions

  • 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.

  • 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.

  • Two Sum Solution [LeetCode 1]

    Two Sum Solution [LeetCode 1]

    Given an array of integers nums and a target integer. Return the indexes (not values) of the 2 numbers that add up to the target value. One solution and one element can’t be used twice.

  • LeetCode 482 License Key Formatting Solution

    LeetCode 482 License Key Formatting Solution

    LeetCode 482 Solution 32 ms in Python 3 You are given a license key represented by the string s that contains only alphanumeric characters and dashes. You are also given an integer k.

  • Google  Leetcode 929 Unique Email Addresses

    Google Leetcode 929 Unique Email Addresses

    This solution uses the Slice in Python to slice the string as needed and a List to store unique emails found. One major trick is to use email[i:] and not just email[i]