Talscale Score 9.9/10.

Curriculum Vitae

ADARSH S SRIVASTAV
Address : Gachibowli, Hyderabad-500032
Mob: +91- 7406962012
E-mail: adrshsrivastav@gmail.com

Carrier Objective

Intend to build a career with leading corporate infused with hi-tech environment comprised of
committed & dedicated people, which will help me in evolving myself and making a rewarding
and enriched career.

Work Experience

Amazon 26th Sept 2016 – Present

Designation : SDE – I
- Complete ownership of the project from development to production rollout of Migration
of data source for Label and Manifest generation in Transportation World.
- Multiple Business tasks related to enabling new feature for the upstream and downstream
services in Transportation Domain.
- Re-architecture the module for handling special case handlers for carriers, used for
generating different ID’s as part of Self-serve architecture.
- Launched label and manifest generation in Brazil. On-boarded multiple new carriers to
Amazon
- Deprecating the legacy IDGenerator services and on-boarding to the current
IDGeneration Service.
- Mentoring the Interns for completing their POC project based on consuming SQS
messages from the source and comparing the results and storing back to S3 data storage.
- Designing the test suite framework for automating the testing environment across
services, co-ordinating with the different service owners to onboard on the stack.
- Got the opportunity to work on few peak preparation tasks related to infrastructure
settings, service-related additions, live-merge and a small gamma testing automation tool
task.

Bluestone.com 20th June 2016 – 23rd Sept 2016

Designation : Software Engineer
- Worked on internal CRM website. MVC based development with Hibernate as backend.
Worked on end to end development starting from writing JSP pages to Model classes for
interaction with DB.

Samsung R&D Institute Bangalore 17th July 2014 – 6th June 2016
Designation : Sr. Software Engineer
- Understanding of Display Framework, Boot loader, Schedulers, Display Drivers
- Worked on an Automation tool for SOC testing: Frame buffer Driver Testing, Passing
parameters to kernel while booting.
- Boot loader code enhancement, testing and porting.

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

- Worked on HMP based scheduler : Optimizing the Power vs Performance

Trade-off involved in load balancing and task wake up related issues.
- Currently working on Zone Based Schedulers.

Educational Background

CPI
Year University/
Examination Institute /Perce
Board
ntage
M Tech(IT) 2014 IIIT-Allahabad IIIT-A 8.6

B Tech (IT) 2011 Doon valley institute of Kurukshetra 79.57

engineering & technology, Karnal University %

Intermediate/+2 2007 Lions School, Mirzapur CBSE 82.8%

High School/10th 2005 Lions School, Mirzapur CBSE 78.8%

Note: CPI is to be multiplied by 10 to convert into percentage.

Technical Skills

 Programming Eclipse, Spring Tool Suite, IntelliJ, MS Visual Studio,

Environments
 Programming C, C++ , Core Java, Python (Beginner)
Languages
 Databases Sql, MongoDB (Beginner)

 Web Django (Beginner), Bootstrap, Hibernate, Spring MVC, Html,

Technologies ASP.NET (Prior Exp.)

Educational Projects

Thesis [M Tech ]
Project Title Stock Trend Prediction of Indian Market using a hybrid model of SVM-
ABC and a modified technical indicator

Duration 1 Year

Technology and tools Machine Learning, Java, LibSVM, Eclipse

Description The proposed SVM-ABC model along with a set of technical indicators

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

has produced the satisfactory results in terms of both accuracy and

generalization.

Project Details : B Tech

 During Industrial training, created a website named U-Stream using ASP.net. It was a
computerized, online solution for people who want to share and download videos.
 For final year project, created a website named Classmate.com. It was a social networking
website for classmates.

Academic Achievements

 Actively participated in National Seminar on Data Mining Application in Healthcare as a

member of organizing committee.
 Machine Learning by Stanford University on Coursera. Certificate earned on Nov 2015.
https://www.coursera.org/account/accomplishments/certificate/W6BFSRNLLTP8
 M101P: MongoDB for Developers by MongoDB University. Certificate earned on Dec
2015.
https://university.mongodb.com/course_completion/27222e729e504295911920536e21bf
ce
 Django framework and Python workshop : Created a basic blog containing news
articles, where user can create their account and like the articles.
 Spring and Hibernate workshop: Basic framework knowledge and ORM handling using
Hibernate and then Spring on top of it. A basic web application with a use of REST API.
https://github.com/adarshsrivastav/SpringHibernate

Declaration:
I hereby declare that above information is correct to the best of my knowledge and belief.

ADARSH S. SRIVASTAV

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

Developer Interview

Participant

Candidate: Adarsh S Srivastav

Email: adrshsrivastav@gmail.com
Assessment Score: 9.9/10.0
Note : The interactive assessment report can be obtained at Talscale

Round 1 - Coding Interviewed By : Raghu Bharat

Question 1 - Shortest Substring Marks Scored - 40/40

Given a string comprised of lowercase letters in the range ascii[a-z], determine the length of the smallest substring
that contains all of the letters present in the string.

For example, given the string s = dabbcabcd, the list of all characters in the string is [a, b, c, d]. Two of the
substrings that contain all letters are dabbc and abcd. The shortest substring containing all the letters is 4
characters long, abcd.

Function Description
Complete the function shortestSubstring in the editor below. The function must return the length of the shortest
substring that contains all of the characters within S.

shortestSubstring has the following parameter:

s: a string

Sample Input For Custom Testing

bab

Sample Output

Explanation

"ba" can be the substring which contains all the characters in s.

Code Output

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'shortestSubstring' function below.
*
* The function is expected to return an INTEGER.
* The function accepts STRING s as parameter.
*/
public static int shortestSubstring(String s) {
char[] mainStr = s.toCharArray();
int[] cmap = new int[200];
String subStr = "";
for(int i=0; i<mainStr.length; i++)
{
if(cmap[(int) mainStr[i]] == 0)
{
subStr += mainStr[i];
cmap[(int) mainStr[i]] = 1;
}
}

char[] charSubStr = subStr.toCharArray();

int[] subStrCountDict = new int[200];
for(int i=0; i<charSubStr.length; i++)
{
subStrCountDict[(int)charSubStr[i]] += 1;
}

int[] matchStrCount = new int[200];

int start = 0;
int maxLenWindow = 1000;
int starti = 0;
int count = 0;

for (int i=0; i<mainStr.length; i++)

{
int iStr = (int)mainStr[i];
matchStrCount[iStr] += 1;

if (subStrCountDict[iStr] >= matchStrCount[iStr])

{
count += 1;
}

if (count == charSubStr.length)
{
iStr = (int)mainStr[start];
while(matchStrCount[iStr] > subStrCountDict[iStr] || subStrCountDict[iStr]
== 0)
{

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

if(matchStrCount[iStr] > subStrCountDict[iStr])

matchStrCount[iStr] -= 1;
start += 1;
iStr = (int)mainStr[start];
}

int winLength = i - start + 1;

if (winLength < maxLenWindow)
{
maxLenWindow = winLength;
starti = start;
}

}
}
//System.out.println(s.substring(starti, starti+maxLenWindow));
return maxLenWindow;
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new
InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(
"OUTPUT_PATH")));
String s = bufferedReader.readLine();
int result = Result.shortestSubstring(s);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedReader.close();
bufferedWriter.close();
}
}

Time Input Output

27 Feb, 10:50 AM Ran Against TestCases

TestCase #0: Success

TestCase #1: Success

TestCase #2: Success

TestCase #3: Success

TestCase #4: Success

TestCase #5: Success

Question 2 - Valid Binary Search Tree Marks Scored - 59/60

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

A binary tree is a multi-node data structure where each node has, at most, two child nodes
and one stored value. It may either be:
• An empty tree, where the root is null.
• A tree with a non-null root node that contains a value and two subtrees, left and right,
which are also binary trees.

A binary tree is a binary search tree (BST) if all the non-null nodes exhibit two properties:
• Each node's left subtree contains only values that are lower than its own stored value.
• Each node's right subtree contains only values that are higher than its own stored value.

A pre-order traversal is a tree traversal method where the current node is visited first, then
the left subtree, and then the right subtree. The following pseudocode parses a tree into a list
using pre-order traversal:
• If the root is null, output the null list.
• For a non-null node:
1. Make a list, left, by pre-order traversing the left subtree.
2. Make a list, right, by pre-order traversing the right subtree.
3. Output the stored value of the non-null node, append left to it, then append right to
the result.
For more detail, see the diagram in the Explanation section below.

Write a program to test whether a traversal history could describe a path on a valid BST.
Return YES on a new line if the path can be in a valid BST, or NO if it cannot.

Function Description

Complete the function isValid in the editor below. The function must return a string denoting
YES if the path can be in a valid BST, or NO if it cannot.

isValid has the following parameter(s):

a: An integer array, where the array elements denote the values encountered in the
traversal of the tree.

Sample Input 0

5
3
1 3 2
3
2 1 3

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

6
3 2 1 5 4 6
4
1 3 4 2
5
3 4 5 1 2

Sample Output 0

YES
YES
YES
NO
NO

Code Output

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'isValid' function below.
*
* The function is expected to return a STRING.
* The function accepts INTEGER_ARRAY a as parameter.
*/
public static String isValid(List<Integer> a) {
Stack<Integer> stack = new Stack<Integer>();
int mid = -1;
for(int i=0; i<a.size(); i++)
{
int ele = a.get(i);
if(ele < mid)
return "NO";

while(!stack.isEmpty() && stack.peek() < ele)

{
mid = stack.peek();
stack.pop();
}
stack.push(ele);
}
return "YES";
}

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new
InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(
"OUTPUT_PATH")));
int q = Integer.parseInt(bufferedReader.readLine().trim());
IntStream.range(0, q).forEach(qItr -> {
try {
int aCount = Integer.parseInt(bufferedReader.readLine().trim());
List<Integer> a = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", ""
).split(" "))
.map(Integer::parseInt)
.collect(toList());
String result = Result.isValid(a);
bufferedWriter.write(result);
bufferedWriter.newLine();
} catch (IOException ex) {
throw new RuntimeException(ex);
}
});
bufferedReader.close();
bufferedWriter.close();
}
}

Time Input Output

27 Feb, 10:53 AM Ran Against TestCases

TestCase #0: Success

TestCase #1: Success

TestCase #2: Success

TestCase #3: Success

TestCase #4: Success

TestCase #5: Success

TestCase #6: Success

TestCase #7: Success

TestCase #8: Success

TestCase #9: Success

TestCase #10: Success

About US Privacy Policy Terms of Service +91-7411721439

 Talscale Score 9.9/10.0

Time Input Output

TestCase #11: Success

TestCase #12: Success

About US Privacy Policy Terms of Service +91-7411721439