Stratasys Software Developer Interview Questions and Answers

Its was data structure and algorithm and SQL round 4 question of dsa and 2 question of sql

Q1. How does OTP less work make a systematic diagram for it/
Ans. 
OTP less work eliminates the need for one-time passwords for authentication.
• OTP less work uses alternative methods like biometrics, push notifications, or hardware tokens for authentication.

• It provides a more seamless and user-friendly authentication experience.

• Examples include fingerprint scanning on smartphones or security keys for two-factor authentication.
Answered by AI
Add your answer

Q1. Everything related to yourself.
Add your answer

Mangaer asked me to integrate an api

Q1. Salary negotions was done on the second round
Add your answer

Aptitude test was simple.

Q1. Asked 2 questions from recursion.
Add your answer

Q1. Simple HR round.
Add your answer

Q1. Basic resume based questions
Add your answer
Q2. Explain your internship experience
Add your answer

Q1. Basic resume based questions
Add your answer

NEED TO QUALIFY IN THIS TEST

NEED TO QUALIFY THIS TEST ALSO

Q1. SOME DSA AND ROLE BASED QUATIONS.
Add your answer

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Q1. Difference between sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a specific order.
• Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

• Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

• For example, quick sort is generally faster than bubble sort for large data sets.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
• BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer

Question from Array,DP

Q1. Resume based only
Add your answer
Q2. Data structure and algorithms
Add your answer
Q3. Object oriented programmings
Add your answer

Q1. Behavioural questions
Add your answer

3 Coding question medium level

Q1. Asked 3 coding queston and some basis CS questions
Add your answer