Filter interviews by
Be the first one to contribute and help others!
I have the necessary skills, experience, and passion to excel in this role.
I have relevant experience in the field
I possess the required skills and qualifications
I am a quick learner and adaptable to new situations
I am passionate about the industry and eager to contribute
I am a team player and work well with others
Yes, I know Java.
I have experience in Java programming.
I am familiar with Java syntax and concepts.
I have worked on Java projects in the past.
To retrieve data from the back end, you can use APIs or database queries.
Use API calls to fetch data from the back end server.
Execute database queries to retrieve data from the database.
Parse the response or query result to extract the required data.
Handle any necessary authentication or authorization for accessing the back end.
Examples: GET request to an API endpoint, SELECT query in SQL.
OOP is a programming paradigm based on the concept of objects, which can contain data and code.
OOP stands for Object-Oriented Programming
It focuses on creating objects that interact with each other to solve a problem
Encapsulation, inheritance, and polymorphism are key concepts in OOP
Example: A car object can have properties like color, make, and model, and methods like start and stop
OOP promotes code reusability and ma
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 8 reviews
Rating in categories
Staff Nurse
3
salaries
| ₹1 L/yr - ₹2 L/yr |
AIIMS
Christian Medical College
Apollo Hospitals
Fortis Healthcare