• Post category:StudyBullet-17
  • Reading time:4 mins read

Interview Starters : Python
We will be solving and discussing some of the actual interviews questions asked commonly.

What you will learn

Get to know about frequently asked coding interviews questions and how to approach them.

We will use example based approach

This course is aimed to prepare for Coding Interviews in Software Development

You just need to have the thirst for learning , that’s all you need for this Course

Description

We will see some frequently asked questions fromΒ  Actual Interviews, and build solutions on them in a Systematic way.

We will cover questions based on the simplest approach first, then try to think of more optimal solutions as the Course Progresses,

The Central Idea is to practice different ways on a single problem and think of better solutions, Keep up with me, We will together get the things done and it would be fun to learn.

I would be using Python 3 as the Programming Language, However, you are free to use any language you want because the concept remains the same, For python users, I would be using PyCharm, You can Install Pycharm for the same.

We would be discussing several coding techniques


Get Instant Notification of New Courses on our Telegram channel.


Anyone with a basic background in programming can take this course, Even if you are a complete Beginner.

I would suggest you keep practicing as this is the only way to understand things better, you can use any coding platform, just keep the consistency and commitment, and you will rock, that I guarantee.

I have collected questions from actual interviews and also from LeetCode and similar coding platforms, You will have a single place for all of the questions to practice and discuss.

For any queries, you can mail me at [email protected],Β  or drop the query in the course links too.

English
language

Content

2Sum Problem

2sum Problem
2Sum Brute Force Solution
2sum Efficient Approach using HASHMAPS
2Sum Hashmap Solution Implementation (Python)
Extra What if the Array given is sorted in Two Sum ???

Balanced Parentheses

Balanced Parentheses
Balanced Parentheses Solution in Python using Stack Data Structure

Sort Array Consisting of 0 ,1 and 2 in linear time

Logic building for this problem

Remove all adjacent duplicate elements in a String

Remove all adjacent duplicate in a string: logic building
remove all adjacent duplicate program

Find Second Highest Number in Linerar time from an Array

Second Highest in an array logic
Second highest in an array Implementation