Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

Python Python Collections (2016, retired 2019) Dictionaries Teacher Stats

shekhar bhardwaj
seal-mask
.a{fill-rule:evenodd;}techdegree
shekhar bhardwaj
Full Stack JavaScript Techdegree Student 12,373 Points

I am able to get the answer which compiler accepts here, but wanted to understand what is wrong with this one.

I have arrived with multiple solution both gives me correct answer, I am not able to understand what is wrong with one I have came up with first time.

teachers.py
# The dictionary will look something like:
# {'Andrew Chalkley': ['jQuery Basics', 'Node.js Basics'],
#  'Kenneth Love': ['Python Basics', 'Python Collections']}
#
# Each key will be a Teacher and the value will be a list of courses.
#
# Your code goes below here.
def num_teachers(dict_teachers):
    i = 0
    for key in dict_teachers:
        i += 1
    return i

def num_courses(dict_teachers):
    i = 0
    for value in dict_teachers.values():
        i += len(value)
    return i

def courses(dict_teachers):
    course_list = []
    for value in dict_teachers.values():
        course_list += value

    return course_list

def most_courses(dict_teachers):
    key_list = []
    dict_most_subs={}
    for key in dict_teachers.keys():
        dict_most_subs={len(dict_teachers.get(key)):key}

    for key in dict_most_subs:
        key_list.append(key)

    return dict_most_subs.get(max(key_list))