i
AVAYA
Filter interviews by
To find and remove a loop in a Linked List, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, slow and fast, to detect if there is a loop in the Linked List
If the two pointers meet at some point, there is a loop
To remove the loop, set one of the pointers to the head of the Linked List and move both pointers one step at a time until they meet again
The meeting point is the start of the loop, set the next poi
Find the maximum window size to sort an unsorted array.
Identify the longest decreasing subarray from the beginning and longest increasing subarray from the end
Find the minimum and maximum element in the identified subarrays
Expand the identified subarrays until all elements in the array are covered
The length of the expanded subarray is the maximum window size
Finding the longest last occurring word in a sentence with multiple whitespace.
Split the sentence into words using whitespace as delimiter
Reverse the list of words
Iterate through the list and find the first occurrence of each word
Calculate the length of each last occurring word
Return the longest last occurring word
Merge sort and Quick sort are sorting algorithms used to sort arrays of data.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.
Merge sort has a tim...
Process is an instance of a program while thread is a subset of a process that can run concurrently with other threads.
A process is a program in execution
A process can have multiple threads
Threads share the same memory space as the process
Threads can run concurrently with other threads within the same process
Examples of processes include web browsers, word processors, and media players
Examples of threads include GUI th
A recursive function calls itself until a base case is reached, then returns the result to the previous call.
Each call creates a new instance of the function on the call stack
The function continues to call itself until a base case is reached
Once the base case is reached, the function returns the result to the previous call
The previous call then continues executing from where it left off
Code to find number of combinations of reaching step N by ball falling from staircase with 1 or 2 steps per jump.
Use dynamic programming to solve the problem
Create an array to store the number of ways to reach each step
Initialize the array with base cases for steps 0, 1, and 2
Use a loop to fill in the array for steps 3 to N
The number of ways to reach step i is the sum of the number of ways to reach step i-1 and i-2
Retu
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Priority queue is implemented using a heap data structure.
Stack can be implemented using a priority queue by assigning higher priority to the most recently added element.
Queue can be implemented using a priority queue by assigning higher priority to the oldest element.
Implementing stack using queue involves using two queues to simulate stack behavior.
Create two queues, q1 and q2.
Push operation: Enqueue the element to q1.
Pop operation: Dequeue all elements from q1 to q2 except the last element. Dequeue and return the last element.
Swap the names of q1 and q2 after each pop operation.
Top operation: Return the last element of q1 without dequeuing it.
isEmpty operation: Check if both q1 a
I lost my job during the pandemic and struggled to find a new one
Applied to multiple job openings daily
Networked with former colleagues and industry professionals
Took online courses to improve skills
Maintained a positive attitude and stayed motivated
Eventually landed a new job in a different industry
I would have pursued a career in music or writing.
I have always had a passion for music and writing.
I have played multiple instruments since childhood.
I have written and published short stories and poetry.
I believe creativity is an important aspect of any profession.
I value my relationships with loved ones the most.
Spending quality time with family and friends
Making an effort to stay in touch with long-distance loved ones
Prioritizing important events and milestones in their lives
Being there for them during difficult times
Forgiving and working through conflicts to maintain strong bonds
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
Th interviewer asked me questions related to various topics of OS, Data Structures and Algorithm.
Tips: Have a strong hold on topics of OS like segmentation and buddy systems.
Segmentation is the process of dividing a larger entity into smaller parts or segments.
Segmentation is commonly used in image processing to separate objects of interest from the background.
It is also used in marketing to divide a target market into smaller groups based on demographics, behavior, or other factors.
In networking, segmentation refers to dividing a network into smaller subnetworks to improve performance and
The buddy system has advantages like increased safety and support, but also drawbacks like dependency and lack of independence.
Advantages: increased safety, support, accountability, motivation
Disadvantages: dependency, lack of independence, potential for conflicts
Example: In a buddy system at work, colleagues can support each other in completing tasks and provide motivation to stay on track.
Example: However, relying to...
A page fault occurs when a program tries to access a page of memory that is not currently in physical RAM.
Occurs when a program tries to access a page of memory not in physical RAM
Results in the operating system needing to retrieve the page from disk
Can lead to a temporary pause in program execution
Round duration - 60 minutes
Round difficulty - Easy
The round consisted of questions of heap, Towers of hanoi and other questions related to CV.
Tips: Time complexity analysis of Towers of Hanoi Problem is important. Good skillset in DS and Algorithms, Bit Manipulation.
You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...
Tower of Hanoi problem where 'N' disks need to be moved to another rod following specific rules in less than 2^N moves.
Implement a recursive function to move disks from one rod to another following the rules.
Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.
Maintain a count of moves and track the movement of disks in a 2-D array/list.
Ensure that larger disks are not placed on...
Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.
A min-binary heap is a complete binary tree where each internal node's va...
Convert the given array into a min-binary heap by modifying the array elements.
Iterate through the array and heapify each node starting from the last non-leaf node to the root node.
For each node, compare it with its children and swap if necessary to satisfy the min-heap property.
Continue this process until the entire array is converted into a min-heap.
Round duration - 30 minutes
Round difficulty - Easy
The HR asked about my hobbies, extra curricular activities and checked my personality.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Naukri.com and was interviewed in Apr 2021. There were 5 interview rounds.
Snake game involves controlling a snake to eat food and grow in size without hitting walls or itself.
Create a grid system to represent the game board
Implement logic for snake movement and growth
Generate food randomly on the board for the snake to eat
Handle collision detection for walls and snake body
Keep track of score and game over conditions
I applied via Recruitment Consultant and was interviewed in Mar 2021. There were 3 interview rounds.
A webservice is a software system designed to support interoperable machine-to-machine interaction over a network.
Webservices use standardized protocols such as HTTP, XML, SOAP, and REST.
They allow different applications to communicate with each other regardless of the programming language or platform used.
Webservices can be used for a variety of purposes such as data exchange, business process integration, and applica...
API is a set of protocols for building software while Webservice is a type of API that uses HTTP for communication.
API is a set of protocols for building software applications
Webservice is a type of API that uses HTTP for communication
API can be used for both internal and external communication
Webservice is typically used for external communication over the internet
API can be in any form like REST, SOAP, etc.
Webservice
Pesticide paradox refers to the phenomenon where pests develop resistance to pesticides over time.
Pesticides are used to kill pests, but over time pests develop resistance to them
This happens because the pests that are resistant to the pesticide survive and reproduce, passing on their resistance to their offspring
This can lead to the need for stronger and more toxic pesticides, which can have negative environmental and...
I applied via Naukri.com and was interviewed before Feb 2023. There were 3 interview rounds.
Use indexing to access individual characters from a string.
Use square brackets and the index number to access a specific character in the string.
Remember that indexing starts at 0 in most programming languages.
Example: str = 'hello', to get the first character 'h', use str[0].
I applied via LinkedIn and was interviewed before Oct 2022. There were 3 interview rounds.
Oracle RDBMS concepts, core java, data structures
posted on 14 May 2024
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
1 hour coding interview where medium level DSA problems were asked.
1 hour interview. 1 coding question and some questions related to cloud were asked.
Software Engineer
146
salaries
| ₹5.7 L/yr - ₹23 L/yr |
Senior Technical Support Engineer
88
salaries
| ₹7 L/yr - ₹25 L/yr |
Senior Technical Specialist
82
salaries
| ₹6 L/yr - ₹15 L/yr |
Senior Software Engineer
71
salaries
| ₹9 L/yr - ₹27.3 L/yr |
Softwaretest Engineer
69
salaries
| ₹3.2 L/yr - ₹5.6 L/yr |
24/7 Customer
Thomson Reuters
Oracle Cerner
NextComm Corporation