Programming & Code Challenges / Coding Interview Questions

💻 Code along with a Python 3 online compiler:
https://www.onlinegdb.com/online_python_compiler

Factorial = A mathematical operation defined as follows:

A factorial of n (denoted by n!) is the product of all positive integers less than or equal to n.

n! = n x (n-1) x (n-2) x (n-3) x ... x 3 x 2 x 1

For example: 5! = 5 x 4 x 3 x 2 x 1 = 120

Special Case: 0! = 1

Approach:

1) Iterative Strategy: Create a loop that will find the product of n * n-1 * n-2 * ... * 2 * 1

2) Recursive Strategy: Multiply n by the factorial of (n-1) until it reaches n = 0

*** Links: ***

Website: http://www.apptato.com
YouTube: https://www.youtube.com/apptato
Twitter: https://www.twitter.com/apptato
Facebook: https://www.facebook.com/apptato
Instagram: https://www.instagram.com/apptato

#CODE #LEARNTOCODE #PROGRAMMING

👇 Solution Code provided below

This is the perfect beginner exercise that will get you familiar with coding fast!
You can follow along with any online Python 3 compiler. No installation required! Links are in the description below.

Subscribe now to Apptato for more coding interview questions, brain teasers and math problems!

Print the following shapes with width n (Where n is an integer greater than or equal to 0)

A line, square, right triangle, pyramid, diamond

💻 Solution Code:

def printLine(n):
print("x"*n)
printLine(5)

def printSquare(n):
for x in range(n):
printLine(n)
printSquare(5)

def printTriangle(n):
for x in range(n):
printLine(x+1)
printTriangle(5)

def printPyramid(n):
for x in range(n):
print(" "*(n-x-1) + "x "*(x+1))
printPyramid(5)

def printDiamond(n):
printPyramid(n)
for x in range(n):
print(" "*(x+1) + "x "*(n-1-x))
printDiamond(5)

💻 Output:

#1 Line
xxxxx

#2 Square
xxxxx
xxxxx
xxxxx
xxxxx
xxxxx

#3 Right Triangle
x
xx
xxx
xxxx
xxxxx

#4 Pyramid
x
x x
x x x
x x x x
x x x x x

#5 Diamond
x
x x
x x x
x x x x
x x x x x
x x x x
x x x
x x
x

💻 Reference Code:

#Quick Python 3 Refresher

#Print
print("Hello World")
print("Hello","World")
print("Hello" + " World")

#For Loop
for x in range(5):
print(x)

#Functions
def myFunction(n):
print("My Function:")
for x in range(n):
print(x)

myFunction(3)

🔗 Links:

Online Compiler:
https://www.onlinegdb.com/online_python_compiler

Apptato Links:
Website: http://www.apptato.com
YouTube: https://www.youtube.com/apptato
Twitter: https://www.twitter.com/apptato
Facebook: https://www.facebook.com/apptato
Instagram: https://www.instagram.com/apptato

#CODE #PYTHONTUTORIAL #PROGRAMMING

EDIT: Sum was supposed to be represented by 'n' but was coded as 's' instead.
💻 Code along with a Python 3 online compiler:
https://www.onlinegdb.com/online_python_compiler
💻Problem taken from geeksforgeeks.org

Find Subarray with Given Sum (geeksforgeeks.org)

Given an unsorted array of positive integers,
Find a subarray of continuous numbers such that this array adds up to a sum 'n'
Otherwise return an empty array

Coverage:
Quick Review of Arrays in Python
The Strategy
Coding

👇 Solution Code provided below

CORRECTION: At 8:08 and 11:50 3x5x7 is NOT 210. It is 105 of which 210 is a multiple so the code is still correct.

In this video we will cover the classic coding interview question Fizzbuzz, which was designed to weed out those that can't their way out of a paper bag. Don't be that guy!
Then later we will take the difficulty up a notch by adding extra conditions which will force us to write better code.

Subscribe to Apptato for more coding interview questions, brain teasers and interesting math problems!

💻 FizzBuzz :

For x from 1 to N:

If:
x multiple of 3 "Fizz"
x multiple of 5 "Buzz"
x multiple of 3 & 5 "FizzBuzz"

Else: x

Output:
1, 2, Fizz, 4, Buzz, ..., 14, FizzBuzz

[Code]

def fizzbuzz(n):
for x in range(1,n+1):
if (x % 15 == 0):
print ("fizzbuzz")
elif (x % 3 == 0):
print ("fizz")
elif (x % 5 == 0):
print ("buzz")
else:
print (x)

💻 FizzBuzzTuna :

For x from 1 to N:

If:
x multiple of 3 "Fizz"
x multiple of 5 "Buzz"
x multiple of 7 "Tuna"
x multiple of 3 & 5 "FizzBuzz"
x multiple of 3 & 7 "FizzTuna"
x multiple of 5 & 7 "BuzzTuna"
x multiple of 3, 5 & 7 "FizzBuzzTuna"

Else: x

Output:
1, 2, Fizz, 4, Buzz, ..., 14, FizzBuzz

[Code]

def fizzbuzztuna(n):
for x in range(1,n+1):
string = ""
if (x % 3 == 0):
string += "fizz"
if (x % 5 == 0):
string += "buzz"
if (x % 7 == 0):
string += "tuna"
if (string == ""):
string = x
print (string)

🔗 Links:

Website: http://www.apptato.com
YouTube: https://www.youtube.com/apptato
Twitter: https://www.twitter.com/apptato
Facebook: https://www.facebook.com/apptato
Instagram: https://www.instagram.com/apptato

#CODE #PYTHON #PROGRAMMING

💻 Code along with a Python 3 online compiler:
https://www.onlinegdb.com/online_python_compiler

Code Fibonacci in Python 3 (Recursion)

Fibonacci Sequence:
Sequence of numbers where a number is the sum
of the 2 numbers that came before it.
The sequence' first digits are 0 and 1.

(0,) 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...

Note: The zero is sometimes not mentioned.

def fibonacci(i):
if i == 0:
return 0
elif i == 1:
return 1
else:
return fibonacci(i-2) + fibonacci(i-1)

for x in range(10):
print(fibonacci(x))

*** SOCIAL MEDIA ***

Website: http://www.apptato.com
Facebook: http://facebook.com/apptato
Twitter: http://twitter.com/apptato
Instagram: https://instagram.com/apptato

#Code #Programming #Python