Motive (KeepTruckin) | Software Engineer | Remote | June 2023 [Reject]

motive logo
motive
Software EngineerRemote4 yearsRejected
June 2, 20230 reads

Summary

I interviewed for a Software Engineer position at Motive (KeepTruckin) remotely in June 2023. The process involved seven distinct rounds covering project discussions, coding, system design, API integration, and behavioral questions, ultimately resulting in a rejection.

Full Experience

My Interview Journey at Motive (KeepTruckin)

My interview process for the Software Engineer role at Motive (KeepTruckin) began in June 2023. I went through a comprehensive series of seven rounds, each focusing on different aspects of my technical and professional capabilities.

Round 1 - Phone Screen (45 minutes)

This initial phone screen was dedicated to a deep dive into one of my past projects. I discussed its architecture, challenges I faced, and the solutions I implemented, along with my specific contributions.

Round 2 - Phone Screen (1 hour)

The second phone screen was a coding challenge where I was asked to solve a problem related to implementing a basic calculator.

Round 3 - System Design (1 hour)

This round focused on system design. I was tasked with designing an event booking system. I outlined the necessary APIs, user interaction flows, database design considerations, and explained my approach to handling concurrent seat bookings.

Round 4 - Integration Round (1 hour)

This was an interesting practical round involving API integration. I had to use the Nominatim API to find the postal address for a given latitude-longitude pair, then extend this to process a list of pairs from a CSV file. Finally, I used the OSRM API to calculate a route between two points.

Round 5 - Topgrading (1 hour)

The fifth round was a behavioral interview, following the topgrading methodology. I answered questions about my work experience, responsibilities in previous roles, how I rate my own performance, and my reasons for leaving past teams.

Round 6 - Coding (1 hour)

This coding round presented two problems: one on validating palindromes and another on determining if a string could be a permutation of a palindrome.

Round 7 - Coding (1 hour)

The final coding round involved two more string manipulation problems: checking for valid anagrams and finding all occurrences of anagrams of a pattern string within a larger text.

After completing all seven rounds, I unfortunately received a rejection.

Interview Questions (7)

Q1
Basic Calculator
Data Structures & AlgorithmsHard

Implement a basic calculator to evaluate a simple expression string. The expression string may contain open '(' and closing parentheses ')', the plus '+' or minus '-' sign, non-negative integers and empty spaces ' '.

Q2
Design Event Booking System
System Design

Design an event booking system. My response covered APIs, user interaction flows, database schema design, and strategies for handling concurrent bookings for the same seats.

Q3
API Integration (Nominatim & OSRM)
Other

My task involved using the Nominatim API to retrieve the postal address for a given latitude-longitude pair, then extending this to process a list of pairs from a CSV file. Additionally, I had to utilize the OSRM API to calculate a route between two specified points.

Q4
Valid Palindrome
Data Structures & AlgorithmsEasy

A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.

Q5
Palindrome Permutation
Data Structures & AlgorithmsEasy

Given a string s, return true if a permutation of the string could form a palindrome. Otherwise, return false.

Q6
Valid Anagram
Data Structures & AlgorithmsEasy

Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Q7
Find All Anagrams in a String
Data Structures & AlgorithmsMedium

Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!