i
Infovision
Filter interviews by
I applied via Referral and was interviewed in Jul 2020. There were 4 interview rounds.
To drive sales at Infovision, I plan to implement various lead generation strategies and focus on building strong customer relationships.
Implement targeted digital marketing campaigns to reach potential customers
Offer promotions and discounts to incentivize purchases
Develop referral programs to encourage current customers to refer new business
Attend industry events and conferences to network and generate leads
Invest in...
Top trending discussions
I applied via Walk-in and was interviewed before Dec 2021. There were 3 interview rounds.
The planning if the project and how to take over the project
We should maintain the aptitude to with our project and with with
I applied via Approached by Company and was interviewed before Oct 2021. There were 2 interview rounds.
I have X years of domain experience.
I have worked in this domain for X years.
During my time in this domain, I have gained expertise in various areas such as...
I have worked on projects related to...
I have experience working with clients in this domain.
I keep myself updated with the latest trends and developments in this domain.
I applied via Naukri.com and was interviewed before Sep 2020. There were 5 interview rounds.
I applied via Referral and was interviewed in Sep 2020. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 6 interview rounds.
I applied via Company Website and was interviewed in Dec 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
Hashmap is key-value pair collection while Hashset is a unique value collection.
Hashmap allows duplicate values but not duplicate keys while Hashset only allows unique values.
Hashmap uses key to access values while Hashset uses object reference.
Hashmap is faster for accessing values while Hashset is faster for checking if a value exists.
Example: Hashmap - {1: 'apple', 2: 'banana', 3: 'apple'}, Hashset - {'apple', 'bana
Hashmap is a data structure that stores key-value pairs and uses hashing to locate values based on their keys.
Hashmap uses an array to store the key-value pairs
The key is hashed to generate an index in the array
If multiple keys hash to the same index, a linked list is used to store them
Hashmap provides constant time complexity for insertion, deletion, and retrieval of values
Java's HashMap class is an implementation of
Softwaretest Engineer
311
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
300
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
254
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
182
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Specialist
154
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Wipro
HCLTech
Tech Mahindra