Techolution interview experience Real time questions & tips from candidates to crack your interview

Python Developer

Techolution
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
Constant work on my core primary skills and regular practice, along with hands-on experience on coding platforms, helps me to stay on top of my game.
Application story
I applied to the relevant jobs according to my role and went through multiple rounds, and after all that, they extended the offer.
Why selected/rejected for the role?
I was selected because I demonstrated my technical and problem-solving skills and ensured that they understood my previous project very well.
Preparation
Duration: 2 months
Topics: Data Structures & Algorithms, Python, AWS, SQL, System Design
Tip
Tip

Tip 1 : Study and research.
Tip 2 : Keep practicing.
Tip 3 : Ask questions.

Application process
Where: Linkedin
Eligibility: 70% or more in BTech, 12th and 10th and Relevant experience.
Resume Tip
Resume tip

Tip 1: Keep it short and crisp.
Tip 2: Mention adjectives and implementation steps.

Interview rounds

01
Round
Medium
Video Call
Duration60 mins
Interview date15 Mar 2023
Coding problem3

Afternoon, Environment was good, and interviewer was good speaker and listener.

1. Integer To Roman Numeral

Easy
10m average time
90% success
0/40
Asked in companies
AdobeFacebookPayPal

Given an integer ‘N’, the task is to find its corresponding Roman numeral.

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol      Value
  I           1
  V           5
  X           10
  L           50
  C           100
  D           500
  M           1000

Example :

2 is written as II in the roman numeral, just two one’s added together. 
12 is written as XII, which is simply X(ten) + II(one+one). 
The number 27 is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. 
However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four.
The same principle applies to the number nine, which is written as IX.

There are six instances where subtraction is used:

I can be placed before V (5) and X (10) to make 4 and 9.
X can be placed before L (50) and C (100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.
Problem approach

Roman numerals are usually written from largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because one is before five, we subtract it, making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

  • I can be placed before V (5) and X (10) to make 4 and 9.
  • X can be placed before L (50) and C (100) to make 40 and 90.
  • C can be placed before D (500) and M (1000) to make 400 and 900.
Try solving now

2. Puzzle

A boy fell off a 30-meter ladder but did not get hurt. Why?

Problem approach

Think smart, as he fell from the bottom step of the ladder.

3. Rotate Linked List

Moderate
25m average time
65% success
0/80
Asked in companies
Morgan StanleyPharmEasyGeeksforGeeks

You are given a linked list having ‘n’ nodes and an integer ‘k’.


You have to rotate the linked list to the right by ‘k’ positions .


Example :
Input: linked list = [1 2 3 4] , k = 2

Output: 3 4 1 2

Explanation:
We have to rotate the given linked list to the right 2 times. After rotating it to the right once it becomes 4->1->2->3. After rotating it to the right again, it becomes 3->4->1->2. 


Problem approach

Convert the LL to a Circular Linked List, then shift the head (n-k) times, and finally fetch the end node and set its next to NULL.

Try solving now
02
Round
Medium
Video Call
Duration60 mins
Interview date22 Mar 2023
Coding problem2

Afternoon, Environment was good, and Interviewer was good speaker and listener.

1. All Possible Balanced Parentheses

Easy
10m average time
90% success
0/40
Asked in companies
SamsungGrabMathworks

You are given a positive integer 'N'. You have to generate all possible sequences of balanced parentheses using 'N' pairs of parentheses.

A sequence of brackets is called balanced if one can turn it into a valid math expression by adding characters ‘+’ and ‘1’. For example, sequences ‘(())()’, ‘()’ and ‘(()(()))’ are balanced, while ‘)(‘, ‘(()’ and ‘(()))(‘ are not.

For example :
For N = 1, there is only one sequence of balanced parentheses,  ‘()’.

For N = 2, all sequences of balanced parentheses are ‘()()’, ‘(())’.
Problem approach

Generate a binary tree of n pairs and use recursion.

The left path represents possible left parentheses, and the right path represents possible right parentheses. A leaf node contains the answer.

Try solving now

2. Design Question

Design a forum-like systems like Quora, Reddit or HackerNews.

Problem approach
  • Tip 1: Think of some of the required features.
  • Tip 2: Think of some of the common problems encountered.
  • Tip 3: Think of possible tips for consideration.
03
Round
Easy
HR Round
Duration30 mins
Interview date28 Mar 2023
Coding problem1

Day time, Environment is good, and Interviewer was good.

1. Basic HR Questions

Tell me about yourself, your family, why you are looking for a job, and why you are fit for this role.

Problem approach

Tip 1: Be confident.
Tip 2: Be clear and concise.
Tip 3: Take a quick look about company and its business.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2581 views
0 comments
0 upvotes