Select The Company name which has the lowest total emoployee count.
| Company | Position | Employee |
|---|---|---|
| ABC | blah | 20 |
| ABC | blah | 15 |
| ABC | blah | 5 |
| XYZ | blah | 10 |
| XYZ | blah | 12 |
| XYZ | blah | 5 |
| MNO | blah | 20 |
| MNO | blah | 5 |
Relisource
| Founding year | |
| Company Website | https://www.relisource.com/ |
| Career Website | https://www.relisource.com/careers/ |
| Technologies Used | Desktop, Mobile, Web, System & Network, Cloud Computing, AWS, Azure & Open Source DevOps |
Introduction
For the Junior .NET Developer Position at first there was a 1 hour long written Exam which consisted 3 Questions (SQL Query, Problem Solving, JavaScript-HTML)
Software Engineering Questions
Problem Solving
There is a food track consisting of cells marked with 0, 1, or other numbers. Here, 0 signifies the cell is not traceable, 1 signifies it is traceable, and any other number represents the destination. Starting from the top-left point, determine the longest path to reach the destination. If no path exists, print -1.
| 1 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 9 | 1 |
JavaScript & HTML
Write JavaScript code to check if a button is clicked in an HTML element using an EventListener. Upon clicking, the size of the HTML element should increase by 10%.
Embedded Software Engineering Questions
Problem Solving
Your task is to write a function in the C programming language to find an optimal route cost to a target location inside a maze and return the highest 4 bits (MSB + 3 bits) of the optimal route cost value. Your function should take as input two integer numbers for the starting index on the maze array. An optimal route is defined as a complete path from the start point to the target location that requires the least effort/cost. Diagonal movement in the maze is not allowed. An example maze is given below:
| 4 | 3 | 7 | 8 | 3 | 6 | 5 | 4 | -1 | 2 | 3 |
| 6 | -1 | -1 | -1 | -1 | -1 | -1 | 5 | 2 | 0 | 94 |
| 7 | -1 | -1 | 16 | -1 | -1 | 7 | 1 | -1 | -1 | 5 |
| 1 | 15 | 25 | 0 | 3 | 5 | 6 | -1 | 6 | 2 | 6 |
| 9 | -1 | -1 | 21 | -1 | -1 | -1 | -1 | 5 | -1 | 2 |
| 2 | -1 | -1 | 22 | -1 | -1 | 5 | -1 | 4 | -1 | 7 |
| 8 | -1 | -1 | 26 | -1 | -1 | 5 | -1 | 3 | -1 | 6 |
| 20 | 5 | 3 | 4 | 11 | 23 | 11 | -1 | 2 | -1 | 5 |
| 2 | -1 | -1 | -1 | -1 | -1 | 20 | -1 | 2 | -1 | 4 |
| 4 | -1 | 4 | -1 | -1 | -1 | 4 | -1 | 1 | -1 | 3 |
| 6 | 7 | 8 | 8 | 7 | 6 | 5 | 10 | 4 | -1 | 2 |
Maze Details:
- The starting block location will be provided as a function parameter (Blue block in the example).
- Blocks with a value of -1 are impassable (Grey blocks in the example).
- The Goal block and only the Goal block will always have a cost of 0 (Green blocks in the example).
- The maze will not have any circular routes that do not go through the Goal block first.
- The maze is stored in a 2D array. The 2D maze array will be defined globally.
- The maze size will be a pair of positive integer numbers, you can assume that the size parameters, length, and height of the maze will fit in a C integer (int) type.
- The cost values, excluding the impassable blocks, will always be a positive integer that will fit in a C integer (int) type.
- The maze length and height are not guaranteed to be equal but will be global fixed defined constants for each problem.