'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Siemens interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Siemens
1 rounds | 3 Coding problems
Interview preparation journey
Application story
<p>Focus on data structures and algorithms</p>
Preparation
Duration: 3 months
Topics: Competitive programming mainly focused on dynamic programming and graphs algorithms.
Tip

Do prepare for previous interview experiences of company in which you are applying and also pay more focus to data structures related questions. Also prepare for aptitude as well, as many companies ask aptitude questions as part of interview process.

Application process
Where: Campus
Eligibility: 7.75 CGPA
Resume tip

Mention things that you are confident of. Donâ€™t try to write extra skills which you are not sure about as most of the questions are asked after seeing the skills mentioned in your resume.

Interview rounds
01
Round
Easy
Online Coding Test
Duration75 minutes
Interview date29 Aug 2019
Coding problem3

There was only one round and it was MCQ + Coding round.  Total of 18 MCQs were asked and 2 coding questions were asked.

1. MCQ Questions

MCQâ€™s (10 Aptitude, 5 English, 3 Data structures - 18 MCQâ€™s)

2. Longest Common Subsequence
Moderate
39m average time
0/80

Given two sequences, find the length of longest subsequence present in both of them. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous.

Problem approach

This is a standard Dynamic programming question. I solved it using 2D DP by comparing current characters and filled DP using previous DP fields.

3. Check if given numbers are coprime
Easy
28m average time
0/40

Two numbers A and B are said to be Co-Prime or mutually prime if the Greatest Common Divisor(GCD) of them is 1. You have been given two numbers A and B, find if they are Co-prime or not.

Problem approach

I simply calculated GCD of two numbers using the Euclid algorithm and just check the GCD whether it is one or not. If it is 1 then they are co-prime else not.

Start a Discussion
Similar interview experiences
SDE - 1
4 rounds | 8 problems
Interviewed by Siemens
923 views
SDE - 1
4 rounds | 11 problems
Interviewed by Siemens
592 views
SDE - 1
3 rounds | 3 problems
Interviewed by Siemens
0 views
SDE - 1
2 rounds | 5 problems
Interviewed by Siemens
387 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
93163 views