Vinove Software & Services Network Security Interview Questions and Answers

Round duration - 40 minutes
Round difficulty - Easy

Round duration - 95 Minutes
Round difficulty - Medium

Q1. 
Problem: Permutations of a String
Given a string STR consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
Explanatio...read more
Ans. Backtracking
The idea is to fix a character at a position and then find the permutations for rest of the characters.
Make a list ‘ans’ which will contain the permutations of the given string.
 
Algorithm:
Let’s define a function generatePermutaionsHelper(Str, l, r). This function generates the permutations of the substring which starts from index  ‘l’ and ends at index  ‘r’.
• Call the function: generatePermutai...read more
Answered Anonymously
Add your answer
Q2. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer