i
Infovision
Filter interviews by
Built a data engineer pipeline to ingest, process, and analyze large volumes of data for real-time insights.
Designed and implemented data ingestion process using tools like Apache Kafka or AWS Kinesis.
Developed data processing workflows using technologies like Apache Spark or Apache Flink.
Built data storage solutions using databases like Apache HBase or Amazon Redshift.
Implemented data quality checks and monitoring mec...
Extract values from a data frame in a continuous time interval
Top trending discussions
I applied via Naukri.com and was interviewed before Mar 2020. There were 4 interview rounds.
Hashtable is synchronized while hashmap is not.
Hashtable is thread-safe while hashmap is not.
Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.
Hashtable is slower than hashmap due to synchronization.
Hashtable is a legacy class while hashmap is a newer implementation.
Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.
Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.
Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.
Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.
Concurrent Hashmap is slower than Hashma...
I appeared for an interview in Sep 2017.
I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.
I appeared for an interview in Sep 2019.
I applied via Recruitment Consultant and was interviewed before Jan 2020. There were 5 interview rounds.
I am proficient in Java, Python, and C++. I have 2 years of experience in software development. I have excellent communication skills for client interaction.
Proficient in Java, Python, and C++
2 years of software development experience
Excellent communication skills for client interaction
I applied via first naukari and was interviewed before Oct 2020. There were 4 interview rounds.
To find the shortest path in a graph stored in SQL, use algorithms like Dijkstra's or A* with SQL queries for traversal.
Use Dijkstra's algorithm for weighted graphs to find the shortest path efficiently.
For unweighted graphs, consider using Breadth-First Search (BFS).
Store graph edges in a table with columns for source, destination, and weight.
Example SQL query: SELECT * FROM edges WHERE source = 'A' AND destination = ...
based on 1 interview experience
Softwaretest Engineer
333
salaries
| ₹2.6 L/yr - ₹6.2 L/yr |
Senior Software Engineer
320
salaries
| ₹10.8 L/yr - ₹20 L/yr |
Software Engineer
281
salaries
| ₹4 L/yr - ₹8.3 L/yr |
Technical Specialist
205
salaries
| ₹14.4 L/yr - ₹27 L/yr |
Technical Lead
187
salaries
| ₹16.9 L/yr - ₹29.7 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant