IQVIA SDE-2 Interview Questions and Answers

Round duration - 20 Minutes
Round difficulty - Medium

Q1. 
Palindromic Numbers Finder
Given an integer 'N', your task is to identify all palindromic numbers from 1 to 'N'. These are numbers that read the same way forwards and backwards.
Input:
The first line pr...read more
Ans. Brute Force
In this approach, iterate through the integers 1 to N, then check for each integer if it is a palindrome or not.
To check if an integer is a palindrome, convert the integer into a string and check if it is equal to the reverse.
We define a function isPalindrome(num), where we check if num is palindrome or not and return the result accordingly.
 
Algorithm:
• The function isPalindrome(num).
  • Convert the number nu...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

Q1. Technical Question
Problems related to DB design
Add your answer
Q2. 
Minimum Knight Moves Problem
Given a square chessboard of size N x N, determine the minimum number of moves a knight requires to reach a target position from a starting position.
Input:
 The first line ...read more
Ans. Breadth-First Search
Our intuition is to think of all the positions knight can reach from the current position. This problem can be seen as the shortest path in an unweighted graph. Hence, we use BFS to solve this problem. 
A knight can move to 8 positions from (x,y). 
(x, y) -> 
    (x + 2, y + 1)  
    (x + 2, y - 1)
    (x - 2, y + 1)
&...read more
Answered Anonymously
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy