Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Softaculous Team. If you also belong to the team, you can get access from here

Softaculous Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Softaculous Software Developer Interview Questions and Answers

Updated 10 Nov 2024

Interview questions from similar companies

Interview Preparation Tips

General Tips: Strong Coding Skills and basic computer Knowledge is a must. Make sure you are good in these. Basically they are looking for people with problem solving abilities.
Skills: Problem Solving Qualities
College Name: IIT KHARAGPUR

I was interviewed before May 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

This was a technical round.

  • Q1. 

    Duplicate Elements in Array

    You are provided with an array or list called ARR, consisting of N integers. These integers fall within the range from 0 to N - 1. Some elements in this array may appear more t...

  • Ans. 

    Identify duplicate elements in an array of integers within the range from 0 to N - 1.

    • Iterate through the array and keep track of seen elements using a hash set.

    • If an element is already in the set, it is a duplicate and can be added to the result.

    • Return the list of duplicate elements found in the array.

    • Example: For input [1, 3, 1, 3, 4], output should be ['1', '3'].

  • Answered by AI
  • Q2. 

    Find Triplets with Given Sum Problem Statement

    Given an array ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a given integer K.

    Explanation:

    ...
  • Ans. 

    The task is to find all distinct triplets in an array that sum up to a given integer.

    • Iterate through the array and use a nested loop to find all possible triplets.

    • Use a set to store unique triplets and avoid duplicates.

    • Check if the sum of the triplet equals the target sum.

    • Return the list of valid triplets or -1 if no such triplet exists.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

This was a technical interview round with questions on Programming and algorithms.

  • Q1. 

    Box Stacking Problem Statement

    Consider you are provided with 'n' different types of rectangular 3D boxes. For each type of box, you have three separate arrays: height, width, and length that define the d...

  • Ans. 

    The task is to stack different types of rectangular 3D boxes to achieve the maximum possible height.

    • Iterate through all possible rotations of each box type.

    • Sort the boxes based on their base dimensions in non-increasing order.

    • Use dynamic programming to find the maximum height achievable by stacking the boxes.

    • Consider the constraints while implementing the solution.

    • Example: For input [3, [4, 1, 4], [6, 2, 5], [7, 3, 6]]

  • Answered by AI
  • Q2. 

    Maximum Sum Subarray Problem Statement

    Given an array of integers, find the maximum sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Output:
    137
    Exp...
  • Ans. 

    Find the maximum sum of any contiguous subarray within an array in O(N) time complexity.

    • Use Kadane's algorithm to find the maximum sum subarray in O(N) time complexity

    • Initialize two variables: max_sum and current_sum to track the maximum sum subarray

    • Iterate through the array and update current_sum by adding the current element or starting a new subarray

    • Update max_sum if current_sum becomes greater than max_sum

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Medium

This was a difficult on to face as we have to hold phone and concentrate and explaining is also very difficult.

  • Q1. 

    Stock Buy and Sell Problem Statement

    Given an array/list 'prices' where the elements represent yesterday's stock prices at each minute, determine the maximum profit possible from a single buy and sell act...

  • Ans. 

    Given an array of stock prices, find the maximum profit from a single buy and sell action.

    • Iterate through the 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 seen so far.

    • If the profit is negative, set it to 0 as we can't sell without buying first.

  • Answered by AI
  • Q2. 

    Dijkstra's Algorithm Problem Statement

    Given an undirected graph with 'V' vertices (labeled 0, 1, ..., V-1) and 'E' edges, where each edge connects two nodes ('X', 'Y') and has a weight that denotes the di...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in a graph.

    • Implement Dijkstra's algorithm to find the shortest path distances from node 0 to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Initialize distances to all nodes as infinity except for the source node which is 0.

    • Update distances to neighborin...

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a small interaction just to make us familiar in Mumbai office.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPADirecti interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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 in May 2016.

Interview Preparation Tips

Round: Algorithmic Round
Experience: You are given N ranges of the form [A,B]. Find all the ranges which occur atleast K times.

Round: Algorithmic Round
Experience: 1. Find the number of ways from reaching (1,1) to (N,M) when only right and down moves are allowed in O(N+M) complexity.
2. A row-wise and column-wise sorted matrix is given. Find an element in O(N+M) complexity.

Round: Algorithmic Round
Experience: 1. Check whether the given graph is bipartite or not.
2. Given a sorted array,find the longest sequence in AP.

Skills: Algorithm, Data Structures
College Name: NIT Allahabad

Interview Questionnaire 

15 Questions

  • Q1. Find Minimum and Maximum of an array in only one traversal
  • Ans. 

    Find the minimum and maximum values in an array in a single traversal.

    • Initialize min and max variables with the first element of the array

    • Iterate through the array and update min and max if a smaller or larger value is found

    • Return the min and max values

  • Answered by AI
  • Q2. Given a chessboard find the maximum number of squares present?
  • Ans. 

    The maximum number of squares on a chessboard is 64.

    • The chessboard has 64 squares in total.

    • The number of squares on a chessboard can be calculated using the formula n^2, where n is the number of rows or columns.

    • In this case, n = 8 (8 rows and 8 columns), so the maximum number of squares is 8^2 = 64.

  • Answered by AI
  • Q3. What is C++? Difference between deep and shallow copy?
  • Ans. 

    C++ is a programming language. Deep copy creates a new object and copies all values, while shallow copy creates a reference to the original object.

    • C++ is a general-purpose programming language

    • Deep copy creates a new object with its own copy of the data

    • Shallow copy creates a reference to the original object

    • Deep copy is safer but can be slower and consume more memory

    • Shallow copy is faster but can lead to unexpected behav

  • Answered by AI
  • Q4. What is pre initialization ?
  • Ans. 

    Pre initialization refers to the process of initializing variables or objects before they are used in a program.

    • Pre initialization helps avoid errors or unexpected behavior caused by using uninitialized variables.

    • It is a good practice to pre initialize variables with default values.

    • Pre initialization can be done using constructors, default values, or initialization blocks.

    • Example: int count = 0; initializes the variabl

  • Answered by AI
  • Q5. Reverse a linked list with and without using Recursion
  • Ans. 

    Reverse a linked list with and without using Recursion

    • Iterative approach: Use three pointers to reverse the links between nodes

    • Recursive approach: Recursively reverse the rest of the list and then fix the links

  • Answered by AI
  • Q6. Copy constructor?
  • Q7. Different types of polymorphism, the diamond problem, and how can it be avoided?
  • Ans. 

    Polymorphism refers to the ability of an object to take on many forms. The diamond problem occurs in multiple inheritance.

    • Polymorphism can be achieved through method overloading and method overriding.

    • Method overloading allows multiple methods with the same name but different parameters.

    • Method overriding occurs when a subclass provides a specific implementation of a method already defined in its superclass.

    • The diamond p...

  • Answered by AI
  • Q8. Questions about Virtual
  • Q9. Template classes
  • Q10. Write a program for an operator(=) such that it behaves differently for integer and character
  • Ans. 

    The program should differentiate between integers and characters when using the assignment operator (=).

    • Check the data type of the variable before assigning a value.

    • Use conditional statements to perform different actions based on the data type.

    • For integers, assign the value directly. For characters, convert the character to its ASCII value and assign it.

  • Answered by AI
  • Q11. Given an array, sort the zeroes from non zeros for example Input: 1 2 0 0 7 4 42 0 0 0 6 Output: 1 2 7 4 42 6 0 0 0 0 0
  • Ans. 

    Sort an array by moving all zeroes to the end.

    • Iterate through the array and move all non-zero elements to the front.

    • Count the number of zeroes encountered and append them at the end of the array.

    • Use two pointers to swap elements and maintain the order.

  • Answered by AI
  • Q12. Class hierarchy, List the number of VTables created
  • Ans. 

    The number of VTables created in a class hierarchy depends on the number of virtual functions and the number of derived classes.

    • VTables are used in object-oriented programming languages to implement dynamic dispatch.

    • Each class with at least one virtual function has its own VTable.

    • Derived classes inherit the VTable of their base class and add their own entries for any additional virtual functions.

    • The total number of VTa...

  • Answered by AI
  • Q13. When to use List and Vector of Standard Template Library ?
  • Ans. 

    List is preferred when frequent insertion and deletion is required. Vector is preferred when random access is required.

    • List is implemented as a doubly-linked list, allowing for efficient insertion and deletion at any position.

    • Vector is implemented as a dynamic array, allowing for efficient random access.

    • Use List when the number of elements is expected to change frequently and the order of elements matters less.

    • Use Vect...

  • Answered by AI
  • Q14. Given a string “I LOVE CODING”, print “CODING LOVE I”
  • Ans. 

    The given string needs to be reversed and the words need to be rearranged.

    • Split the string into an array of words

    • Reverse the array

    • Join the array elements with a space in between

  • Answered by AI
  • Q15. Questions about weakness and strengths

Interview Preparation Tips

Round: HR Interview
Experience: He asked me how should I weigh Howrah bridge and asked to give any answer I like, normal or wacky. My answer was very normal so I not gonna write that.
And then questions about my weakness and strength, my previous company, reason to change etc.

Skills: c++, Algorithm
College Name: NIT DELHI

Skills evaluated in this interview

Interview Questionnaire 

18 Questions

  • Q1. Design a parking lot? Design should include -Logic Flow Diagram -E-R diagram (very important) -DB tables with relations between them, preferably normalized -Commands for transaction with tables
  • Ans. 

    Design a parking lot with Logic Flow Diagram, E-R diagram, DB tables with relations, and commands for transactions.

    • Identify the types of vehicles that will use the parking lot

    • Determine the number of parking spaces needed for each vehicle type

    • Create a flow diagram to show the process of entering and exiting the parking lot

    • Design an E-R diagram to show the relationships between entities such as vehicles, parking spaces, ...

  • Answered by AI
  • Q2. Find Min and Max of an array in only one traversal
  • Ans. 

    To find min and max of an array in one traversal, initialize min and max to first element and compare with rest.

    • Initialize min and max to first element of array

    • Traverse the array and compare each element with min and max

    • Update min and max accordingly

    • Return min and max

  • Answered by AI
  • Q3. Given a chessboard find maximum number of squares present
  • Ans. 

    Given a chessboard, find the maximum number of squares present.

    • Start with the smallest square and count all possible squares

    • Use the formula n*(n+1)*(2n+1)/6 to find the total number of squares in an n x n chessboard

    • Add up the squares of all sizes from 1 to n to get the maximum number of squares

    • For example, an 8 x 8 chessboard has 204 squares

  • Answered by AI
  • Q4. What is C++?
  • Ans. 

    C++ is a high-level programming language used for developing system software, application software, device drivers, and video games.

    • C++ was developed by Bjarne Stroustrup in 1983.

    • It is an extension of the C programming language.

    • C++ supports object-oriented programming, generic programming, and low-level memory manipulation.

    • It is used in developing operating systems, browsers, databases, and more.

    • Examples of popular sof...

  • Answered by AI
  • Q5. Difference between deep and shallow copy?
  • Ans. 

    Deep copy creates a new object with a new memory address, while shallow copy creates a new reference to the same memory address.

    • Deep copy duplicates the object and all its nested objects, while shallow copy only duplicates the top-level object.

    • Deep copy is slower and more memory-intensive than shallow copy.

    • Shallow copy can lead to unexpected behavior if the original object is modified.

    • In Python, deep copy can be achiev...

  • Answered by AI
  • Q6. Inheritance concepts, private/public/protected concepts?
  • Q7. Whats “preinitialization” View Answer
  • Ans. 

    Preinitialization is the process of initializing data or objects before they are actually needed.

    • Preinitialization can improve performance by reducing the time needed to initialize data or objects when they are actually needed.

    • It can also help to avoid delays or interruptions during runtime.

    • Examples of preinitialization include preloading data into memory, initializing objects in advance, and caching frequently used da

  • Answered by AI
  • Q8. Different versions of polymorphism, how to solve the problem of multiple inheritance
  • Ans. 

    Polymorphism can be achieved through method overloading, method overriding, and interfaces. Multiple inheritance can be solved using interfaces.

    • Method overloading allows multiple methods with the same name but different parameters

    • Method overriding allows a subclass to provide its own implementation of a method already defined in its superclass

    • Interfaces provide a way to achieve multiple inheritance by allowing a class ...

  • Answered by AI
  • Q9. Template classes, WAP operator= for template class such that it behaves differently for int and char *
  • Q10. Given a tree, WAP such that a matrix is generated so that: Tree: 1 / 2 3 | / 4 5 6 Matrix: 0 1 2 3 4 5 6 1 0 1 1 1 1 1 2 0 0 0 1 0 0 3 0 0 0 0 1 1 4 0 0 0 0 0 0 5 0 0 0 0 0 0 6 0 0 0 0 0 0
  • Ans. 

    WAP to generate a matrix from a given tree.

    • Create a 2D array to store the matrix

    • Traverse the tree and fill the matrix accordingly

    • Use BFS or DFS to traverse the tree

    • The matrix will be symmetric along the diagonal

  • Answered by AI
  • Q11. What is primary key? unique key?
  • Ans. 

    Primary key is a column or set of columns that uniquely identifies each row in a table. Unique key is a constraint that ensures uniqueness of values in a column or set of columns.

    • Primary key is used to enforce data integrity and ensure that each row in a table can be uniquely identified.

    • Unique key is used to ensure that no two rows in a table have the same values in a column or set of columns.

    • Primary key can be a singl...

  • Answered by AI
  • Q12. Can unique key be a primary key?
  • Ans. 

    Yes, a unique key can be a primary key.

    • A primary key is a unique identifier for a record in a table.

    • A unique key is a constraint that ensures the values in a column are unique.

    • A unique key can be used as a primary key if it meets the requirements.

    • A primary key cannot have NULL values, while a unique key can have one NULL value.

  • Answered by AI
  • Q13. What is foreign key? can foreign key be Null?
  • Ans. 

    Foreign key is a column in a table that refers to the primary key of another table.

    • It establishes a relationship between two tables.

    • It ensures referential integrity.

    • It can be null, but only if it is defined as nullable.

    • It helps in joining tables.

    • Example: Customer table has a foreign key to the Order table's primary key.

    • Example: Order table's foreign key can be null if the order has not been placed by any customer yet.

  • Answered by AI
  • Q14. What is normalization? why should we do normalization?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.

    • Normalization involves breaking down a database into smaller, more manageable tables.

    • It helps to eliminate data redundancy and inconsistencies.

    • Normalization ensures that each table has a primary key and that data is stored in a logical and consistent manner.

    • It improves data integrity and reduces the likelihood ...

  • Answered by AI
  • Q15. Normalized form is better or storing in a single table/ 2 tables is better?
  • Ans. 

    Normalized form is better for data consistency and scalability.

    • Normalized form reduces data redundancy and ensures data consistency.

    • Normalized form allows for easier scalability and maintenance.

    • Single table/2 tables may be appropriate for small, simple datasets.

    • Normalized form may require more complex queries to retrieve data.

    • Normalized form may require more storage space due to additional tables.

    • Example: Normalized fo...

  • Answered by AI
  • Q16. Create database of IPL
  • Ans. 

    Create a database for Indian Premier League (IPL)

    • Identify entities like teams, players, matches, venues, etc.

    • Create tables for each entity with relevant attributes

    • Establish relationships between tables using foreign keys

    • Add constraints like unique, not null, default values, etc.

    • Populate tables with data from reliable sources

  • Answered by AI
  • Q17. Write a query to find name of a player with maximum number of runs in a match on given date and given venue
  • Ans. 

    Query to find player with maximum runs in a match on given date and venue

    • Use MAX() function to find maximum runs

    • Join tables for player name, match details and runs scored

    • Filter by given date and venue

    • Order by runs scored and limit to 1 result

  • Answered by AI
  • Q18. Ques about my weakness and strength, my previous company, reason to change etc

Interview Preparation Tips

General Tips: I applied through an employee referral. The process took a day – interviewed at SAP in February 2015.The interviewer had good work experience. She was polite and calm. After brief introduction she straight jumped into my current projects and she covered my entire CV.
Skills: Algorithm, C++
College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Questions mainly on C, OOPS concepts of C++, basic Java concepts, Data structures and puzzles (standard ones)
  • Q2. Questions about your Project.
  • Q3. Questions from the same topics as the previous round
  • Q4. Simple puzzle
  • Q5. Apart from technical questions a few HR questions were asked. For example: Why do you want to join this company?
  • Q6. Have you ever be in a situation where your task is not completed in time and you have to make quick decisions?

Interview Preparation Tips

Round: Test
Experience: Though Questions were all simple, time management was important
Total Questions: 1

Round: Technical Interview
Tips: If you perform well in this round then your chances of selection gets high

Skills: OOP, JAVA, Algorithm
College Name: NA

I applied via Referral

Interview Questionnaire 

3 Questions

  • Q1. Given two sorted arrays, say A and B, find A ­ B. Here, A ­ B means all those elements present in A but not in B. The expected time complexity was O(m + n), if A is of size m and B is of size n
  • Ans. 

    Find A-B of two sorted arrays A and B in O(m+n) time complexity.

    • Create two pointers, one for each array, and compare the elements at those pointers.

    • If the element in A is smaller, add it to the result array and move the A pointer forward.

    • If the element in B is smaller, move the B pointer forward.

    • Repeat until one of the pointers reaches the end of its array.

    • Add any remaining elements in A to the result array.

    • Time comple...

  • Answered by AI
  • Q2. 1. Write a routine to output the elements of the inorder traversal of a binary tree one by one in its each call. eg: Assuming the inorder traversal is 1, 2, 3, 4, 5, the routine should return 1 in its fi...
  • Ans. 

    The routine should output the elements of the inorder traversal of a binary tree one by one in each call.

    • Implement an inorder traversal algorithm recursively

    • Use a global variable or pass a reference to keep track of the current element

    • Call the routine repeatedly to get the next element in each call

  • Answered by AI
  • Q3. Given a set of courses along with the prerequisite courses for these courses, write a program to find the minimum number of semesters required to wrap up all the courses
  • Ans. 

    Program to find minimum semesters required to complete courses with prerequisites

    • Create a graph with courses as nodes and prerequisites as edges

    • Use topological sorting to find the order of courses to be taken

    • Calculate the minimum number of semesters based on the order obtained

    • Handle cases where there are cycles in the graph

  • Answered by AI

Interview Preparation Tips

Skills:
College Name: NA

Skills evaluated in this interview

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

Interview Questionnaire 

2 Questions

  • Q1. Circular queues, binary trees, recursion
  • Q2. Asked about project

Interview Preparation Tips

Round: Test
Experience: 3 very simple questions on hackerrank.
Duration: 1 hour 30 minutes
Total Questions: 3

Round: Group Discussion
Duration: 1 hour

Round: Technical Interview
Experience: Asked me to code up a simple question

College Name: IIT Madras

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: exam was easy.
Tips: Be good in C programming
Duration: 75 minutes
Total Questions: 3

General Tips: Should be good in atleast c or c++
Skills: Algorithms And Data Structures
Duration: 2
College Name: IIT Madras
Motivation: The accomodation and facilities
Funny Moments: Interviews are not funny.

Softaculous Interview FAQs

How many rounds are there in Softaculous Software Developer interview?
Softaculous interview process usually has 2 rounds. The most common rounds in the Softaculous interview process are Aptitude Test and Coding Test.

Tell us how to improve this page.

Softaculous Software Developer Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more
Softaculous Software Developer Salary
based on 27 salaries
₹2.2 L/yr - ₹6 L/yr
42% less than the average Software Developer Salary in India
View more details

Softaculous Software Developer Reviews and Ratings

based on 5 reviews

2.2/5

Rating in categories

2.0

Skill development

2.2

Work-life balance

2.2

Salary

2.0

Job security

2.2

Company culture

2.2

Promotions

2.0

Work satisfaction

Explore 5 Reviews and Ratings
Software Developer
27 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Linux Support Engineer
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

PHP Developer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Web Developer
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Linux System Administrator
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Softaculous with

ZNetLive

2.4
Compare

Directi

4.1
Compare

GoDaddy

3.4
Compare

Bigrock

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