i
Hughes Systique
Corporation
Filter interviews by
I appeared for an interview in Aug 2021.
Round duration - 90 Minutes
Round difficulty - Medium
MCQ on programming basics and two coding questions. medium to hard
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
The 0/1 Knapsack Problem involves maximizing the total value of items a thief can steal within a given weight limit.
Dynamic programming can be used to solve this problem efficiently.
Create a 2D array to store the maximum value that can be stolen at each weight capacity.
Iterate through the items and update the array based on whether the item is included or not.
The final answer will be the value at the last cell of the a...
Round duration - 60 Minutes
Round difficulty - Easy
Interview was good and on time and questions on map,and sorting algorithms,OOPS
Given an array of integers arr
, determine the length of the longest contiguous subarray that sums to zero.
N (an integer, the length of the array)
arr (...
Find the length of the longest contiguous subarray that sums to zero in an array of integers.
Iterate through the array and keep track of the running sum and its corresponding index in a hashmap.
If the running sum is seen again, calculate the length of the subarray by subtracting the current index from the index stored in the hashmap.
Update the maximum length of the subarray as you iterate through the array.
Examples of OOP concepts using code and principles
Encapsulation: Using private variables and getter/setter methods
Inheritance: Creating subclasses that inherit properties and methods from a superclass
Polymorphism: Implementing methods with the same name but different functionality in subclasses
Round duration - 30 Minutes
Round difficulty - Easy
Round with Manager. Questions like why do you want to join and which tech stack you will work on
Tip 1 : easy-medium dsa questions majorly on maps,arrays,recursions,stacks,queues
Tip 2 : Topics mentioned in resume should be on fingertips
Tip 3 : question on OOPs and Projects questions should be prepared
Tip 1 : 2 projects are must and questions to be prepared on them
Tip 2 : Basic Level questions should be prepared well
Tip3 : programming language mentioned in resume should be prepared
Top trending discussions
Using fetch API to make requests to a sandbox environment for testing purposes.
Use the fetch function to make HTTP requests to the sandbox URL
Handle the response using promises and the .then() method
Set the appropriate headers and request method for the API endpoint
Parse the response data using JSON methods if needed
posted on 23 Jul 2023
I applied via Recruitment Consulltant and was interviewed in Jun 2023. There were 4 interview rounds.
I applied via LinkedIn and was interviewed before Jul 2023. There were 2 interview rounds.
10 apti test questions with 2 coding and query based questions
2 programing questions with core python concept
I applied via Referral and was interviewed before Jan 2024. There were 3 interview rounds.
posted on 27 Mar 2025
I appeared for an interview before Mar 2024, where I was asked the following questions.
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Online coding test with Sql and python questions
Spark context is the main entry point for Spark functionality and represents the connection to a Spark cluster.
Main entry point for Spark functionality
Represents connection to a Spark cluster
Used to create RDDs, broadcast variables, and accumulators
SparkConfig is a configuration object used in Apache Spark to set various parameters for Spark applications.
SparkConfig is used to set properties like application name, master URL, and other Spark settings.
It is typically created using SparkConf class in Spark applications.
Example: val sparkConf = new SparkConf().setAppName("MyApp").setMaster("local")
I appeared for an interview before Dec 2020.
Round duration - 120 minutes
Round difficulty - Easy
After round 1 there was a break of 15 mins and the coding round started.
We had a choice to attempt the exam in R language & SQL or python & sql
I chose python and sql
It had 8 questions 4 python and 4 sql
Given two strings, S
and T
with respective lengths M
and N
, your task is to determine the length of their longest common subsequence.
A subsequence is a seque...
The task is to find the length of the longest common subsequence between two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For strings 'abcde' and 'ace', the longest common subsequence is 'ace' with leng...
Round duration - 15 minutes
Round difficulty - Medium
The interview was mostly analytical based and how you approach the round a few technical questions in dbms and oops were also asked.
Round duration - 20 Minutes
Round difficulty - Medium
Similar to first round
For Shortlists after elimination from first round.
You are a cab driver with a car that initially has 'C' empty seats. The car moves in a straight line towards the forward direction only. Your job is to determine if it is poss...
Determine if it is possible to accommodate all passenger trips within a car's capacity without exceeding it at any point.
Iterate through each trip and keep track of the total number of passengers in the car at each point.
Check if the total number of passengers exceeds the car capacity at any point.
Return 'True' if all trips can be accommodated within the car capacity, otherwise return 'False'.
Round duration - 20 minutes
Round difficulty - Easy
After two technical round interviews, the last round was a hr interview. The whole process can take up one whole day or more and your interview can be at any time
My process started at 5 pm and ended at 10:30 pm
All the interviewers were very friendly no pressure.
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 iterate to calculate subsequent Fibonacci numbers.
Time complexity can be optimized to O(N) using dynamic programming.
Example: For N = 5, the 5th Fibonacci number is 5.
Tip 1 : Be fast ans accurate on your aptitude amd verbal tests.
Tip 2 : In coding round, depending on the difficulty of the questions the time in which you complete solving them should decrease .If almost everyone can solve them timming comes in to the equation for shortlisting
Tip 3 : While submitting your resume, please be honest about the projects you have done and do not bluff about it because in the interview when you ate drilled abt it, they can catch you easily.
Tip 4 : be confident and answer every question to the best of your ability and if u don't know something, tell them you don't know abt it .
Tip 1 : Research the company and put the most revalent projects and skills that the company os looking for specifically
Tip 2 : Do not bluff or lie on your resume. It show's during the interview.
Principal Engineer
308
salaries
| ₹11.2 L/yr - ₹37.5 L/yr |
Senior Engineer
260
salaries
| ₹7.5 L/yr - ₹22 L/yr |
Senior Software Engineer
221
salaries
| ₹7.2 L/yr - ₹23 L/yr |
Software Engineer
176
salaries
| ₹4.5 L/yr - ₹14 L/yr |
Engineer
106
salaries
| ₹5.5 L/yr - ₹14.5 L/yr |
Fractal Analytics
Kiya.ai
MathCo
Innovatiview India Ltd