HighRadius Software Developer Intern Interview Questions and Answers

Q1. Merge two sorted linked lists
Ans. 
Merge two sorted linked lists into a single sorted linked list
• Create a new linked list to store the merged result

• Iterate through both input linked lists and compare nodes to determine the order in which they should be added to the result list

• Handle cases where one list is longer than the other
Answered by AI
Add your answer
Q2. Check if paranthesis are balanced or not
Ans. 
To check if parentheses are balanced, use a stack data structure to keep track of opening and closing parentheses.
• Use a stack to push opening parentheses and pop when encountering a closing parenthesis

• If stack is empty when encountering a closing parenthesis, return false

• After iterating through all parentheses, if stack is empty, return true
Answered by AI
Add your answer

Q1. Right view of a Binary Search tree
Ans. 
The right view of a Binary Search Tree shows the nodes that are visible when viewing the tree from the right side.
• The right view of a Binary Search Tree includes the rightmost node at each level.

• Nodes at each level that are not visible from the right side are not included in the right view.

• Example: For the Binary Search Tree with values 1, 2, 3, 4, 5, the right view would be 1, 3, 5.
Answered by AI
Add your answer
Q2. Few javascript questions on how to parse a json object without using inbuilt libraries.
Add your answer

Round duration - 75 minutes
Round difficulty - Easy

Simple question based on strings was given. MCQs based on basic aptitude and programming questions were asked. 
Tips: Time management is important. Remember all the syntaxes

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
This can be done by iterative swapping using two pointers. The first pointer points to the beginning of the string, whereas the second pointer points to the end. Both pointers keep swapping their elements and go towards each other. Essentially, the algorithm simulates the rotation of a string with respect to its midpoint.
Time Complexity : O(n)
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was a good experience.
Tips: If you don't know something just tell them. Don't try to answer something if you don't know anything about it

Q1. 
One Away Transformation Problem
Given two strings, A and B, determine whether A can be transformed into B by performing at most one of the following operations (including zero operations):
1. Delete a ch...read more
Ans. 
The idea is to create a new character array and copy the characters from the original String before the given position
After that, we put the new character at the position and copy the rest of the characters from the original String in the subsequent positions of the new array.
Other option can be to directly use the already defined methods such as insert().
Answered Anonymously
Add your answer
Q2. 
Remove Duplicates from String Problem Statement
You are provided a string STR of length N, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...read more
Ans. 
Hashing can be used to approach this problem.
Use a hash map and maintain count of the occurrences of all the characters in the string which character as the string and count as the value. At last, traverse the hash map and print all those characters with count > 1. 
Time Complexity : O(N) where N is the length of the string
Space Complexity : O(N)
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was easy. I could answer the first question. Second one I answered really badly