Sprinklr On Campus Internship
Sprinklr visited our campus as part of Internship Drive. Around 170 students of CSE, ECE and EEE participated in the First Round.Details goes like this.
Round 1:(Technical Aptitude + Coding) – 450 Marks
The first round comprised of 20 Technical Aptitude and 3 Coding Questions and was held on HackerEarth platform.It was of 2 hrs duration and each of the aptitude question weighted 5 marks without any negative marking.Coding questions were as follows:
Question 1: You are given a general tree with n nodes, each node is associated with a certain value, rooted at node r. You have to answer q queries which can be either of the following two types.
1. sum i :- given the value of node i, print the sum of the subtree rooted at i including its value.
2. update i, k :- update the value of node i to k.
Question 2: You are given an array consisting of non-negative integers.You have to find the size of the smallest subset such that the Bitwise OR of that set is maximum possible.
Sample Testcase : 5 1 3 4 2
Sample Output : 2
Clarification : Max possible OR is 7, which can be achieved by [5, 2] or [3, 4]
Question 3: You are given a string of length n (1-based indexing) having only the lowercase english alphabets.You have to answer q queries each consisting of two integers l, r. For each query you have to return the count of all sub-strings in range [l, r] (both l and r inclusive) such that its starting and ending characters are same.
Sample Testcase : aabacc
Sample Output :
Finally 21 Students were selected for the next round.
Round 2:(Technical Face to Face Interview)
This round was a formal interview conducted by the company officials.It started with a brief introduction of mine including a mention of all my favorite subjects.Meanwhile the interviewer went through my Resume and now he started with the questions.
Firstly he asked me about the project mentioned in my Resume to tell about the Frameworks used in it and the reason for choosing it as a project.
Then he moved on to Tech Questions which are listed below.
- You are given an array and you have to answer q queries, each query is given with two integers l and r. In each query you have to tell the sum of all array elements between indices l and r.Tell the best space and time efficient method.
- Now suppose there’s an update query which changes certain elements of the array alongwith the Range Sum Query.Tell the Data Structure which supports this with best space and time complexity.
- Logical Implementation (not actual code) of Segment Tree for Range Queries (basically related to above two questions only).
- Which properties of DBMS makes it worthy enough to hold and operate Relational Data.
- Description of ACID properties.
- You have to implement a Task Scheduler where tasks are coming in continuous stream.Each task is associated with two kind of information, its name and its priority value.Now the task scheduler works in such a way that every time the task which is going to execute next must be highest in priority among all the tasks arrived till its execution starts.
Tell the Data Structure to implement it and explain the logic.(Hint: Max Heap, Topological Sorting).
- You are given a string in JAVA which actually represents a floating point number.You have to convert this number to a long integer without any data loss.Use of library functions are allowed.
Finally he asked me if I have any questions for him.
This round was last stage of the series.It started with the common question Tell me about yourself and proceeded with the questions like Why Sprinklr, What is your understanding about the company, What are your Expectations from the company, Is the location comfortable for you and few others.
Finally total 5 students were listed in the final selections and I was one among them.
It was a quite a good experience and Competitive Programming , Data Structure Concepts and my Confidence helped me a lot to grab this opportunity.
Good Luck to ALL.