Fortanix Software Developer Interview Questions and Answers

Q1. Introduce yourself
Add your answer
Q2. Get the maximum at any point during push and pop operation in stack
Add your answer

Coding test was comprising of mcq based questions on db, oops, c++ and java

Q1. It was a high intense interview. Interview starts with introduction and some resume based questions. Then, followed by deep networking and os based questions. Then, dsa questions were asked specifically on...read more
Add your answer

Q1. It was also a tough one. Questions were specifically on project based of the resume and other questions were on btech curriculum, subjects, and experience.
Add your answer

Q1. HR was easy. Questions were only about relocation and package breakup. But remember that they can put you in waiting and when needed they can call for another interview. So mark this and all the best.
Add your answer

2 data struture question advancevds i cpp

Q1. 5 dsa array string
Ans. 
Implement a data structure for storing and manipulating an array of strings.
• Use a dynamic array to store the strings.

• Implement functions for adding, removing, and accessing strings in the array.

• Consider memory management and resizing the array as needed.
Answered by AI
Add your answer
Q2. Data sturucture
Add your answer

Q1. Resume based question
Add your answer

Coding test on hackerrank

Q1. Question on Tree
Add your answer
Q2. Asked to solve a few puzzles
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was nice.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. Optimal Solution
• Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
• Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only constant extra space is required.
Time Complexity: O(...read more
Answered Anonymously
Add your answer
Q2. 
Move Zeros to Left Problem Statement
Your task is to rearrange a given array ARR such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...read more
Ans. Solution Using Extra space
The idea is to use an extra vector to store all the non-zero elements while maintaining their relative order. So we will first add all the non-zero elements to a vector and then iterate that vector backwards and start updating the array values from end. In the end we will set all the array values whose values were not updated to 0. 
Steps:
1. Let storeNonZero be the vector that stores non-zero...read more
Answered Anonymously
Add your answer
Q3. Write an SQL query to find the second highest salary from a table.
Add your answer

Binary search and design a data-structure to do insert, delete and get random in O(1)