New update is available. Click here to update.

SDE - 1

JUSPAY

3 rounds | 5 Coding
problems

837 views

0 comments

2 upvotes

Interview preparation journey

Preparation

Duration: 3 Months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming

Tip

Tip 1 : Do not rush into things. Learning takes time. Focus should be on the concepts and not just on leaving topics half-prepared. Devote 70% of both time and effort to DSA. I solved a total of around 500 questions on sites like GFG and Leetcode. Do not repeat similar questions just to increase the count of the number of questions

Tip 2 : Competitive Programming is a bonus and not a necessity, rather focus on core DSA based problems before trying CP. Do not pursue CP if you do not like it. Devote that extra time to core CS subjects and aptitude preparation.

Tip 3 : Projects play an important role too, do no ignore them. Try to get your hands dirty with a little bit of every field i.e., frontend, backend, and database.

Application process

Where: Campus

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Try to make a single-page resume. Highlight skills, projects, and work experience more than CGPA. Ensure proper spacing and font to maintain professionalism.

Tip 2 : Do not lie on a resume. Everything written on your resume must be known by you in and out.

Interview rounds

01

Round

Easy

Video Call

Duration45 Minutes

Interview date5 Jul 2022

Problems2

String Transformation

view more

Problem approach

Given a string (STR) of length N, you have to create a new string by performing the following operation:

Take the smallest character from the first 'K' characters of STR, remove it from STR and append it to the new string.

You have to perform this operation until STR is empty.

Maximum Subarray Sum

view more

Problem approach

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.

For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.

Given the array [-5, -1, -8, -9], the maximum sum would be -1.

02

Round

Easy

Video Call

Duration45 Minutes

Interview date5 Jul 2022

Problems2

Maximum sum of non-adjacent elements

view more

Problem approach

You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of the subsequence with the constraint that no two elements are adjacent in the given array/list.

Trapping Rainwater

view more

Problem approach

You have been given a long type array/list 'ARR' of size 'N'. It represents an elevation map wherein 'ARR[i]' denotes the elevation of the 'ith' bar. Print the total amount of rainwater that can be trapped in these elevations.

03

Round

Easy

Video Call

Duration45 minutes

Interview date5 Jul 2022

Problems1

Strongly Connected Components (Tarjan’s Algorithm)

view more

Problem approach

You are given an unweighted directed graph of 'V' vertices and 'E' edges. Your task is to print all the strongly connected components (SCCs) present in the graph.

Start a Discussion

Similar interview experiences

SDE - 1

2 rounds | 1 problems

Interviewed by JUSPAY

488 views

0 comments

0 upvotes

SDE - Intern

1 rounds | 2 problems

Interviewed by JUSPAY

517 views

0 comments

0 upvotes

SDE - Intern

3 rounds | 4 problems

Interviewed by JUSPAY

0 views

0 comments

0 upvotes

SDE - 1

2 rounds | 3 problems

Interviewed by JUSPAY

116 views

0 comments

0 upvotes

Companies with similar interview experiencs

SDE - 1

5 rounds | 12 problems

Interviewed by Amazon

57332 views

15 comments

0 upvotes

SDE - 1

4 rounds | 5 problems

Interviewed by Microsoft

25818 views

3 comments

0 upvotes

SDE - 1

3 rounds | 7 problems

Interviewed by Amazon

18070 views

4 comments

0 upvotes

Popular Interview Experiences: