Decimal interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Decimal
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 15 monts
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have some projects on resume
Tip 2 : Do not put false things on resume
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 Minutes
Interview date3 Nov 2021
Coding problem2
MCQ Questions of Javascript
1. Check Palindrome
Easy
0/40
Asked in companies
You're given an alphabetical string ‘S’.
Determine whether it is palindrome or not. A palindrome is a string that is equal to itself upon reversing it.
For example:
‘S’ = racecar
The reverse of ‘S’ is: racecar
Since ‘S’ is equal to its reverse. So ‘S’ is a palindrome.
Hence output will be 1.
Problem approach
Let the given number be num. A simple method for this problem is to first reverse digits of num, then compare the reverse of num with num. If both are same, then return true, else false.
Following is an interesting method inspired from method#2 of this post. The idea is to create a copy of num and recursively pass the copy by reference, and pass num by value. In the recursive calls, divide num by 10 while moving down the recursion tree. While moving up the recursion tree, divide the copy by 10. When they meet in a function for which all child calls are over, the last digit of num will be ith digit from the beginning and the last digit of copy will be ith digit from the end.
2. Middle Of Linked List
Easy
20m average time
80% success
0/40
Asked in companies
Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.
Note:
1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
Problem approach
Traverse linked list using two-pointers. Move one pointer by one and the other pointers by two. When the fast pointer reaches the end, the slow pointer will reach the middle of the linked list.
02
Round
Easy
HR Round
Duration30 Minutes
Interview date5 Nov 2021
Coding problem1
Interview was in the evening and online
1. Basic HR Questions
What do you know about the company
About me and my family
Do you have any questions for us
Problem approach
Tip 1 : Get prior knowledge of the company you are preparing for
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
Trainee Engineer
2 rounds | 2 problems
Interviewed by Decimal
Selected 
0 views
0 comments
0 upvotes
Graduate Engineer Trainee
3 rounds | 4 problems
Interviewed by Decimal
Selected 1190 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 5 problems
Interviewed by Decimal
Selected 889 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7874 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 9973 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4310 views
1 comments
0 upvotes