- Interview Question Subarray Sum Equals K O(n) Solution
- Find Minimum in Rotated Sorted Array | Microsoft, LinkedIn, Amazon Interview
- Two Sum ll | Microsoft, linkedin, airbnb interview question | Leetcode 167
- Two Sum | Google, Facebook, Microsoft, LinkedIn Interview Question | Leetcode 1
- Check completeness of a binary tree | Microsoft, Google interview question
- Invert Binary Tree | Microsoft, Google, Facebook Interview Question | Leetcode 2
- Path Sum 2 | Microsoft, Google, Linkedin interview question | Leetcode 113
- Longest Common Prefix | Facebook, Amazon, Microsoft interview question
What you'll learn
- coding interview
- Coding Interview preparation
- Java Development
- Algorithms
Description
I am solving and explaining Microsoft, Google, Airbnb, Uber, Amazon interview questions, I believe this will be helpful for your technical interview preparation. This course will help you understand the logic of solving the questions rather than memorizing the algorithms. I am explaining each question on a whiteboard and try to make sense. I hope you will find this course helpful.
Other Courses

Graphic design: Designing 4 Advertisements in a series!
Graphic Design course, designing 4 full page AdverArt pieces using Adobe Photoshop and Adobe Illustrator. Professional.

Create Telegram bot with NodeJS and Firebase Cloud Functions
Create a Weather Telegram Bot using NodeJS and Firebase Cloud Functions

SALESmanago: Lead Generation
Learn how to optimize lead generation methods tailor the process to increase Conversion and Sales.
About the instructors

- 4.4 Calificación
- 7986 Estudiantes
- 8 Cursos
Kado Data
Programmershine
Dear students,
After spending 16 years in the IT industry as a programmer I decied to move to Education field. I worked for small and large size well known global brands for 10 years while I was in the UK. Now I do my training videos on Programming Data Structures and Algorithms, iOS and Swift Development, Machine Learning and Deep Learning, Drone technology.
I will be uploading new videos frequently, I hope I will be helpful.
Happy coding