Struggling with Angular Interview Questions

Ashley Singh

Hi everyone,

I'm new to Angular development and I'm struggling with interview questions related to the framework. I've read through all of the documentation and angular article and tutorials I can find but I still feel really lost when it comes to coding challenges.

For example, I was recently asked to write a function that takes two strings and returns the longest common substring between them. I wrote the following code, but it's not working correctly - can someone please help me figure out where I'm going wrong?

function longestCommonSubstring(string1, string2) {
  let longestSubstring = '';
 for (let i = 0; i < string1.length; i++) {
    for (let j = 0; j < string2.length; j++) {
      let currentSubstring = '';
      let k = 0;
 
      while (string1[i + k] === string2[j + k]) {
        currentSubstring += string1[i + k];
        k++;
      }
      if (currentSubstring.length > longestSubstring.length)

2 Replies

Know the answer? Post it — somebody with the same question will find it here.

Amit Mohanty3y ago

function findLongestCommonSubstring(str1: string, str2: string): string {
  let longestCommonSubstring = '';
  let table: number[][] = [];

  for (let i = 0; i <= str1.length; i++) {
    table[i] = [];
    for (let j = 0; j <= str2.length; j++) {
      if (i === 0 || j === 0) {
        table[i][j] = 0;
      } else if (str1[i - 1] === str2[j - 1]) {
        table[i][j] = table[i - 1][j - 1] + 1;
        if (table[i][j] > longestCommonSubstring.length) {
          longestCommonSubstring = str1.slice(i - table[i][j], i);
        }
      } else {
        table[i][j] = 0;
      }
    }
  }
  return longestCommonSubstring;
}

Rajkiran Swain3y ago

function longestCommonSubstring(string1, string2) {
  let longestSubstring = '';
  for (let i = 0; i < string1.length; i++) {
    for (let j = 0; j < string2.length; j++) {
      let currentSubstring = '';
      let k = 0;
 
      while (string1[i + k] === string2[j + k]) {
        currentSubstring += string1[i + k];
        k++;
      }
      if (currentSubstring.length > longestSubstring.length) {
        longestSubstring = currentSubstring;
      }
    }
  }
  return longestSubstring;
}