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

Software Engineer

Tekion Corp
upvote
share-icon
2 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Data Structures, Algorithm, JavaScript, React, HTML, CSS.
Tip
Tip

Tip 1 : Mention the projects from your domain
Tip 2 : Provide references to your coding platform
 

Application process
Where: Referral
Eligibility: Min 1 yr experience
Resume Tip
Resume tip

Tip 1 : Mention projects from your domain.
Tip 2 : Provided link to all the coding platforms.

Interview rounds

01
Round
Medium
Face to Face
Duration60 minutes
Interview date17 Apr 2022
Coding problem1

the first round was mostly on to the problem solving. The interviewer asked me the questions related to arrays, objects.

1. Generate Binary Numbers

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

Your friend Ninja has been learning about binary numbers lately. In order to understand binary numbers with perfection, Ninja asks you to generate a list of binary numbers from 1 to ‘N’, which he can use later for reference.

For every integer Ninja gives, your task is to generate all the binary numbers from 1 to ‘N’.

Example:

Consider N = 5,
All the binary numbers from 1 to 5 are: 1, 10, 11, 100, 101.
Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date24 Apr 2022
Coding problem1

the second round has initially begin with if you questions on the front and related to JavaScript and react and also my experience with the previous project and previous organisation and later it has continue with the problem solving based on string.

1. Longest Substring Without Repeating Characters

Moderate
30m average time
65% success
0/80
Asked in companies
FreshworksQualcommAdobe

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

Problem approach

initially I have given a brute force approach by using three for loops with the complexity O(n*n*n).

Try solving now

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
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Tekion Corp
1308 views
0 comments
0 upvotes
company logo
Frontend developer II
3 rounds | 6 problems
Interviewed by Tekion Corp
366 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 6 problems
Interviewed by Tekion Corp
1773 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 8 problems
Interviewed by Tekion Corp
618 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7874 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9973 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4310 views
1 comments
0 upvotes