Flex Software Engineer Interview Questions and Answers

Leetcode Medium quesions

DSA and other questions

Duration: 75 min
Platform: HakerRank

It was easy.The gd topic was based on the current affairs like chatgpt replaces human activities

Q1. It was all about oops concepts and basic in sql
Add your answer
Q2. It is general HR discussion
Add your answer

Assigned data analysis project

Q1. Tell me about your self
Ans. 
I am a passionate software engineer with experience in developing web applications using various technologies.
• Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular

• Proficient in backend development with Node.js and databases like MongoDB and MySQL

• Familiar with version control systems like Git and project management tools like Jira
Answered by AI
Add your answer
Q2. Tell abt the projects
Ans. 
Developed a web application for tracking inventory and sales data
• Used React.js for front-end development

• Implemented RESTful APIs using Node.js and Express

• Utilized MongoDB for database management
Answered by AI
Add your answer

Round duration - 30. minutes
Round difficulty - Easy

It was in the evening, question were moderate

Q1. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Ans. Brute Force
The idea is to generate all the subsequences and check whether the elements present are equal or not.
 
Here is the algorithm :
 
1. Generate all the subsequences of the given array.
2. Maintain a variable ‘COUNT’ which stores the total number of subsequences in which all the elements are equal.
3. Iterate over each of the generated subsequences.
   1. In case all the elements of the current subsequence are equal, we in...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the night around 9:00 PM.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. Brute Force
• Initialize a list to store our results.
• For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
• If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered Anonymously
Add your answer