Open In App

Movework Interview Experience

Last Updated : 13 Sep, 2023
Like Article

I recently had the opportunity to go through a two-round interview process with a leading tech company MoveWork. I want to share my experiences to provide insights and guidance for future candidates. The entire process was both enlightening and challenging, and it was divided into two pivotal rounds.

MoveWork visited our campus, MIT, Manipal, in August 2023. The entire hiring process was virtual and consisted of 2 rounds.

Round 1(Coding Round):
In the first round, I was tasked with solving a coding question in just one hour. The question posed was a dynamic programming challenge focused on strings. It read as follows:

“You are given two strings, ‘s’ and ‘t,’ where ‘t’ is a subsequence of ‘s.’ Your task is to identify and remove the longest substring from ‘s’ such that ‘s’ still contains ‘t’ as a subsequence.”

Here is the twist: I did not opt for the conventional dynamic programming approach. Instead, I tackled it with a recursion logic for subsequences, making some thoughtful modifications. The result? My solution worked seamlessly, and I progressed to the next round.

Round 2 (Technical Interview):
In the second round, we delved into Object-Oriented Programming (OOP). The conversation started with a friendly exploration of polymorphism and its various types. We discussed my projects, giving special attention to the intricacies of my most recent work. Throughout the chat, the interviewer peppered in some fundamental OOP questions.

The most engaging part of this round was when we took a deeper look at my projects. The interviewer wanted to understand the nitty-gritty details, the challenges I had encountered, and the rationale behind my design choices. We ventured into discussions about polymorphism, how I had implemented it in my projects, and the core principles of OOP that guided my work.

This round was less about pressure and more about getting to know my thought process and project experiences. It was a constructive exchange of ideas and insights.

The Outcome:
While the first round earned me a spot in the subsequent stage, the second round concluded with a different outcome. Despite my strong grasp of OOP principles and project knowledge, I didn’t advance further in the selection process.In the realm of technical interviews, outcomes can be unpredictable, and sometimes it’s the fine details that make all the difference. Nonetheless, these interviews provided me with invaluable insights and experience.

To all the future interviewees preparing for their upcoming assessments, I have a few words of wisdom to share. Maintaining a sense of calm and confidence throughout the interview process is paramount. When you are composed and self-assured, you can perform at your very best.

In my experience, companies are not just evaluating your technical knowledge but also keenly observing how you interact during the interview and handle challenging situations. While it’s essential to focus on core topics like Object-Oriented Programming (OOP), Data Structures, and Algorithms (DS/Algo), broadening your knowledge base is equally beneficial.

Consider dedicating some time to understanding Operating Systems, Networking, and System Design topics. These areas often play a crucial role in technical interviews, setting you apart from other candidates.

In conclusion, as you embark on your interview journey, remember that it’s not just about what you know; it’s about how you present yourself and tackle complex problems. So, stay calm, stay confident, and embrace the opportunity to showcase your skills and potential. Best of luck in your interviews!

Thank you for reading the post.

Previous Article
Next Article

Similar Reads

Microsoft Interview Experience | Set 151 (SDE-2 3.5 years experience)
Round 1: Place all numeric characters in string before alphabet characters . Using min swaps and O(1) space and Maintain the order of characters. Round 2: Median of stream of integers. Discuss algo. Shortest common supersequence of 2 strings. Discuss recursive Time complexity and write code for best approach decided. Round 3: Merge 2 sorted linked
1 min read
Paytm Interview Experience | Set 21 (5+ Experience)
Round 1: 2 questions on mettle - online judge 1. longest palindrome of a given string. 2. There are n candies and K student. candies are distributed in a order that 1st student get 1 candy, 2nd get 2, 3rd get 3 and so on till nth student. now, 1st student gets k+1 candy, 2nd get k+2, 3rd gets k+3 and so on. if there are not enough candies to be giv
2 min read
Goldman Sachs Interview Experience | Set 39 (1.5 years experience)
I got contacted by a recruiter agency. 1st Round (HackerRank Test 1 Hour 30 Mins): 1) 2) 2. Given a sequence of M and N with M representing increasing and N representing decreasing, output the smallest number that follows this pattern. Input : MMMM Output : 12345 Inpu
1 min read
Microsoft Interview Experience | Set 169 (SDE 2 for 3.5 years experience)
1st round(online coding): Given an array that contains both positive and negative integers, find the product of the maximum product subarray. Sort an almost sorted array where only two elements are swapped. Given an integer value and a pointer to the head of the linked list, delete all the nodes from the list that are greater than the specified val
2 min read
Salesforce Interview Experience - MTS | Set 4 (6.5 Years Experience)
Round 1: Design a File System. The interviewer was looking more for the data structures I would use, if I have to build my own File System. Design a Text Editor. Again a DS + Design question. So need to explore various features of a Text editor and best approach to address them all. If that text editor is on Cloud (Something like Google Docs), how
2 min read
Medlife Interview Experience | Set 2 (1 Year Experience)
Round 1: Q1: Sliding window, Q2: Reverse stack with constant space and only Push and Pop function, Q3: Implementation of HashMap, Q4: Basics of Spring. Couldn't clear this round.
1 min read
Synopsys Interview Experience | Set 8 (7+ years experience)
Round 1 : -------------------------------- 1) How can you design a hash which can have million entries with minimising collision? 2) Clone a binary tree 3) Relation of certain object are given like : A-B, C-D, We need to tell whether two object are related or not. Round 2 : ------------------------------- 1) Delete nodes from a tree whose data is s
2 min read
Microsoft Interview Experience (Full Time 2018 Washington DC - with 2.5 years of experience)
The complete process involved an online phone screen, and an onsite interview (no travel) I was recommended to a recruiter in the Washington DC metro area, and the office was down the street from where I lived. I talked to the recruiter over the phone, and scheduled a phone screen with a Principle Software Engineer. Phone screen: Since it was over
3 min read
Capgemini Interview Experience (2+ Experience)
I got call from Capgemini to attend interview for C++ developer ( they picked up my profile from naukri). Interview scheduled on Saturday at Capgemini Airoli office, Mumbai. Interview time mentioned in call letter : 10 AM so i reached at 9:50 AM. but after waiting for all most 5 hours they called me for 1st round of Interview(even it was not walk-i
1 min read
[24]7 Innovation Labs Interview Experience (6 Months Experience)
Round 1:(Hackerrank Test) Q1: Binary tree mirror image check ( ) Q2: Stack reversal in place // just the function ( Q3: Kendanes algorithm ( Did the last two but
3 min read