HighRadius Fullstack Developer Intern Interview Questions and Answers

Round duration - 75 minutes
Round difficulty - Easy

2 coding problems were asked

Candidates who solved both the questions in the first 45 mins get shortlisted. 12 candidates including me got shortlisted.

Q1. 
Longest Common Subsequence Problem Statement
Given two strings STR1 and STR2, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...read more
Add your answer
Q2. 
Graph Connectivity Queries Problem
Given a graph with N nodes and a threshold value THRESHOLDVALUE, two distinct nodes X and Y are directly connected if there exists a Z such that:
X % Z == 0
Y % Z == 0
Z ...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round 2 : HR + Technical Round Time -60 Mins
Firstly we greet each other and then we have talked about my projects and stuff. After that, he gave me some technical questions and I have to choose any three of them and write the code for them. I finished with all the three questions in about 15-20 min since i have solved similar questions while practicing.
What are the various formatting tags in HTML?
What is Pattern Matching in SQL?

After solving those questions we have discussed about our city since i and the interviewer both are from the same city, after that we were finished the interview.

After a very stressful night, the Next day results were declared and 7 out of 12 candidates including me got selected for the internship.

Q1. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Add your answer
Q2. 
Second Most Repeated Word Problem Statement
You are given an array of strings ARR. The task is to find out the second most frequently repeated word in the array. It is guaranteed that each string in the a...read more
Add your answer
Q3. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Add your answer
Q4. 
Four Keys Keyboard Problem Statement
Imagine you have a special keyboard with four keys:
• Key 1: (A) to print one ‘A’ on screen.
• Key 2: (Ctrl-A) to select the entire screen.
• Key 3: (Ctrl-C) to copy th...read more
Add your answer