British Telecommunications interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
British Telecommunications
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
The first level is the Hackearth test, which was moderate compared to the Coding Ninjas course. The second level was a face-to-face technical interview that included 1 or 2 coding questions and system design, mainly focused on the skill set that includes Java, J2EE, Spring, Spring Boot, Hibernate, Microservices, Kubernetes, Docker, MySQL, Oracle, PostgreSQL, etc. The third level was the Techno-Managerial round, which included some technical questions and behavioral questions. HR with background checks followed after that.
Application story
I went to the job section of BT and then applied through the career page of BT. I used to get the job notification and then finally ended up the call from BT HR.
Why selected/rejected for the role?
Prepare mostly on coding skills and also the projects that you are putting up. Skill matters the most.
Preparation
Duration: 6 months
Topics: Arrays, LinkedList, Matrix, DP, Collections, Trees, Maps
Tip 1 : Focus more on coding.
Tip 2 : System Design is crucial.
Tip 3 : Current project knowledge is must if you are experienced.
Application process
Where: Linkedin
Eligibility: BE/B.tech or MCA
Tip 1 : Define all your projects which others can understand.
Tip 2 : Short and point to point (Avoid story).
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 mins
Interview date20 Jul 2023
Coding problem2
Coding Round+F2F interview
1. Longest Substring Without Repeating Characters
Moderate
20m average time
80% success
0/80
Asked in companies
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is "abacb", then the length of the longest substring without repeating characters will be 3 ("acb").
Problem approach
Input: “ABCDEFGABEF”
Output: 6 (The longest substring without repeating characters are “BDEFGA” and “DEFGAB”, with length 6)
Input: “GEEKSFORGEEKS”
Output: 7 (The longest substring without repeating characters are ????KSFORG” and “KSFORGE”, with length 7)
2. Reverse Level Order Traversal
Moderate
30m average time
52% success
0/80
Asked in companies
You have been given a Binary Tree of integers. You are supposed to return the reverse of the level order traversal.
For example:
For the given binary tree
The reverse level order traversal will be {7,6,5,4,3,2,1}.
02
Round
Medium
Face to Face
Duration90 mins
Interview date1 Aug 2023
Coding problem2
1. System Design
Explain Microservice architecture.
2. Design Question
Design a chat app.
03
Round
Easy
Face to Face
Duration30 mins
Interview date1 Aug 2023
Coding problem1
1. Project based question
Why did you use this tech stack?
What challenges did you face while implementation?
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
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Selected 
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
Selected 907 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3320 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2581 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
4 rounds | 1 problems
Interviewed by Newgen Software
Selected 3210 views
2 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
Selected 2583 views
0 comments
0 upvotes
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 0 views
0 comments
0 upvotes