i
FranConnect
Filter interviews by
I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.
Developed a real-time data processing system for analyzing customer behavior on an e-commerce platform.
Designed and implemented data pipelines using Apache Kafka for streaming data ingestion.
Utilized Apache Spark for data processing and analysis to generate insights for business decisions.
Implemented machine learning models for customer segmentation and personalized recommendations.
Collaborated with cross-functional te...
I applied via Approached by Company and was interviewed in Aug 2023. There were 2 interview rounds.
2 medium level DSA questions
Java basics, streams fundamentals
SQL
Low level design
Priority queue is a data structure that stores elements based on their priority level.
Use a binary heap to implement a priority queue efficiently.
Elements are inserted based on priority and removed in order of priority.
Example: Inserting elements with priorities 5, 3, 7 would result in removal order of 3, 5, 7.
I applied via Company Website and was interviewed in Aug 2023. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Nov 2023. There was 1 interview round.
Gave me a table, asked to replicate the same in Python using different methods.
FranConnect interview questions for popular designations
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
HashMap is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values.
HashMap uses an array of buckets to store key-value pairs.
Each key is hashed to determine its index in the array.
If multiple keys hash to the same index, a linked list or tree is used to handle collisions.
HashMap allows null keys and values.
HashMap is not synchronized, use ConcurrentHashMap for thread-safe operations
I applied via Naukri.com and was interviewed before Feb 2023. There were 2 interview rounds.
String manipulation Questions
Rotate array by N positions
Use a temporary array to store the elements that will be rotated
Loop through the original array and copy the elements to the temporary array based on the rotation
Loop through the temporary array and copy the elements back to the original array
Handle cases where N is greater than the array length by using modulo operator
I applied via Naukri.com and was interviewed in Jun 2021. There were 6 interview rounds.
Top trending discussions
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
based on 8 interviews
Interview experience
based on 49 reviews
Rating in categories
Software Developer
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Developer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Analyst
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Software Developer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Zoho
Freshworks
Tally Solutions
LTIMindtree