Ping Identity Software Engineer2 Interview Questions and Answers

Asked 2 medium level questions.
1 - provided an array of integers return array of integers which will contain index of next greater element.

2 - provided array of strings and asked to find kth largest number.
number can upto 10^31 which is in string.

Hackerrank was used for test

Q1. Implement BFS to find the nearest neighbour
Ans. 
Implement BFS algorithm to find the nearest neighbour
• Create a queue to store nodes to be visited

• Start with the initial node and add it to the queue

• While the queue is not empty, dequeue a node, visit its neighbours, and add them to the queue

• Repeat until the nearest neighbour is found
Answered by AI
Add your answer
Q2. Implement Priority queue using heap.
Ans. 
Priority queue can be implemented using a heap data structure.
• Create a min heap or max heap based on the priority order needed.

• Insert elements into the heap based on their priority level.

• Remove elements from the heap based on their priority level.

• Heapify the heap after each insertion or deletion operation.

• Example: Implementing a min heap for a priority queue where lower values have higher priority.
Answered by AI
Add your answer

Basic aptitude questions to

Basic coding questions

Q1. Thanks tougfh roubd was there
Add your answer
Q2. What type of round was conducted during the interview?
Add your answer

OA test 3 Dsa questions 2 medium 1 hard you have to solve 1.5 questions in 120 minutes

Q1. DSA Round Astreoid collision leetcode
Add your answer
Q2. Dp question based on exclusion and inclusion
Add your answer

DSA 2 question
1 -> Find Lca and traverse a tree path available on GFG
2 -> LinkedList pallindrome check (you have to solve that in 0(1) space complexity)

Q1. MC question on desing pattern
Add your answer
Q2. Graph question, tree and hash
Add your answer
Q3. Design Book my show
Add your answer

Dp question of jump game

Q1. What is ambitionbox
Add your answer
Q2. How many questions are there in that
Add your answer

Q1. Same as above questions
Add your answer
Q2. Same as above questions second one
Add your answer

Basic questions only.

Q1. Basic questions like, how react works?
Add your answer
Q2. What is the equivalent of ReactDOM in mobile application development?
Ans. 
The equivalent of ReactDOM in mobile application development is React Native.
• React Native is a framework for building mobile applications using React.

• It allows developers to write code in JavaScript and render native components.

• Just like ReactDOM in web development, React Native handles rendering components to the screen.
Answered by AI
Add your answer

3 coding questions, medium

Q1. Related to string and prefix sum
Add your answer
Q2. How priority queue works and its implementation using min heap
Ans. 
Priority queue is a data structure that stores elements based on their priority, allowing for efficient retrieval of the highest priority element.
• Priority queue can be implemented using a min heap, where the root node always contains the minimum element.

• Insertion: Add the new element to the end of the heap and then heapify up to maintain the min heap property.

• Deletion: Remove the root node (minimum element), move the l...read more
Answered by AI
Add your answer