Filter interviews by
I applied via Walk-in and was interviewed in Sep 2023. There were 3 interview rounds.
Structured Query Language
SQL stands for Structured Query Language
It is a standard language for accessing and manipulating databases
Commonly used for querying, updating, and managing relational databases
Examples of SQL commands include SELECT, INSERT, UPDATE, DELETE
I applied via Walk-in and was interviewed before Jan 2024. There was 1 interview round.
I applied via Indeed and was interviewed before Mar 2022. There were 2 interview rounds.
Spine Technologies interview questions for popular designations
I applied via Newspaper Ad and was interviewed before Apr 2022. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Feb 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Mar 2021. There were 2 interview rounds.
Top trending discussions
Find length of longest consecutive substring of 0 and 1 with equal count in given array of bits.
Create a prefix array to store the difference between count of 0s and 1s till each index.
Find the first and last occurrence of each unique value in prefix array.
Calculate the length of the subarray between first and last occurrence of each unique value.
Return the maximum length of subarray with equal count of 0s and 1s.
To find max window of matching patterns between two sequences of length N with mutated patterns.
Create a sliding window of size N and traverse both sequences simultaneously.
Check for matching patterns in the window and keep track of the maximum window with matching patterns.
Use a hash table to keep track of mutated patterns.
If a pattern is mutated, update the hash table and check if it matches with the other sequence.
R...
Find the maximum window size of common substring in two given sequences.
Use dynamic programming to find the length of longest common substring.
Slide a window of that length over both sequences to find the common substring.
If no common substring is found, decrease the window size and repeat.
Rotate a string of length n word by word with constant extra space in linear time.
Reverse the entire string
Reverse each word in the string
Handle the last word separately
Time complexity: O(n)
Space complexity: O(1)
based on 11 interviews
Interview experience
based on 68 reviews
Rating in categories
Software Support Engineer
54
salaries
| ₹0 L/yr - ₹0 L/yr |
Implementation Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Coordinator
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Associate
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Oracle Cerner
Veradigm
McKesson
GE Healthcare