RxLogix interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

RxLogix
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
In my second year, I did the course of competitive programming from Coding Ninjas which helped me to deep dive into DSA, and then I start practicing problems on Codeforces, Codechef and leetcode.
Application story
I applied through college or university. The process took multiple day. The event had three rounds mainly consisting of coding questions.
Why selected/rejected for the role?
They gave me two DSA questions which I solved and answered all Cs fundamental question they asked. They also checks your OOPS skills
Preparation
Duration: 4 months
Topics: DSA- Trie, HashMap, Sets, Priority Queue, Stack, Advanced Topics like Fenwick Tree, Segment Trees, Game Theory, Dynamic Programming, Union Find, Graph Algorithms, Bitmasks
Tip
Tip

Tip 1 : Reading other’s interview experiences is one of the best ways to get yourselves ready for the next job interview. Practice daily atleast 5 questions.
Tip 2 : Most commonly asked topics in Google Interviews ( as per the mail I received from my recruiter ) :
BFS/DFS/Flood fill, Binary Search, Tree traversals, Hash tables, Linked list, stacks, queues, two pointers/sliding window
Binary heaps, Ad hoc/string manipulations.
Tip 3 : Highly recommended sites for practicing questions ( usually practice medium and hard level questions) -

Leetcode (highly encouraged)
Geeksforgeeks (highly encouraged)
CodeZen( highly encouraged)
Codeforces

Application process
Where: Campus
Eligibility: 7.5+ CGPA
Resume Tip
Resume tip

Tip 1 : Mention past working experience in detail as to how you were important to your previous company.
Tip 2 : Try to keep your resume to 1 page if work experience < 5 years
Tip 3 : Update your resume according to the role you are applying for and never put false things on your resume.

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date9 Jan 2020
Coding problem2

Two coding problems were asked

1. Min Steps to one

Easy
15m average time
90% success
0/40
Asked in companies
IBMAmazonSprinklr

You are given a positive integer 'N’. Your task is to find and return the minimum number of steps that 'N' has to take to get reduced to 1.

You can perform any one of the following 3 steps:

1) Subtract 1 from it. (n = n - ­1) ,
2) If n is divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,
3) If n is divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ).

For example:

Given:
‘N’ = 4, it will take 2 steps to reduce it to 1, i.e., first divide it by 2 giving 2 and then subtract 1, giving 1.
Problem approach

Min Steps to one using DP concept

Try solving now

2. Longest Palindromic Substring

Moderate
20m average time
80% success
0/80
Asked in companies
MicrosoftCIS - Cyber InfrastructureGartner

You are given a string 'str' of length 'N'.


Your task is to return the longest palindromic substring. If there are multiple strings, return any.


A substring is a contiguous segment of a string.


For example :
str = "ababc"

The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome. 

There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.
Problem approach

Again this is very famous problem of Dynamic programming

Try solving now
02
Round
Hard
Video Call
Duration90 minutes
Interview date11 Jan 2020
Coding problem2

Only dsa problem was asked from me

1. Boyer Moore Algorithm For Pattern Searching

Moderate
30m average time
70% success
0/80
Asked in companies
Goldman SachsAmdocsGoogle inc

You are given a string ‘text’ and a string ‘pattern’, your task is to find all occurrences of pattern in the string ‘text’ and return an array of indexes of all those occurrences. You may assume that the length of ‘text’ is always greater than the length of ‘pattern’.

For example :
Let text = “this is a good place to have a good start”, pattern = “good” so you have to return {10, 31} because at 10 and 31 index pattern is present in the text.
Note :
If there is no such index in the text then just return an array containing -1.
Problem approach

I applied Boyer Moore Algorithm for Pattern Searching

Try solving now

2. Median in a stream

Hard
50m average time
50% success
0/120
Asked in companies
Disney + HotstarAmazonMakeMyTrip

Given that integers are read from a data stream. Your task is to find the median of the elements read so far.

Median is the middle value in an ordered integer list. If the size of the list is even there is no middle value. So the median is the floor of the average of the two middle values.

For example :
[2,3,4] - median is 3.
[2,3] - median is floor((2+3)/2) = 2.


Problem approach

Use Heap concept

Try solving now
03
Round
Easy
HR Round
Duration40 minutes
Interview date10 Jan 2020
Coding problem2

One DSA problem was asked by the interviewer and later on, he asked questions to judge my thinking and decision making skill

1. Spell Checker

Hard
50m average time
50% success
0/120
Asked in companies
AtlassianFlipkart limitedGoogle inc

You are given a list of strings, ‘DICTIONARY[]’ that represents the correct spelling of words and a query string ‘QUERY’ that may have incorrect spelling. You have to check whether the spelling of the string ‘QUERY’ is correct or not. If not, then return the list of suggestions from the list ‘DICTIONARY’. Otherwise, return an empty list which will be internally interpreted as the correct string.

Note:

1) The suggested correct strings for the string  ‘QUERY’ will be all those strings present in the ‘DICTIONARY[]’ that have the prefix same as the longest prefix of string ‘QUERY’.

2) The ‘DICTIONARY[]’ contains only distinct strings.

For example:

Given 'DICTIONARY[]' = {“ninja”, “ninjas”, “nineteen”, “ninny”} and query = “ninjk”. Since “ninjk” is not present in the ‘DICTIONARY[]’, it is an incorrect string. The suggested current spellings for “ninjk” are “ninja” and “ninjas”. It is because “ninj” is the longest prefix of “ninjk” which is present as the prefix in ‘DICTIONARY’.
Try solving now

2. Basic HR Questions

1. What was your biggest challenge?
2. Did you ever work under pressure?
3. Your strengths and weaknesses
4. Later on, he asked some security related problems from my projects

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
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
961 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6451 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7874 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9973 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4310 views
1 comments
0 upvotes