Filter interviews by
I applied via Referral and was interviewed in Dec 2023. There was 1 interview round.
Top trending discussions
I applied via Indeed and was interviewed before Jul 2020. There were 5 interview rounds.
Call flows refer to the sequence of events that occur during a phone call.
Inbound call flow
Outbound call flow
Transfer call flow
Conference call flow
Voicemail call flow
Roaming testing pre-requisites include network coverage, SIM cards, and test devices.
Ensure network coverage in the testing area
Have SIM cards from different carriers
Prepare test devices with different operating systems
Create test scenarios and scripts
Have a test plan and schedule
Different technologies have different interfaces with unique functionalities.
Interfaces in web development include HTML, CSS, and JavaScript.
In database management, SQL is a commonly used interface.
Programming languages like Java and Python have their own interfaces.
Each interface has its own set of functions and methods for performing specific tasks.
Interfaces can also be graphical, such as user interfaces in software
Co-ordination with Roaming Operators, IPX, GRX and SCCP Providers involves managing relationships and ensuring smooth communication.
Establishing and maintaining relationships with roaming operators, IPX, GRX and SCCP providers
Negotiating contracts and service level agreements
Monitoring service performance and resolving issues
Collaborating with internal teams to ensure seamless communication
Staying up-to-date with indus
I applied via Referral and was interviewed in Jun 2024. There were 4 interview rounds.
Normal coding test on DSA and LLD.
I applied via Recruitment Consulltant and was interviewed before Feb 2023. There were 2 interview rounds.
I was interviewed before Feb 2024.
I applied via Referral and was interviewed before Oct 2020. There was 1 interview round.
Separate out 0's, 1's, and 2's in an array
Create three variables to count the number of 0's, 1's, and 2's in the array
Loop through the array and increment the respective variable for each occurrence
Create a new array and add the counted number of 0's, 1's, and 2's in order
Remove duplicates from given array of strings
Create a new empty array
Loop through the original array and check if the element already exists in the new array
If not, add it to the new array
Return the new array
Loop in linked list can be detected using Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop, the faster pointer will eventually catch up to the slower pointer.
If there is no loop, the faster pointer will reach the end of the list.
Time complexity of this algorithm is O(n) and space complexity is O(1).
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Software Consultant
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Consultant
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Application Operations Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Azure DevOps Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
Mobikwik
PhonePe
Freecharge