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

SDE - 1

Pegasystems
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
I started my preparation right from the first year of college. Later, I began practicing Data Structures and Algorithms regularly on the CodeStudio platform by Coding Ninjas.
Application story
This is an on-campus opportunity. The company visited our campus for the selection process, and I applied for it.
Why selected/rejected for the role?
I was rejected for this role because I was unable to provide an optimized solution for one of the questions.
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, System Design
Tip
Tip

Tip 1: Practice at least 250 questions.
Tip 2: For example, complete at least 2 projects.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1: Include some real projects on your resume.
Tip 2: Avoid adding any false information to your resume.

Interview rounds

01
Round
Medium
Video Call
Duration60 mins
Interview date14 Oct 2022
Coding problem2

1. Find Duplicate in Array

Easy
15m average time
85% success
0/40
Asked in companies
IBMBNY MellonAmazon

You are given an array of integers 'ARR' containing N elements. Each integer is in the range [1, N-1], with exactly one element repeated in the array.

Your task is to find the duplicate element. The duplicate element may be repeated more than twice in the error, but there will be exactly one element that is repeated in the array.

Note :

All the integers in the array appear only once except for precisely one integer which appears two or more times.
Problem approach

You are given an integer array (ARR) of size N, which contains numbers ranging from 0 to (N - 2). Each number appears at least once. This means if N = 5, the array contains numbers from 0 to 3, and among these numbers, there is exactly one number that appears twice. Your task is to find and return the duplicate number present in the array.

Try solving now

2. Disjoint Intervals

Moderate
30m average time
70% success
0/80
Asked in companies
MeeshoAmazonSprinklr

Given a 2D array of size Nx2 which contains a set of ‘N’ intervals. Each interval contains a starting point and an ending point. You need to find the size of the maximal set of mutually disjoint intervals.

Two sets [a,b] and [c,d] are disjoint intervals if there is no common point between these two intervals.

For example: [5,7] and [8,10] are disjoint intervals but the intervals [5,7] and [7,10] is not a disjoint interval as they have a common point, 7 in them.

Problem approach

You are given a 2D array of size Nx2, representing a set of 'N' intervals. Each interval consists of a starting point and an ending point. Your task is to find the maximum number of mutually disjoint intervals (intervals that do not overlap with each other).

Try solving now
02
Round
Medium
Video Call
Duration60 mins
Interview date14 Oct 2022
Coding problem2

1. Trapping Rain Water

Moderate
15m average time
80% success
0/80
Asked in companies
RazorpayMorgan StanleyUber

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.



Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].

Output: 10

Explanation: Refer to the image for better comprehension:

Alt Text

Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
Problem approach
  • Using the Two-Pointer Approach: O(1) space and O(N) time
  • Using a Stack: O(N) space and O(N) time
Try solving now

2. Copy List with Random Pointer

Easy
10m average time
90% success
0/40
Asked in companies
Urban Company (UrbanClap)AmazonMeesho

Given a linked list having two pointers in each node. The first one points to the next node of the list, however, the other pointer is random and can point to any node of the list or null. The task is to create a deep copy of the given linked list and return its head. We will validate whether the linked list is a copy of the original linked list or not.

A deep copy of a Linked List means we do not copy the references of the nodes of the original Linked List rather for each node in the original Linked List, a new node is created.

For example,

example

Random pointers are shown in red and next pointers in black.

Problem approach

You are given a linked list where each node contains two pointers. The first pointer points to the next node in the list, while the second pointer, called the random pointer, can point to any node in the list or be null. Your task is to create a deep copy of this linked list and return the head of the copied list. We will verify whether the copied linked list is an exact replica of the original list.

Try solving now
03
Round
Medium
HR Round
Duration30 mins
Interview date14 Oct 2022
Coding problem2

1. Basic HR Questions

  • Tell me about yourself.
  • Why should I hire you?
  • What are your strengths and weaknesses?

2. Basic HR Questions

  • Why do you want to work at our company?
  • What is the difference between confidence and overconfidence?
  • What is the difference between hard work and smart work?
     

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 | 5 problems
Interviewed by Pegasystems
1039 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Pegasystems
1224 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Pegasystems
1511 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Pegasystems
1614 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes