Skip to content

CRED Coding Questions - DSA Problems & Solutions

Practice CRED placement paper coding questions with detailed solutions. Access CRED OA coding problems in Python, Java, JavaScript.

This page contains CRED coding questions from CRED OA placement papers with detailed solutions.

CRED OA Coding Section:

  • Problems: 2-3 coding problems
  • Time: 90 minutes
  • Languages: Python, Java, JavaScript
Q1: Find the length of longest common subsequence between two strings.

Solution (Python):

def longestCommonSubsequence(text1, text2):
m, n = len(text1), len(text2)
dp = [[0] * (n + 1) for _ in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if text1[i-1] == text2[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
return dp[m][n]

Time Complexity: O(m × n)


Practice CRED coding questions regularly!