zoukankan      html  css  js  c++  java
  • Microsoft Interview for SDET2

    They will chat your porject with you in english. and then wirter some algorithm,then write some test case.
     
     1. Give you a website which just implement one function: translating. such as: Chinese will be translated to English. there is a Textbox to input,a Button to click and a Label to return the result from translated.
     Question: please try to write more test cases to test this website.
     
     // The below algorithm is from Microsoft
    2.  The function will return the count of str1 containing str2.
            such as: str1=abc, str2=ab, return 1
            str1=aaa, str2=aa, return 2 ....
      
            /// <summary>
            ///  The function will return the count of str1 containing str2.
            ///  such as: str1=abc, str2=ab, return 1
            ///  str1=aaa, str2=aa, return 2 ....
            /// </summary>
            /// <param name="str1"></param>
            /// <param name="str2"></param>
            /// <returns></returns>
            public int ContainNumber(string str1, string str2)
            {
                if (string.IsNullOrEmpty(str1))
                    return 0;
                if (string.IsNullOrEmpty(str2))
                    return 0;
                if (str1.Length < str2.Length)
                    return 0;
                int number = 0;
                int i=0;
                    while(str1.Length - i >= str2.Length)
                    {
                        string temp = str1.Substring(i, str2.Length);
                        if (temp == str2)
                        {
                            number++;
                        }
                        i++;
                    }
               
                return number;
            }

            /// <summary>
            /// the function will return the content between quotation in one string inputed.
            /// such as:   input str:  I am "from" china, I love "china". this sentence will return a list which take two eletements
            /// from, china.
            /// </summary>
            /// <param name="str"> </param>
            /// <returns></returns>
            public List<string> GetContentOfQuotation(string str)
            {
                if (string.IsNullOrEmpty(str))
                    return null;
                List<string> Qlist = new List<string>();
                int i=0;
                int start = 0;
                while (i < str.Length)
                {
                    if (str[i] == '"')
                    {
                        start = i;
                        i++;
                        while (i < str.Length)
                        {
                            if (str[i] == '"')
                            {
                                Qlist.Add(str.Substring(start+1, i - start-1));
                                break;
                            }
                            i++;
         }                  
                    }
                    i++;
                }
                return Qlist;
            }

           /*
            At last:  All the method, you should writte test case to test these method.      
           */

    4. how to ensure night point on one circular?

    -------------------------------------------------------------

    5. reverse wards by space. And write test case

    6. Given two parameters, string sentence and int length. Then you should cut the sentence by the specific length. But if the cut point located in a vocabulary, you move the cut point in the previous space in0 front of the vocabulary. And write test case

    Example:

    String : I love this game.

    Length: 6

    Result: I love

                    this

                    game.

     

    String : I love basketball.

    Length: 6

    Result: I love

    Give a message here: the cut point located in “basketball” which is a vocabulary

  • 相关阅读:
    java传递String参数
    C++ string与int的互相转换
    java插入排序
    凸包Graham Scan算法实现
    求平面上N点最远两点和最近两点距离
    求最大公约数
    n个数连接得到最小或最大的多位整数(携程)
    Java快排
    背包问题
    二分查找离左边元素最近的(可以等于)
  • 原文地址:https://www.cnblogs.com/tomin/p/1879904.html
Copyright © 2011-2022 走看看