SPRINKLR Associate DevOps Engineer Interview Questions and Answers

Three questions regarding dynamic programming and arrays

Q1. Largest Common Subsequence DP problem
Ans. 
Largest Common Subsequence DP problem involves finding the longest subsequence that is common to two given strings.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of common subsequences of substrings.

• Traverse the array to find the length of the largest common subsequence.

• Example: Given strings 'ABCD' and 'ACD', the largest common subsequence is 'ACD'.
Answered by AI
Add your answer
Q2. Palindromes in a string
Ans. 
Check if a string contains any palindromes
• Iterate through each string in the array

• Reverse the string and compare it with the original string to check for palindrome

• Return true if any palindrome is found, false otherwise
Answered by AI
Add your answer

Q1. Sql vs No Sql
Ans. 
SQL is a traditional relational database management system, while NoSQL is a non-relational database system.
• SQL is structured, uses tables with rows and columns, and follows ACID properties.

• NoSQL is unstructured, uses collections of documents, key-value pairs, or graphs, and is horizontally scalable.

• SQL is better for complex queries and transactions, while NoSQL is better for large amounts of data and flexible schemas.
Answered by AI
Add your answer

Q1. Basic HR questions
Add your answer