
Wanderlog Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 60 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Wanderlog.
Software Engineer
I got rejected after finishing the OA, even though I got a perfect score and passed all test cases in 37 minutes. The questions weren't that hard, but setting up, reading, and testing everything took time. I'm not sure why I was rejected since there was no feedback. If they're looking for super-fast coding, I wonder if anyone can actually complete the entire OA process (setup, read, code, test) in under 20 minutes. AI could do it, but they explicitly said not to use it. It feels like they either want candidates who use AI for the OA or they don't want to hire anyone. If you're preparing, I'd suggest looking at what others have shared on this platform; the questions are very similar to the actual interview questions.
- Given specific criteria, sort the provided logs.
Software Engineer
So, they send you to this super old website for a test, which seems to be the same for everyone. Then, you're lucky if you get like 4 more technical interviews? To break it down: 1. An interview on a website that looks like it's running on Flash. 2. An interview with an AI bot that's kind of annoying and not really helpful. 3. A frontend code-focused interview. 4. An on-site with 2 more TECHNICAL INTERVIEWS. 5. A cultural fit interview. Funny how you don't even talk to a real person until you're halfway through. Seriously, it's a two-way street, you need to know if we're a good fit too, so take 15 mins to get to know the candidate. If you can't, hire an HR person. Also, you're not Google, and no one with a current job will take a week off their paying job to prove themselves to you. If you don't know how to hire, see advice #1.
- Did you do some array manipulation questions or something similar?
Software Engineer
Overall, it was a great experience. The process moved quickly and really focused on practical skills. I used the DMOJ platform which is a bit janky but the problems were well-designed and realistic. I made it to the final rounds where I met the founders, who were super welcoming and gave me feedback on the spot. The pair programming session felt like a collaboration, not a competition, and we worked on validating phone number input. I'm really excited about the possibility of joining the team!
- How can we calculate session durations by processing user login and logout timestamps?
- What's your approach to validating phone number input?
Wanderlog Software Engineer Interview Questions
Quoted word for word from Wanderlog interview reports.
“Given a log file as a string array with entries like "user_id timestamp action", where action is 'sign-in' or 'sign-out', and values are space-separated digits. Find user_ids who signed out within maxSpan seconds of signing in, given entries are not ordered.”
Read reports →“Can you write a Python function that accepts lines of strings and returns the sum for each line?”
Read reports →“Given an array of transactions, group them by item name. Output an array of strings, each formatted as 'item_name number_of_transactions'.”
Read reports →“Find the max sum of any two numbers in an array of integers.”
Read reports →“Given a list of user sign-in and sign-out log entries, identify and return users whose sign-in and sign-out occurred within a specified maximum allowed duration.”
Read report →“Given a list of transactions, can you group them by the item name and return a list of strings, where each string is the item name followed by its transaction count?”
Read report →“How would you iterate through a list of Python dictionaries?”
Read report →“Could you write a function that removes duplicates from a list but keeps the original order?”
Read report →“What is the minimum value in the custom data structure?”
Read report →Formats, difficulty and experience
Across all 60 Wanderlog interview reports.