Laserfiche Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 81 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Laserfiche.
Laserfiche
Software Engineer
Entry Average Positive experience No offer 1 round
Interview process
Technical screen
Interview formats
Technical Coding
The interviewer was really nice and helped me when I was stuck. The technical part involved pseudocode for a BST. They also asked algorithm questions and a quick general quiz on programming language knowledge and data structures.
Confirmed questions1 question
- What's the Big O complexity of a Binary Search Tree (BST)?
Laserfiche
Software Engineer
Entry Difficult Negative experience No offer 1 round
Interview process
Technical screen
Interview formats
Coding
Got an online assessment, had 90 minutes to complete 4 questions. The first 2 were easy, like string manipulation. The last 2 were tougher, one used DFS and the other recursion.
Confirmed questions3 questions
- String-related questions
- DFS question
- Recursion question
Laserfiche
Software Engineer
Mid Average Positive experience No offer 3 rounds
Interview process
Presentation Technical screen Technical screen
Interview formats
Presentation Coding System Design
It was a three stage process. First, a 15 minute presentation about myself using Powerpoint. Then, there were hour-long whiteboard interviews: one on algorithms and another on system design. They really give you a lot of time to ask questions about Laserfiche and what they do afterwards, so come ready with yours.
Confirmed questions4 questions
- Can you solve the Two Sum problem?
- How would you implement a stack using two queues?
- What's your approach to finding the water level on an island after rain?
Laserfiche Software Engineer Interview Questions
Quoted word for word from Laserfiche interview reports.
“What is the sum of all prime numbers up to n?”
Read reports →“What is the runtime for inserting an element into a linked list?”
Read reports →“Given a sorted array and an element k, what is the index of the start of the longest subsequence of k?”
Read reports →“What is the complexity of inserting an element into an array?”
Read reports →“What's the Big O complexity of a Binary Search Tree (BST)?”
Read report →“What is the runtime for inserting an element into an array?”
Read report →“Write a program to print out all primes less than a specified number.”
Read report →“How would you find all prime numbers between 1 and n?”
Read report →“Can you write a function to output all prime numbers less than a given number efficiently?”
Read report →Formats, difficulty and experience
Across all 81 Laserfiche interview reports.