Want to contact Anna and hundreds of other Helpers nearby? Sign up now - it only takes a few minutes!

Sign Up
Anna D

Anna D

Contact
Côte Saint-Luc

I am a very kind, pleasant nanny. I have over 5 years of wonderful experience with children ages 0-11 year...

Contact

  • Usually replies in less than a day

  • Helper Roles Nanny (live-in)

  • Availability Full-time

  • Shifts Flexible/anytime, Overnight, Weeknights

  • About Me

    I am a very kind, pleasant nanny. I have over 5 years of wonderful experience with children ages 0-11 years including twins. I take my job very seriously and best of all, I give it my all to all the children I have cared for and will care for. My best assets are: patience, kindness and flexibility.

    Have raised my own family

    5 years

    no

    • Education: Some college
    • Specific Skills
      • Kids with allergies
      • Kids with disability
  • Qualifications
    • Basics
    • Skills
    • Extra
  • Simplify finding the right person by saving your searches.
  • Save favorites, see full profiles.
  • Free to browse and post a job, pay when you are ready.
Post a Job
About

We are a web and mobile service connecting Families with great babysitters. Our services help Families find childcare, home care and elder care. Looking for a trusted babysitter in Côte Saint-Luc? Part-time or full-time? We’ve got you covered. Need someone who speaks french, can help with english homework or can tutor in spanish? We have Helpers available weekdays, weekends, even overnight. myBestHelper.com is also a perfect place if you are looking for a job. Need full-time, part-time or occasional work? Want to find a Family who also speaks Filipino or Spanish? Are you available weekdays, weeknights or weekends? Is your schedule flexible? We have a Job for you! Apply to great nanny jobs in Côte Saint-Luc - right in your neighbourhood. myBestHelper is a modern solution that makes life better, and gives you all the choices you want. Each customer’s situation is unique and we are experts in helping find an equally unique solution.