Algorithms + Data Structures + Coding Interviews with Python
What you'll learn
- Learn, implement, and use different algorithms
- Learn, implement, and use basic data structures
- Become confident and prepared for coding interviews given by some of the most popular tech companies
Requirements
- Basic understanding of Python
- No experience with data structures or algorithms required
Description
"Why do we need to know algorithm?"
For those who are already working in the IT field, you may wonder why we need to know algorithm since you don't use it in your day to day tasks. Not everyone working in the IT field uses algorithms, but let's take a moment to think about why candidates applying for GAFA (Aka Google, Apple, Facebook, Amazon) are always asked interview questions regarding data structures and algorithms.
What type of engineer do you want to be?
As you may know, Google's search function and Tesla's automated driving require top quality performance and that wouldn't be possible without exceptional algorithm efficiency. Therefore, it's important for programmers to have the ability to write codes that can perform well. Of course, if you just want to create a small scale web page using a simple web framework, you won't need to know about algorithm. But services that are popular in our modern society today will face issues with scalability. At the initial stage of creating services, whether the algorithm runs properly or not may be main issue, but as time progresses, the amount of data increases and programmers will have to focus on how to process the data received in a timely manner. That's when the programmer's skills and knowledge are really put to the test.
If you are considering working as an engineer in the Silicon Valley, in most cases (or perhaps all cases), you'll encounter a coding interview portion and without passing this portion of the interview, you won't be hired. Your soft skills may be looked at by the interviewer, but without a solid background and knowledge of algorithm, you won't be able to get the position.
Why should I take this course?
In the first half of this course, we'll be covering the basics of algorithms and data structures using Python. In the latter half, we'll be covering coding questions you may be asked during an actual interview. If you're familiar with the basics of Python, then you'll be able to understand the algorithms and data structures introduced in this course. By the end of this course, we hope you feel more confident and feel prepared to answer coding interview questions.
Happy learning!
Who this course is for:
- Anyone who wants to learn the basics of algorithms and/or data structures
- Anyone who wants to be more confident and prepared for algorithm interviews
Instructors
Completed primary education in the US and attended Sophia University in Tokyo, Japan. Have work experience (IT, tax, business law, HR, and education field) in both Japan and US. Former tax consultant at Deloitte.
Currently, Founder of Pegasus Root LLC. Resides in San Francisco and specializes in online content creation/translation with emphasis on the IT field.
My greatest passion is teaching! I enjoy creating courses that can provide the information and motivation for taking one's career to the next level.
Entered Doshisha University with a soccer scholarship in 1998. Selected in the collage national team. Won a gold medal at the U21 Asian Cup in 2001. Had been offered by the professional league in Japan, although had to give up the opportunity due to a ligament rupture in the knee. Graduated Japan Advanced Institute of Science and Technology with a masters degree in computer science. Started my career life in NTTDOCOMO, Inc in 2004. In 2005 started my own company in Hawaii and operated for 2 years. Later in 2006 started to work in a start up in the US. Although left the company which went into bankruptcy due to the Lehman shock in 2008. Working in NTTi3 from 2009, joined silicon valley's company nn 2012 - present as a software engineer. Currently spreading the knowledge to help the future soccer professionals.