Filter interviews by
Merge sort is a divide and conquer algorithm that recursively splits an array into halves, sorts them, and then merges them back together.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divide the array into two sub-arrays based on a pivot element
Recursively sort the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Inserting a node into a Binary Search Tree (BST) involves finding the correct position based on node values.
A BST is a tree where left children are less than the parent and right children are greater.
To insert, start at the root and compare the new value with the current node.
If the new value is less, move to the left child; if greater, move to the right child.
Repeat this process until you find a null position whe...
Sort an array of student names based on their first names.
Use a sorting algorithm like bubble sort or quicksort to sort the array.
Compare the first names of each pair of students and swap them if necessary.
Repeat the process until the array is sorted.
What people are saying about Jio Platforms
The KMP algorithm is used for pattern matching in strings.
KMP algorithm avoids unnecessary comparisons by utilizing a prefix-suffix table.
It has a time complexity of O(n + m), where n is the length of the text and m is the length of the pattern.
The algorithm is efficient for large texts and patterns with repetitive characters.
Example: Searching for 'abc' in 'ababcabc' using KMP algorithm will return the index 2.
The 3 Sum problem involves finding unique triplets in an array that sum to zero.
Sort the array to simplify finding triplets. Example: [-1, 0, 1, 2, -1, -4] becomes [-4, -1, -1, 0, 1, 2].
Use a loop to fix one element and apply two-pointer technique for the remaining elements.
Skip duplicates to ensure unique triplets. For instance, if the current element is the same as the previous, continue.
Return a list of unique ...
Count the number of words in a paragraph.
Split the paragraph into words using whitespace as a delimiter.
Count the number of words in the resulting array.
Exclude any punctuation marks from the count.
Merge sort is a divide and conquer algorithm that recursively splits an array into halves, sorts them, and then merges them back together.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
The KMP algorithm is used for pattern matching in strings.
KMP algorithm avoids unnecessary comparisons by utilizing a prefix-suffix table.
It has a time complexity of O(n + m), where n is the length of the text and m is the length of the pattern.
The algorithm is efficient for large texts and patterns with repetitive characters.
Example: Searching for 'abc' in 'ababcabc' using KMP algorithm will return the index 2.
Sort an array of student names based on their first names.
Use a sorting algorithm like bubble sort or quicksort to sort the array.
Compare the first names of each pair of students and swap them if necessary.
Repeat the process until the array is sorted.
The 3 Sum problem involves finding unique triplets in an array that sum to zero.
Sort the array to simplify finding triplets. Example: [-1, 0, 1, 2, -1, -4] becomes [-4, -1, -1, 0, 1, 2].
Use a loop to fix one element and apply two-pointer technique for the remaining elements.
Skip duplicates to ensure unique triplets. For instance, if the current element is the same as the previous, continue.
Return a list of unique tripl...
I applied via Campus Placement and was interviewed before Oct 2023. There were 4 interview rounds.
Medium level questions
I applied via Approached by Company and was interviewed before Sep 2023. There were 2 interview rounds.
I applied via Approached by Company and was interviewed before May 2022. There were 3 interview rounds.
Count the number of words in a paragraph.
Split the paragraph into words using whitespace as a delimiter.
Count the number of words in the resulting array.
Exclude any punctuation marks from the count.
I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.
It was a basic easy aptitude test
Coding test was very basic with Java OOPs concepts and few database queries.
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
There were around 15 questions, 2 were coding questions based on graphs and DP.
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divide the array into two sub-arrays based on a pivot element
Recursively sort the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Inserting a node into a Binary Search Tree (BST) involves finding the correct position based on node values.
A BST is a tree where left children are less than the parent and right children are greater.
To insert, start at the root and compare the new value with the current node.
If the new value is less, move to the left child; if greater, move to the right child.
Repeat this process until you find a null position where th...
posted on 26 Feb 2021
I applied via Company Website and was interviewed before Feb 2020. There were 4 interview rounds.
Handled high pressure from client by prioritizing tasks and communicating effectively.
Identified critical issues and addressed them first
Communicated regularly with the client to provide updates and manage expectations
Collaborated with team members to delegate tasks and ensure timely delivery
Maintained a calm and professional demeanor to avoid escalating the situation
Release management is the process of planning, scheduling, coordinating, and deploying software releases.
It involves identifying the scope of the release and the features to be included
Creating a release plan and schedule
Coordinating with different teams involved in the release process
Testing the release to ensure it meets quality standards
Deploying the release to production
Monitoring the release to ensure it is stable...
posted on 29 Jan 2021
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2019. There were 6 interview rounds.
based on 7 interview experiences
Difficulty level
Duration
based on 73 reviews
Rating in categories
Software Development Engineer
696
salaries
| ₹5 L/yr - ₹12.4 L/yr |
Software Developer
686
salaries
| ₹5.9 L/yr - ₹14 L/yr |
Assistant Manager
511
salaries
| ₹4.5 L/yr - ₹10 L/yr |
Product Manager
507
salaries
| ₹17.7 L/yr - ₹30.9 L/yr |
Deputy Manager
463
salaries
| ₹9.8 L/yr - ₹18 L/yr |
Jio
DXC Technology
Mphasis
EXL Service