Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Flexera Software Software Engineer Interview Questions and Answers

Updated 1 Apr 2023

Flexera Software Software Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - Technical 

(1 Question)

  • Q1. Related to DSA, language was Golang, mandatory, based on my profile
Round 3 - Technical 

(1 Question)

  • Q1. Related to DSA and my previous company work experience
Round 4 - Technical 

(1 Question)

  • Q1. DSA, Concurrency in Golnag, my previous company work experience and Cloud knowledge, Docker Kubernetes Knowledge
Round 5 - One-on-one 

(1 Question)

  • Q1. Manegerial round, with my team manager

Interview Preparation Tips

Interview preparation tips for other job seekers - 1. Understand concurrent programming in depth
2. Do not memorize coding questions
3. If stuck, honestly tell and request for some other question
4. Don't fake any past experience

Interview questions from similar companies

I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. Questions on linked list
  • Q2. Questions on resume
  • Q3. About my interests
  • Q4. My interest in symantec
  • Q5. Place to work

Interview Preparation Tips

College Name: IIT Madras

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. How you find loop in a linked list
  • Ans. 

    To find a loop in a linked list, we use Floyd's cycle-finding algorithm.

    • Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.

    • If there is a loop in the linked list, the two pointers will eventually meet.

    • To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.

    • The meeting point is the start of the loop.

  • Answered by AI
  • Q2. What is LRU, MRU and LFU
  • Ans. 

    LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.

    • LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.

    • MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.

    • LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...

  • Answered by AI
  • Q3. Camel banana problem

Interview Preparation Tips

Round: Test
Experience: coding test in hacker rank. can code in any language except in C and C++.
Duration: 1 hour
Total Questions: 2

Round: Technical Interview
Experience: In technical round the questions are on OS, basics of C(mainly in linked lists) and maths puzzle

They mostly see how you are approaching towards a problem.
It is first time that I heard the camel banana problem. So I struggled for some time and came up with a solution. He said he liked the approach but it can be optimized.

Round: HR Interview
Experience: It started with explain about yourselves. and then he asked to explain about one project with technical details. Later he asked me to explain binary search for a guy who don't know much of technical knowledge. He continued with why we only do 2 partitions why can we make it up to 3. Later he asked me what I liked most in my mobile phone. I said chatting apps. So he asked me that if I was hired as a developer to make a chatting app how will I do it.
Tips: way of thinking and way of approaching towards a problem.

Round: HR Interview
Experience: This round was focused mainly on whether I like to work in Bangalore or not. How I first heard about Symantec. how I will suit for the company. what are my future plans.

Skills: C, OS, Math Puzzles
College Name: IIT Madras

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basic programming questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident with answers

I applied via Campus Placement and was interviewed before Mar 2020. There were 3 interview rounds.

Interview Questionnaire 

9 Questions

  • Q1. Tell me about yourself. / Introduce your self
  • Q2. Asked me about the mini project and the domain used in the mini project. Role played by me in the development of project. If front end coder or back end coder is your answer then you should be aware of wha...
  • Q3. What are the programming languages on which I have knowledge regarding.
  • Ans. 

    I have knowledge in multiple programming languages.

    • Java

    • Python

    • C++

    • JavaScript

  • Answered by AI
  • Q4. Some questions related to programming languages like C, Java.(since I have mentioned them in my resume).Asked me to explain some oops concepts with real time examples. Also asked me questions on data base ...
  • Q5. Gave me a problem statement to write the code in my preferred programming language.
  • Q6. Any certification courses that you have undergone. If yes, then you should be aware of what is the knowledge you have gained by doing that certification course.
  • Q7. Asked about internship experience and what are the concepts and projects done during the internship process.
  • Q8. Asked me if I have account in any of the online code practicing platform like hacker rank/ leet code/ hacker earth etc., and if I practice coding through those sites.
  • Q9. Asked me if it is okay for me to relocate to any place.

Interview Preparation Tips

Interview preparation tips for other job seekers - Whenever you are going for an interview in any company make sure you have confidence in you. Try to handle the situation without experiencing any stress. Even though if it is your first interview don't get stressed or don't get nervous.
while attending the technical round, be sure that you have good knowledge on the concepts which you have mentioned in your resume. Do not keep any programming languages that you are not aware of. Make your mind prepared to solve the coding question if asked during the interview. If you don't know the answer for any question don't tell something wrong answer. Ask the interviewer for excuse in a polite manner.
while attending HR round, be mentally strong and manage your emotions. It is advised for every one to know about the company ie., basic details of the company, CEO, branches if that company, products etc., If you were given any case study, then first refresh your mind and think about the best possible way for that.

I was interviewed in Apr 2021.

Interview Questionnaire 

1 Question

  • Q1. Round 1 - There was a assessment test conducted in Hacker rank platform. Round 2 - Cognitive Assessment. Its a gaming round and it is easy to clear this round if you have cognitive skill...

I was interviewed before May 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored

  • Q1. 

    Combination Sum Problem Statement

    Given three integers X, Y, and Z, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum of X, Y, and Z ...

  • Ans. 

    Calculate the sum of all numbers that can be formed using the digits 3, 4, and 5 with given constraints.

    • Iterate through all possible combinations of 3, 4, and 5 based on the given constraints.

    • Calculate the sum of each combination and add them up.

    • Return the final sum modulo 10^9 + 7.

  • Answered by AI
  • Q2. 

    Longest Path In Directed Graph Problem Statement

    Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'....

  • Ans. 

    The task is to find the longest distances from a source node to all nodes in a weighted directed acyclic graph.

    • Implement a function that takes the number of nodes, edges, source node, and edge weights as input.

    • Use a topological sorting algorithm to traverse the graph and calculate the longest distances.

    • Return an array of integers where each element represents the longest distance from the source node to the correspondi

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Easy

Timing - 9:00 AM - 9:40 AM

  • Q1. 

    Factorial Trailing Zeros Problem

    You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.

    Example:

    Input:
    N = 1
    Output:
    ...
  • Ans. 

    Find the smallest number whose factorial has at least N trailing zeros.

    • Calculate the number of 5's in the prime factorization of the factorial to determine the trailing zeros.

    • Use binary search to find the smallest number with at least N trailing zeros.

    • Consider edge cases like N = 0 or N = 1 for factorial trailing zeros problem.

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, your task is to return the head of the reversed linked list.

    Example:

    Input:
    The given linked list is 1 -> 2 -> 3 -&g...
  • Ans. 

    To reverse a singly linked list of integers, return the head of the reversed linked list.

    • Iterate through the linked list, reversing the pointers to point to the previous node instead of the next node.

    • Keep track of the previous, current, and next nodes while traversing the list.

    • Update the head of the reversed linked list to be the last element of the original list.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Easy

Timing - 12:00 Pm to 12:40 PM

  • Q1. 

    Implementing a Priority Queue Using Heap

    Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...

  • Ans. 

    Implement a priority queue using a heap data structure by completing the provided functions: push(), pop(), getMaxElement(), and isEmpty().

    • Understand the operations: push() to insert element, pop() to remove largest element, getMaxElement() to return largest element, and isEmpty() to check if queue is empty.

    • Implement a heap data structure to maintain the priority queue.

    • Handle different types of queries based on the inp...

  • Answered by AI
  • Q2. 

    Largest BST Subtree Problem

    Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).

    Input:

    The first line contains an integer 'T', represen...
  • Ans. 

    The problem involves finding the size of the largest subtree that is also a Binary Search Tree in a given binary tree.

    • Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.

    • Keep track of the size of the largest BST subtree encountered so far.

    • Use recursion to solve the problem efficiently.

    • Consider edge cases like empty tree or single node tree.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

Timing - 6:00 PM - 6:30 PM

  • Q1. Can you design a system similar to Splitwise and identify three features that you would change or improve?
  • Ans. 

    Design a system similar to Splitwise and suggest three features for improvement.

    • Implement a real-time notification system for updates on shared expenses

    • Integrate a feature for automatic currency conversion for international transactions

    • Enhance the user interface with data visualization tools for better expense tracking

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Netaji Subhas University Of Technology. I applied for the job as Associate Software Engineer in BangaloreEligibility criteriaNo criteriaSalesforce interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming, OOPS, OS, DBMS.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : For fresher role, System design is not very important.
Tip 2 : Do at least 1-2 good quality projects.
 

Application resume tips for other job seekers

Tip 1 : Have 1-2 good engaging projects in resume.
Tip 2 : Internships are helpful.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Jul 2022. There were 4 interview rounds.

Round 1 - Aptitude Test 

Conducted on their platform for 120 minutes

Round 2 - Technical 

(2 Questions)

  • Q1. I was asked to find subarray Max Sum
  • Q2. I was asked to find diameter of a binary Tree
  • Ans. 

    To find the diameter of a binary tree, we need to find the longest path between any two nodes in the tree.

    • Traverse the tree recursively and calculate the height of the left and right subtrees.

    • Calculate the diameter of the left and right subtrees recursively.

    • The diameter of the tree is the maximum of the following three values: 1. Diameter of the left subtree 2. Diameter of the right subtree 3. Height of the left sub...

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. DBMS, Computer Networks and Operating System Questions
Round 4 - Technical 

(1 Question)

  • Q1. Mainly on cloud, microservices and distributed processing

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and make sure you go through all the fundamentals

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Apr 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - Coding Test 

String manipulation problems from geeks for geeks with some medium and hard problems in DSA from leetcode

Round 3 - Technical 

(3 Questions)

  • Q1. String manipulation and tree twisted problems
  • Q2. Some 2d matrix popular problems like sudoku
  • Q3. Graph basic level implementation
  • Ans. 

    Graph implementation involves creating nodes and edges to represent data and relationships.

    • Nodes represent data points and edges represent relationships between them

    • Graphs can be directed or undirected

    • Common graph algorithms include BFS, DFS, and Dijkstra's algorithm

  • Answered by AI
Round 4 - One-on-one 

(4 Questions)

  • Q1. Puzzles to test decision making abilities
  • Q2. Some theory technical questions in Java and springboot.
  • Q3. What is string pool ?
  • Ans. 

    String pool is a cache of string literals stored in memory for efficient reuse.

    • String pool is a part of Java's memory management system.

    • It stores a collection of unique string literals to save memory.

    • When a new string is created, it is first checked in the pool and reused if already present.

    • String pool can be accessed using the intern() method.

    • Example: String s1 = "Hello"; String s2 = "Hello"; s1 and s2 will point to t

  • Answered by AI
  • Q4. Why strungs are not mutavle in java ?
  • Ans. 

    Strings are immutable in Java to ensure thread safety and prevent unintended changes.

    • Immutable objects are safer to use in multi-threaded environments

    • String pool optimization is possible because of immutability

    • StringBuffer and StringBuilder classes are available for mutable string operations

  • Answered by AI
Round 5 - HR 

(3 Questions)

  • Q1. Basic discussion like salary and other benefit
  • Q2. Why you choose oracle ?
  • Q3. How you overcome challenges?

Interview Preparation Tips

Topics to prepare for Oracle Associate Software Engineer interview:
  • Linked list
  • Stringing
  • Graph
  • Tree
  • Java
Interview preparation tips for other job seekers - You need to be a really good at DSA to Crack oracle with some puzzles and language specific problems.
Be confident and present you solutions clearly,
Try to communicate while solving problems.
Ask relevant questions at the end

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Mar 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Technical 

(3 Questions)

  • Q1. Common Elements in two Sorted Linked List
  • Ans. 

    Finding common elements in two sorted linked lists.

    • Traverse both lists simultaneously using two pointers.

    • Compare the values of the nodes pointed by the two pointers.

    • If they are equal, add the value to the result list and move both pointers.

    • If not, move the pointer pointing to the smaller value.

    • Repeat until one of the lists is fully traversed.

  • Answered by AI
  • Q2. Kth element after merging two sorted arrays
  • Ans. 

    Finding the Kth element after merging two sorted arrays.

    • Merge the two sorted arrays into a single array.

    • Sort the merged array.

    • Return the Kth element from the merged and sorted array.

  • Answered by AI
  • Q3. A good amount of OOPS?DBMS questions, small keywords used in project, data flow in projects were asked
Round 3 - Technical 

(2 Questions)

  • Q1. Detailed concepts about OOPS and DBMS
  • Ans. 

    OOPS is a programming paradigm based on objects while DBMS is a software system for managing databases.

    • OOPS focuses on encapsulation, inheritance, and polymorphism

    • DBMS manages data through CRUD operations and supports ACID properties

    • Examples of OOPS languages include Java, C++, and Python

    • Examples of DBMS include MySQL, Oracle, and SQL Server

  • Answered by AI
  • Q2. Detailed study and questions about project.
Round 4 - HR 

(3 Questions)

  • Q1. Knowledge about latest technologies
  • Q2. Why they should hire me?
  • Q3. Why oracle? followed by questions from computer networks, OOPS, DBMS and a bit from major CS fundamentals.

Interview Preparation Tips

Topics to prepare for Oracle Associate Software Engineer interview:
  • OOPS
  • DBMS
  • DSA
Interview preparation tips for other job seekers - Be well prepared with CS fundamentals. Expect Easy/Medium Leetcode questions. Have a detailed knowlege about everything in your Resume. (Project / Internships / Skills).

Skills evaluated in this interview

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

Flexera Software Interview FAQs

How many rounds are there in Flexera Software Software Engineer interview?
Flexera Software interview process usually has 5 rounds. The most common rounds in the Flexera Software interview process are Technical, Resume Shortlist and One-on-one Round.
How to prepare for Flexera Software Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Flexera Software. The most common topics and skills that interviewers at Flexera Software expect are Cloud, Automation, Equity, Continuous Improvement and Data Analysis.
What are the top questions asked in Flexera Software Software Engineer interview?

Some of the top questions asked at the Flexera Software Software Engineer interview -

  1. Related to DSA, language was Golang, mandatory, based on my prof...read more
  2. Manegerial round, with my team mana...read more

Recently Viewed

INTERVIEWS

Grant Thornton Bharat

No Interviews

INTERVIEWS

Check Point Software Technologies

No Interviews

INTERVIEWS

Zscaler Softech

No Interviews

INTERVIEWS

Grant Thornton Bharat

30 top interview questions

INTERVIEWS

Zscaler Softech

No Interviews

INTERVIEWS

Genpact

No Interviews

INTERVIEWS

Zscaler Softech

No Interviews

INTERVIEWS

Dish Network

No Interviews

INTERVIEWS

Zscaler Softech

No Interviews

INTERVIEWS

Grant Thornton Bharat

No Interviews

Tell us how to improve this page.

Flexera Software Software Engineer Interview Process

based on 2 interviews

Interview experience

5
  
Excellent
View more
Flexera Software Software Engineer Salary
based on 58 salaries
₹5.2 L/yr - ₹19 L/yr
48% more than the average Software Engineer Salary in India
View more details

Flexera Software Software Engineer Reviews and Ratings

based on 8 reviews

3.5/5

Rating in categories

3.4

Skill development

3.4

Work-life balance

3.0

Salary

3.3

Job security

3.4

Company culture

2.9

Promotions

3.2

Work satisfaction

Explore 8 Reviews and Ratings
Software Engineer
58 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
48 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Member Technical Staff
37 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Development Engineer
20 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

QA Engineer
19 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Flexera Software with

IBM

4.0
Compare

Microsoft Corporation

4.0
Compare

Oracle

3.7
Compare

SAP

4.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview