PropTiger interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
PropTiger
1 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 4 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Interview rounds
01
Round
Easy
Online Coding Test
Duration45 minutes
Interview date10 May 2015
Coding problem2
This was a test where 2 coding questions were to be solved in 45 minutes.
1. Excel Column Number
Easy
23m average time
0/40
Asked in companies
You have been given a column title as appears in an Excel sheet, return its corresponding column number.
For example:
A -> 1
B -> 2
C -> 3
...
Z -> 26
AA -> 27
AB -> 28
...
Problem approach
For every additional digit of the string, multiply the value of the digit by 26^n where n is the number of digits it is away from the one's place.
This is similar to how the number 254 could be broken down as this: (2 x 10 x 10) + (5 x 10) + (4). For this question, 26 will be used as a base instead of 10.
For s = "BCM" the final solution would be (2 x 26 x 26) + (3 x 26) + (13)
This process can be carried out iteratively. Start at looking at the first character of the string. Add the integer equivalent of that character to the running sum and continue. For every new character, multiply the running sum by 26 before adding the new digit to signify we are changing places.
2. Check Permutation
Easy
0/40
Asked in companies
For a given two strings, 'str1' and 'str2', check whether they are a permutation of each other or not.
Permutations of each other
Two strings are said to be a permutation of each other when either of the string's characters can be rearranged so that it becomes identical to the other one.
Example:
str1= "sinrtg"
str2 = "string"
The character of the first string(str1) can be rearranged to form str2 and hence we can say that the given strings are a permutation of each other.
Problem approach
This method uses the approach of counting characters.
Steps :
1) Create count arrays of size 256 for both strings. Initialize all values in count arrays as 0.
2) Iterate through every character of both strings and increment the count of character in the corresponding count arrays.
3) Compare count arrays. If both count arrays are same, then return true.
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
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
960 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3451 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114579 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57824 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes