i
Ascendion
Filter interviews by
I applied via Company Website and was interviewed in Oct 2023. There was 1 interview round.
Check if a string has matching paranthesis
Use a stack data structure to keep track of opening and closing paranthesis
Iterate through the string and push opening paranthesis onto the stack
When a closing paranthesis is encountered, pop from the stack and check if it matches the corresponding opening paranthesis
If stack is empty at the end of iteration, all paranthesis are matched
An HTTP client is a program that sends requests to a server and receives responses.
Use a library like Axios or fetch to make HTTP requests
Specify the request method, URL, headers, and body
Handle the response data and errors appropriately
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
JavaScript coding, html/css
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
It was very good
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
Use dynamic programming to check if substrings are palindromes
Iterate through the string and expand around each character to find palindromic substrings
Keep track of the longest palindromic substring found
You are given a 2D matrix 'ARR' of size 'N x 3' with integers, where 'N' is the number of rows. Your task is to compute the smallest sum achievable by selecting one...
Find the smallest sum achievable by selecting one element from each row of a 2D matrix, following certain constraints.
Iterate through each row and calculate the minimum sum by selecting elements that do not violate the constraints.
Keep track of the minimum sum achieved so far.
Avoid selecting elements directly beneath previously selected elements.
Example: For input [[1, 2, 3], [4, 8, 6], [1, 5, 3]], the optimal selectio
Round duration - 1 hour
Round difficulty - Medium
It was a good interview
Tip 1 : Daily practice programming
Tip 2 : Work with honesty
Tip 3 : Do with utmost dedication
Tip 1 : Write with honesty
Tip 2 : Mention about your achievements
posted on 15 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
I was asked 2 coding questions, questions from my projects and questions related to different java concepts. One question from cloud computing was also asked.
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
Iterate through the array and keep track of the current sum and maximum sum seen so far.
If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.
Return the maximum sum as the result.
Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...
Add two numbers represented as linked lists and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry
Create a new linked list to store the sum
Handle cases where one list is longer than the other
Consider edge cases like carry at the end of addition
Round duration - 15 minutes
Round difficulty - Easy
It was a normal discussion about the role, the job expectations and about the company culture.
Tip 1 : Do at-least 200+ dsa problems from various topics.
Tip 2 : Make 2-3 projects and be well versed with their functionality.
Tip 3 : Practice aptitude questions and time yourself while doing the questions.
Tip 1: Keep your resume short, try to make it one pager only.
Tip 2: Mention only position specific projects, and if you have got a good academic score mention it on top.
posted on 28 Dec 2021
I applied via Naukri.com and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Dec 2021. There were 4 interview rounds.
Thre are aptitude question with coding round
I applied via Company Website and was interviewed in Jun 2021. There was 1 interview round.
posted on 18 May 2021
I applied via Naukri.com and was interviewed in Nov 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Around 75 mcq questions with snippets of code
I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
Object-oriented programming concepts that help in organizing and structuring code.
Encapsulation: Bundling data and methods together in a class.
Inheritance: Creating new classes from existing ones, inheriting their properties and behaviors.
Polymorphism: Objects of different classes can be treated as objects of a common superclass.
Abstraction: Hiding complex implementation details and providing simplified interfaces.
Enca...
based on 3 interviews
Interview experience
based on 4 reviews
Rating in categories
Senior Software Engineer
70
salaries
| ₹7.8 L/yr - ₹28 L/yr |
Software Engineer
40
salaries
| ₹4.6 L/yr - ₹15 L/yr |
Software Developer
31
salaries
| ₹4.5 L/yr - ₹16.5 L/yr |
Talent Acquisition Specialist
24
salaries
| ₹2.1 L/yr - ₹5.5 L/yr |
Senior Engineer
23
salaries
| ₹8 L/yr - ₹17.3 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech