Upload Button Icon Add office photos

Filter interviews by

Flow Traders Interview Questions, Process, and Tips

Updated 1 Dec 2024

Top Flow Traders Interview Questions and Answers

Flow Traders Interview Experiences

2 interviews found

Interview Questions & Answers

user image Anonymous

posted on 1 Dec 2024

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-

I applied via Job Portal

Round 1 - One-on-one 

(1 Question)

  • Q1. Difference between list and tuple

Interview Questionnaire 

7 Questions

  • Q1. How does ping command work ?
  • Ans. 

    Ping command sends packets of data to a specific IP address to test network connectivity.

    • Ping uses Internet Control Message Protocol (ICMP) to send and receive packets.

    • It measures the time taken for a packet to travel from the source to the destination and back.

    • Ping can be used to test network connectivity, troubleshoot network issues, and determine network latency.

    • Ping can also be used to determine the IP address of a...

  • Answered by AI
  • Q2. What is nmap, how to use it ?
  • Ans. 

    nmap is a network exploration and security auditing tool.

    • nmap stands for Network Mapper

    • It is used to discover hosts and services on a computer network

    • It can be used to identify open ports, operating systems, and vulnerabilities

    • nmap can be run from the command line with various options and arguments

    • Examples: nmap -sP 192.168.1.0/24 (ping scan), nmap -sV target.com (version detection)

  • Answered by AI
  • Q3. Explain man command in unix
  • Ans. 

    man command is used to display the manual pages for a command in Unix.

    • Man command provides detailed information about a command, including its syntax, options, and examples.

    • It can be used to search for commands and their descriptions using keywords.

    • Man pages are organized into sections, with each section covering a different topic.

    • To view the manual page for a command, type 'man' followed by the command name.

    • For exampl...

  • Answered by AI
  • Q4. TCP and UDP
  • Q5. What is SSH reverse tunneling ?
  • Ans. 

    SSH reverse tunneling is a technique to access a remote machine behind a firewall or NAT.

    • It allows a user to connect to a remote machine that is not directly accessible from the internet.

    • The remote machine initiates the connection to the local machine, creating a tunnel for data transfer.

    • It is useful for remote administration, accessing local resources, and bypassing firewalls.

    • Example: accessing a home computer from wo...

  • Answered by AI
  • Q6. Given a server IP, how would you go about rooting it ?
  • Ans. 

    I cannot answer this question as it goes against ethical hacking practices.

    • It is unethical and illegal to attempt to root a server without proper authorization.

    • As a Junior Trading System Engineer, it is important to prioritize ethical and legal practices in the workplace.

    • Instead, focus on learning about server security and how to prevent unauthorized access.

    • If you come across any vulnerabilities, report them to the app...

  • Answered by AI
  • Q7. XSS and XSRF

Interview Preparation Tips

Round: Resume Shortlist
Experience: Normal selection via resume for Test. Being a Mathematics student, my resume was a bit "academic".
Tips: Be thorough with your resume. I had a more "academic" resume. So was asked at 95% of the interviews "Why are you here, you should go for PhD". High CPI is not required for job, but a respectable one is required.

Round: Test
Experience: This test was mainly to check your linux skills, as the Job profile required a skilled linux guy with scripting ability. It had 2 sections, one was with normal questions and one with slightly difficult. It had questions about flags in different shell commands.
Tips: Be good with linux. I am Ubuntu user, so I was good with shell and scripting. If you are a windows user, I would highly recommend to install cygwin and practice linux scripting.
Duration: 60mins minutes
Total Questions: 50

Round: Test
Experience: Speed Math was easy for me, but was stuck with few apti questions. Practice them. Cannot say anything about personality test. Just be yourself.
Tips: Speed math requires practice. You can practice at traderstest.org. Medium to easy level will be sufficient.

Round: Technical Interview
Experience: Interviewer was fun. At the end we were discussing which beer brand is the best. (He was from UK)
Tips: Brush up your network security and linux skills. This profile requires Network security. There were few other questions which I cannot remember.

Round: Technical Interview
Experience: He was fun, he made me real comfy and I was able to think clearly while answering. He was laughing when I was answering how to root server. He said he wasn't expecting a math student to answer this question. I also told about my experience in online CTF and that I am a metasploit fan.
Tips: Interest in network security is a plus.

Skill Tips: Interest in network security and constant learning
Skills: Common Sense, Network Security, GNU/LINUX
College Name: IIT Bombay
Motivation: Being a linux geek, and network security enthusiast, this was the perfect job I could think of.
Funny Moments: Interviewer : Irrespective of job profile, since we are mainly in 3 places, NY, Amsterdam and Singapore, where would you like to join.
Me : Amsterdam
Interviewer : Why ?
Me : Sir you know the reasons.

We both were laughing our ass off !!

Skills evaluated in this interview

Junior Trading System Engineer Interview Questions asked at other Companies

Q1. Given a server IP, how would you go about rooting it ?
View answer (1)
Flow Traders Interview Questions and Answers for Freshers
illustration image

Interview questions from similar companies

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jun 2016.

Interview Questionnaire 

2 Questions

  • Q1.  Given k and DFS traversal string for a k-ary tree, construct the tree. The String contains P (if a parent) and L (if a leaf). E.g. - k=3, str="PPLLLLL" 2. All the strings are arranged in the following ord...
  • Ans. 

    The question asks to construct a k-ary tree using the given k and DFS traversal string.

    • Iterate through the DFS traversal string

    • If the current character is 'P', create a parent node

    • If the current character is 'L', create a leaf node

    • Link the nodes according to the DFS traversal order

  • Answered by AI
  • Q2. "How would you tell whether a graph has a node with n degree?"
  • Ans. 

    To determine if a graph has a node with n degree, iterate through all nodes and count their edges.

    • Iterate through each node in the graph

    • Count the number of edges connected to each node

    • If any node has n edges, then the graph has a node with n degree

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Questions on C++(Virtual fns, inheritance). Two on probability, 12 on Algorithms
Duration: 45 minutes

Round: Technical + HR Interview
Experience: He asked some more puzzles and some probability (expectation) questions. Then, he modified one question asked in the written test and asked me write code for it on paper.
Tips: First of all, prepare all the questions asked in the test before going for the interviews.


Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. What is you profession
  • Ans. 

    I am a Senior Associate in the field of finance, specializing in investment management.

    • I have expertise in analyzing financial data and making investment recommendations.

    • I work closely with clients to understand their financial goals and risk tolerance.

    • I monitor market trends and economic indicators to make informed investment decisions.

    • I have experience in portfolio management and asset allocation.

    • I may hold certifica...

  • Answered by AI
  • Q2. What is your ambition
  • Ans. 

    My ambition is to become a respected leader in my field, making a positive impact through innovative solutions and mentorship.

    • To continuously learn and grow in my role

    • To lead and inspire a team towards success

    • To contribute to the advancement of the organization and industry

    • To mentor and guide junior colleagues in their professional development

  • Answered by AI

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.

  • Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
  • Ans. 

    To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.

    • Understand the problem statement and expected output.

    • Review the code for syntax errors, logical errors, and potential bugs.

    • Use debugging tools like breakpoints, print statements, and IDE debuggers.

    • Test the code with different inputs to identify the bug.

    • Make necessary corrections based on the iden...

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.

    • Traverse the binary tree to find the target node.

    • Use BFS to traverse the tree from the target node to nodes at distance K.

    • Keep track of the distance while traversing the tree.

    • Return the values of nodes at distance K in any order.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

  • Q1. 

    Subarray Challenge: Largest Equal 0s and 1s

    Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.

    Input:

    Input beg...

  • Ans. 

    Find the length of the largest subarray with equal number of 0s and 1s in a given array.

    • Iterate through the array and maintain a count of 0s and 1s encountered so far.

    • Store the count difference in a hashmap with the index as the key.

    • If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

    • Return the length of the longest subarray found.

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.

Interview Preparation Tips

Eligibility criteriaNeeded Work Experience in a leading Tech CompanyTower Research Capital interview preparation:Topics to prepare for the interview - Dynamic Programming, Data Structures - Sets, HashMap, Priority Queue, SQL, OOPS, Operating System, AlgorithmsTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.

Application resume tips for other job seekers

Tip 1 : Mention the projects you worked on in your past work experience and how it helped your company.
Tip 2 : Keep your resume up to date in accordance with the role you are applying for
Tip 3 : Don't put false things on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Feb 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Consisted of 3 DSA questions and MCQ on python proficiency

  • Q1. 

    Palindromic Substrings Problem Statement

    Given a string S, your task is to return all distinct palindromic substrings of the given string in alphabetical order.

    Explanation:

    A string is considered a pal...

  • Ans. 

    Return all distinct palindromic substrings of a given string in alphabetical order.

    • Iterate through all possible substrings of the given string.

    • Check if each substring is a palindrome by comparing it with its reverse.

    • Store all palindromic substrings in a set to ensure uniqueness.

    • Return the sorted list of palindromic substrings.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

It was a pure DSA round and interviewer was very helpful with providing significant hints to solve the given problems

  • Q1. 

    Island Perimeter Calculation Problem

    Given a binary grid representation of a map of an island, calculate the perimeter of the island. The grid uses '0' for water and '1' for land.

    The grid has only one i...

  • Ans. 

    Calculate the perimeter of an island represented by a binary grid.

    • Iterate through the grid and count the perimeter based on land cells and their adjacent cells.

    • Each land cell contributes 4 units to the perimeter, subtract 2 units for each adjacent land cell.

    • Handle edge cases where land cells are at the boundaries of the grid.

    • Return the total perimeter for each test case.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

DSA+OS

  • Q1. 

    Clearing the Forest Problem Statement

    Ninja lives in a city called Byteland where a festive event is being organized. To make space for this event, Ninja is tasked with clearing a nearby forest. The fores...

  • Ans. 

    Calculate the minimum number of steps Ninja needs to cut down all trees in a forest grid.

    • Iterate through the grid to find the shortest path to cut down all trees in order.

    • Use a priority queue to keep track of the shortest trees to cut next.

    • If it's impossible to cut all trees, return -1.

    • Consider all four cardinal directions for movement in the grid.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaPython ProficiencyTower Research Capital interview preparation:Topics to prepare for the interview - Data Structures, Algorithms , OOPS , DBMS , OSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 250 questions
Tip 2 : Do at least two projects
 

Application resume tips for other job seekers

Tip 1 : Should be covered in One page
Tip 2 : Project description should be professional

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jun 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 70 Minutes
Round difficulty - Hard

The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.

  • Q1. 

    Unweighted Graph Shortest Path Problem

    You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N houses numbered from 1 ...

  • Ans. 

    Find the shortest path between two houses in a city represented as an unweighted graph.

    • Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.

    • Start BFS from the source house and keep track of the path taken to reach each house.

    • Once the destination house is reached, backtrack from destination to source to find the shortest path.

    • Consider using a queue data structure to implement BFS eff...

  • Answered by AI
  • Q2. 

    Check If Two Nodes Are Cousins

    You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a and b. Your task is to determine if ...

  • Ans. 

    Check if two nodes in a binary tree are cousins by comparing their levels and parents.

    • Traverse the tree to find the levels and parents of the given nodes.

    • Compare the levels and parents of the two nodes to determine if they are cousins.

    • If the levels are the same and the parents are different, the nodes are cousins.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It contained two programming questions.

  • Q1. 

    Counting Nodes in a Complete Binary Tree - Problem Statement

    Given the root of a complete binary tree, calculate the total number of nodes in this tree.

    A complete binary tree is defined as a binary tree...

  • Ans. 

    Count the total number of nodes in a complete binary tree given its root.

    • Traverse the tree in level order and count the nodes

    • Use a queue to keep track of nodes at each level

    • Check for null nodes represented by -1 in the input

    • The total number of nodes in the example tree is 7

  • Answered by AI
  • Q2. 

    Rearrange Array Numbers for Largest Possible Number

    Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt...

  • Ans. 

    Rearrange array numbers to form the largest possible numerical value by combining digits of each number in the array.

    • Convert integers in the array to strings for easier manipulation.

    • Sort the array of strings in non-increasing order based on custom comparison function.

    • Join the sorted strings to form the largest possible number.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

This was more of a interaction round with some technical skills.

  • Q1. Can you explain the ACID properties and the rollback mechanism in DBMS?
  • Ans. 

    ACID properties ensure database transactions are processed reliably. Rollback mechanism undoes changes if transaction fails.

    • ACID properties: Atomicity, Consistency, Isolation, Durability

    • Atomicity ensures all operations in a transaction are completed successfully or none at all

    • Consistency ensures database remains in a valid state before and after transaction

    • Isolation ensures transactions are independent and do not inter...

  • Answered by AI

Interview Preparation Tips

Eligibility criteria8 CGPATower Research Capital interview preparation:Topics to prepare for the interview - DSA and Algorithms, OOPS, Database, OS, NetworksTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Focus on different varieties of problems, quality of problems matter greater than the quantity.
Tip 2 : Focus on design thinking, that will help in rounds other than problem solving.

Application resume tips for other job seekers

Tip 1 : Focus on demonstrating your academic excellence and course projects
Tip 2 : Mention internship details with clarity

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in May 2022.

Round 1 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

The interviewer was friendly. Explained the question well. Allowed to use any preferred platform to write code.

  • Q1. 

    Best Time to Buy and Sell Stock Problem Statement

    Given an array prices representing the prices of a stock where each element indicates the price at a given minute, determine the maximum profit you can ac...

  • Ans. 

    Find the maximum profit by buying and selling a stock once based on given prices.

    • Iterate through the prices array and keep track of the minimum price seen so far and the maximum profit achievable.

    • Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.

    • Return the maximum profit, ensuring it is not negative.

    • Example: prices = [2, 100, 150, 120], Buy at 2, sell a

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Dance Team Pairing Challenge

    Imagine you are helping Ninja, a dance coach, who needs to form dance pairs from the available boys and girls in a studio. Given the number of boys N, the number of girls M, a...

  • Ans. 

    The challenge involves forming dance pairs from available boys and girls based on potential pairings to maximize the number of pairs.

    • Parse the input to get the number of test cases, boys, girls, and potential pairings.

    • Iterate through the potential pairings and form pairs based on the given indexes.

    • Output '1' if a set of maximum possible pairs is returned, else output '0'.

    • There can be multiple valid configurations of pa...

  • Answered by AI
  • Q2. What is the difference between multiprocessing and multithreading?
  • Ans. 

    Multiprocessing involves multiple processes running concurrently, while multithreading involves multiple threads within a single process.

    • Multiprocessing utilizes multiple processes to execute tasks simultaneously.

    • Multithreading involves multiple threads within a single process sharing the same memory space.

    • Multiprocessing is typically used for CPU-bound tasks, while multithreading is more suitable for I/O-bound tasks.

    • E...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Hard

  • Q1. Can you describe the classes and functions involved in the design of a system like Splitwise?
  • Ans. 

    Splitwise is a system for managing shared expenses among groups of people.

    • Classes: User, Expense, Group

    • Functions: addExpense(), settleUp(), calculateBalance()

  • Answered by AI
Round 4 - Video Call 

Round duration - 60 Minutes
Round difficulty - Hard

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in GurgaonEligibility criteriaNo criteriaTower Research Capital interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Low level design, High Level Design, Relational Database Management Systems, Operating SystemsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 5 questions of each topic of various difficulty levels
Tip 2 : Read out theory articles about your preferred language showing your proficiency in the same.
Tip 3 : Hard work is overrated, consistency is the key.

Application resume tips for other job seekers

Tip 1 : Own everything you have there, do not add random skills that you are not proficient in.
Tip 2 : Keep it clean and try to give out minimal but most of the relevant information for the role.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Coding Test 

DSA medium level questions were asked.

Round 2 - One-on-one 

(2 Questions)

  • Q1. Design MakeMyTrip kind of application.
  • Ans. 

    MakeMyTrip is a travel booking application that allows users to book flights, hotels, and holiday packages.

    • Include features like flight/hotel search, booking, payment gateway integration, and user profiles.

    • Implement filters for search results, reviews/ratings for hotels, and notifications for booking updates.

    • Integrate maps for location tracking, weather forecasts, and customer support chatbot.

    • Offer discounts, loyalty p...

  • Answered by AI
  • Q2. Oops based questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well for LLD.

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Flow Traders Interview FAQs

How many rounds are there in Flow Traders interview?
Flow Traders interview process usually has 1 rounds. The most common rounds in the Flow Traders interview process are One-on-one Round.
What are the top questions asked in Flow Traders interview?

Some of the top questions asked at the Flow Traders interview -

  1. Given a server IP, how would you go about rooting i...read more
  2. What is SSH reverse tunnelin...read more
  3. How does ping command wor...read more

Recently Viewed

INTERVIEWS

Optiver

No Interviews

SALARIES

Saint-Gobain

INTERVIEWS

Roland Berger

No Interviews

INTERVIEWS

India Cements

No Interviews

INTERVIEWS

InMobi

No Interviews

INTERVIEWS

RITES

No Interviews

INTERVIEWS

Infovision

No Interviews

INTERVIEWS

JK Cement

No Interviews

INTERVIEWS

HIL Limited

No Interviews

LIST OF COMPANIES

Saint-Gobain

Overview

Tell us how to improve this page.

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 424 Interviews
BigBasket Interview Questions
3.9
 • 356 Interviews
Udaan Interview Questions
3.9
 • 333 Interviews
CARS24 Interview Questions
3.6
 • 329 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Jane Street Interview Questions
5.0
 • 7 Interviews
SIG Plc Interview Questions
3.3
 • 1 Interview
View all
Compare Flow Traders with

Optiver

4.6
Compare

Indian Molasses Company

3.8
Compare

Jane Street

5.0
Compare

SIG Plc

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent