Thought Works interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Thought Works
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : OOPS - You should be well versed with basic OOPS principles
Tip 2 : You should be confident and have profound knowledge about the projects you worked on
Tip 3 : Basic DB concepts like joins, normalisation
Application process
Where: Referral
Eligibility: Above 7 CGPA
Tip 1 : Have clean resume with projects mentioned separately
Tip 2 : Internships should be mentioned if done
Interview rounds
01
Round
Easy
Online Coding Interview
Duration45 Minutes
Interview date4 Aug 2022
Coding problem2
1. Maximum Subarray Sum
Moderate
25m average time
75% success
0/80
Asked in companies
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.
Given the array [-5, -1, -8, -9], the maximum sum would be -1.
Follow up: Do this in O(N) time.
Problem approach
You are given an array (ARR) of length N, consisting of integers. You have to find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.
A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning, and 0 or more integers from the end of an array.
2. System Design Question
Design a cable TV System with 2 channels and multiple users
Problem approach
Tip 1 : Discuss with the thoughtworker the approach you are taking
Tip 2 : Use OOPS principles
Tip 3 : Always use correct access specifiers
02
Round
Easy
Video Call
Duration45 Minutes
Interview date4 Aug 2022
Coding problem2
1. Check If Linked List Is Palindrome
Easy
15m average time
85% success
0/40
Asked in companies
You are given a Singly Linked List of integers. You have to return true if the linked list is palindrome, else return false.
A Linked List is a palindrome if it reads the same from left to right and from right to left.
Example:
The lists (1 -> 2 -> 1), (3 -> 4 -> 4-> 3), and (1) are palindromes, while the lists (1 -> 2 -> 3) and (3 -> 4) are not.
Problem approach
You are given a Singly Linked List of integers. You have to find if the given linked list is palindrome or not.
A List is a palindrome if it reads the same from the left to the right and from the right to the left.
For example, the lists (1 -> 2 -> 1), (3 -> 4 -> 4-> 3), and (1) are palindromes, while the lists (1 -> 2 -> 3) and (3 -> 4) are not
2. System design Question
Design a Doctor Appointment System with some testcases
Problem approach
Tip 1 : Implement using OOPs
Tip 2 : Try to tell your approach to the interviewer as much as you can side by side
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 4 problems
Interviewed by Thought Works
Rejected
0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Thought Works
Selected 1178 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Thought Works
Selected 510 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Thought Works
Rejected
643 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6261 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2160 views
0 comments
0 upvotes