Tallest Skyscraper

[na-vural]

Before jumping into Pr first comment for assign. All Problem from Edabit. Link is mandatory to add

Problem statement: A city skyline can be represented as a 2-D list with 1s representing buildings. In the example below, the height of the tallest building is 4 (second-most right column).

[[0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 1, 0],
[0, 0, 1, 0, 1, 0],
[0, 1, 1, 1, 1, 0],
[1, 1, 1, 1, 1, 1]]

Create a function that takes a skyline (2-D list of 0's and 1's) and returns the height of the tallest skyscraper. Problem Link: https://edabit.com/challenge/76ibd8jZxvhAwDskb

---

Before submitting a PR please Check some details. Check Edabit for problem task

• [ ] fileName format should be in camelcase example- returnTheNextNumber.py
• [ ] Add label for Problem
• [ ] In file there should be problem statement and link to problem example -

  '''
  Problem Task : This program will add two numbers
  Problem Link : https://edabit.com/challenge/SFzHtm63XT6EYNHWY
  '''
  */
  def main():
  return a + b

This repository is valid for HacktoberFest2020

Read before making PR - How to contribute on Github Good Luck,

[na-vural]

Can you assign me this problem pls :)