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

SDE - 1

Ascentx Software

2 rounds | 2 Coding problems

Manish Vishwakarma

Fresher | Jul 2020

Selected

Interview preparation journey

Preparation

Duration: 5 months

Topics: Data Interpretation, Inequalities, Percentages, Number Series, Arithmetic Aptitude, Profit and Loss, Simple Interest and Compound Interest. Age Problems.

Tip

Tip 1 : Research the industry and company.
Tip 2 : Clarify your "selling points" and the reasons you want the job.

Application process

Where: Campus

Eligibility: 8 CGPA

Resume tip

Tip 1 : Keep it chronological.
Tip 2 : Keep it simple.

Interview rounds

Round

Medium

Online Coding Interview

Duration40 minutes

Interview date7 Jul 2020

Coding problem1

1. Puzzle

Puzzles on : Time and Work , Average, Problem on ages, profit and loss, Pipes and Cisterns, Problem on trains, Percentage

Problem approach

Tip 1 : Practise lots of puzzles.

Round

Easy

Coding Test - Pen and paper

Duration50 minutes

Interview date13 Jul 2020

Coding problem1

1. MergeSort Linked List

Moderate

10m average time

90% success

0/80

Asked in companies

You are given a Singly Linked List of integers. Sort the Linked List using merge sort.

Merge Sort is a Divide and Conquer algorithm. It divides the input into two halves, calls itself for the two halves, and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, L, M, R) is a key process that assumes that arr[L..M] and arr[M + 1...R] are sorted and merges the two sorted subarrays into one.

Problem approach

Step 1 : I first applied bubble sort. It was not good enough.
Step 2 : Interviewer asked me to optimise the solution.
Step 3 : Then I used merge sort and interviewer was happy.

Try solving now