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 was interviewed in Apr 2017.
I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.
Experienced software developer
Passionate about coding and problem-solving
Supportive family that encourages my career in tech
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was an easy round which went really smooth.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using F(n-1) and F(n-2).
Ensure the input N is within the constraints 1 <= N <= 10000.
Example: For N = 5, the 5th Fibonacci number is 5 (1, 1, 2, 3, 5).
Given a positive integer N
, your task is to determine and return all prime numbers less than or equal to N
.
N = 10
2 3 5 7
N = 20
Implement a function to return all prime numbers less than or equal to a given positive integer N.
Create a function that takes a positive integer N as input
Iterate from 2 to N and check if each number is prime
Use a helper function to determine if a number is prime
Return an array of all prime numbers less than or equal to N
A merge join in SQL is a method of combining two sorted datasets by matching corresponding rows based on a specified condition.
Merge join is used when joining two large datasets that are already sorted.
It is more efficient than other join methods like nested loop join or hash join for sorted datasets.
The join condition must be an equality condition.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.i
Round duration - 30 minutes
Round difficulty - Easy
The round went excellent. I really enjoyed it. Just be confident about whatever you answer
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This round went well. Interview depends on your basic knowledge of C/C++.
Given two sparse matrices MAT1
and MAT2
of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...
Implement a function to multiply two sparse matrices and return the resulting matrix.
Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication
Iterate through the non-zero elements of the matrices to perform the multiplication efficiently
Handle the edge cases such as empty matrices or matrices with all zero elements
Ensure the dimensions of the matrices are compatible
Tanmay and Rohit are best buddies. Tanmay gives Rohit a challenge involving an array of N natural numbers. The task is to perform and answer a series of queries on the ...
Count the number of even or odd numbers in a range of an array based on given queries.
Create an array to store the input numbers.
Iterate through the queries and update or count even/odd numbers based on the query type.
Output the count of even or odd numbers for each query of type 1 or 2.
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
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