i
Filter interviews by
Top trending discussions
I applied via Recruitment Consultant and was interviewed before May 2020. There were 3 interview rounds.
SFA stands for Sales Force Automation.
SFA is a software system that automates sales processes.
It helps sales teams manage customer interactions, track leads, and close deals.
SFA can also provide analytics and reporting on sales performance.
Examples of SFA software include Salesforce, HubSpot, and Zoho CRM.
DMS stands for Document Management System.
DMS is a software system used to manage, store, and track electronic documents and images.
It allows for easy retrieval and sharing of documents within an organization.
DMS can also provide version control and security features to ensure document integrity.
Examples of DMS include Microsoft SharePoint, Google Drive, and Dropbox Business.
I applied via Naukri.com and was interviewed in Jun 2020. There was 1 interview round.
Experienced Senior Engineer with a strong background in software development and project management.
Over 10 years of experience in software engineering
Expertise in Java, Python, and C++ programming languages
Managed multiple projects from conception to completion
Strong problem-solving and analytical skills
Excellent communication and leadership abilities
I am a Senior Engineer with 10+ years of experience in designing and implementing complex systems.
10+ years of experience in engineering
Specialize in designing and implementing complex systems
Proficient in various programming languages such as Java, Python, and C++
Strong problem-solving skills demonstrated through successful project completions
I applied via Naukri.com and was interviewed in Jun 2022. There were 2 interview rounds.
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
Python c java etc more about code
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
Heap sort works by first building a max heap from the input array.
It then repeatedly extracts the maximum element from the heap and rebuilds the heap.
The time complexity of heap sort is O(n log n) and it is an in-place sorting algorithm.
Example: [4, 10, 3, 5, 1] -> [1, 3, 4, 5, 10]
The best sorting algorithm is dependent on the specific use case and data size.
Quick Sort is efficient for large datasets due to its average time complexity of O(n log n)
Merge Sort is stable and has a time complexity of O(n log n) but requires extra space
Insertion Sort is simple and efficient for small datasets with time complexity of O(n^2)
Heap Sort is efficient and has a time complexity of O(n log n) but is not stabl
I applied via Naukri.com and was interviewed in Dec 2024. There was 1 interview round.
VARCHAR can store up to 2000 bytes while VARCHAR2 can store up to 4000 bytes.
VARCHAR can store variable-length character strings up to 2000 bytes.
VARCHAR2 can store variable-length character strings up to 4000 bytes.
VARCHAR will occupy space for NULL values while VARCHAR2 will not.
VARCHAR2 is more efficient in terms of storage and performance compared to VARCHAR.
Composite indexes are indexes that are created on multiple columns in a database table.
Composite indexes improve query performance for queries that involve multiple columns
They can be created using the CREATE INDEX statement in SQL
Example: CREATE INDEX idx_name ON table_name (column1, column2)
I applied via Recruitment Consultant and was interviewed in May 2021. There were 3 interview rounds.
based on 1 interview
Interview experience
Software Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Order Fulfillment Specialist
6
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Mechanical Engg. Design
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Tata Consumer Products
Hindustan Unilever
Dabur
Marico