Scaleneworks Software Developer Interview Questions, Process, and Tips

Round duration - 120 minutes
Round difficulty - Easy

There were few mcqs. MCQs were easy but coding questions were little complex.

Q1. 
Minimum and Maximum Candy Cost Problem
Ram is in Ninjaland, visiting a unique candy store offering 'N' candies each with different costs. The store has a special offer: for every candy you purchase, you c...read more
Ans. Using Sorting
Let us apply the way that for minimum cost,  Ram buys the candy with minimum cost and then takes top 'K' expensive candies for free.
 
Similarly, for maximum cost, Ram buys the candy with maximum cost and then takes the top 'K' cheapest candies for free.
• For Minimum:
  • Sort the cost array in increasing order.
    Now, until the candies are available:
    → Start picking candies from the left i.e. the cheapest on...read more
Answered Anonymously
Add your answer
Q2. 
Multiply Linked Lists Problem Statement
Your task is to multiply two numbers represented as linked lists and return the resultant multiplied linked list.
Explanation:
The multiplied list should be a lin...read more
Ans. Pen-paper approach
The idea is to use the simple method of multiplying two numbers. We multiply two numbers starting from their least significant digit and moving towards the most significant digit. So we need to access the nodes of linked lists from last to first. First step would be to reverse both the linked lists. Then multiply both the linked lists starting from their heads and then reverse the resulting multiplied...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Round was very difficult . I prefer first just try to learn how to operate hackerrank site, only then you can good with it. It was an online coding round. To clear coding rounds you have to clear your basics.

Q1. 
Right View of Binary Tree
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...read more
Ans. Recursion
Traverse the tree recursively in such a way that the right subtree is visited before the left subtree. The node whose level is more than the maximum level so far (current level of the tree in traversal -1), prints the node because this is the last node in its level. 
 
Keep track of the maximum level so far in a tree in its recursive calls.
Space Complexity: O(n)Explanation:
O(N), where ‘N’ is the total...read more
Answered Anonymously
Add your answer
Q2. 
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...read more
Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
 
 
Below is the detailed algorithm: 
 
1. Call ...read more
Answered Anonymously
Add your answer

Round duration - 35 minutes
Round difficulty - Medium

Basic interview questions, few related to basic domain questions, few from behavioral questions, few from projects. This round was not that much hard.