Codingmart Technologies Interview Experience

About Company:

Codingmart was founded in 2012 by Mr.​ Senthilkumar as a proprietorship and converted into a private limited in 2015.​ Its headquarters is in Bangalore and a Development center is in Coimbatore. Codingmart started with a mission of providing premium IT consulting for consumer and B2B brands in India and actively driving the same one more thing is that it is a product-based company.

I attend this interview on-campus in my college in 2023.

Recruitment process:

• Written Test Round
• Technical Round
• HR Round

1. Written Test Round

This round is full and fully based on data structures and algorithms-based mcqs and guesses the output-like questions that are also based on data structures.

There will be 25 mcqs and some of these are as follows:

1. What is the hash function used in linear probing?
2. . Suppose the numbers 50,30,70.20,10.25,23,27,21,40.35.45.47,46.49.48,60.90,80,100,95.97.98 are inserted in that order into an initially empty binary search tree. From what node to node will have the longest diameter
3. Find the vertical order traversal for the given Binary Search tree (BST)
4.  How is the 4th element in an array accessed based on pointer notation
5. . Find the post-order traversal of a given binary search tree(BST)
6.  Given a linked list with values 10,20,30 which of the following snippet code will insert a node between 10 & 20
7.  What is the space complexity of the following snippet cod
8. . Consider a Linked list of values 1,2,3,4,5,6,7,8,9,10. what is the functionality of the following code
9.  in which data structure is supporting insertion and deletion can be performed at both ends?
10.  Convert infix expression to postfix expression using stack A+B-C*D
11. The following function append() is supposed to create a Circular linked list (singly). There is one line missing at the end of the function… What should be added in place of /* ADD A STATEMENT HERE */ so that the function correctly creates a circular linked list
12.  876-4*/83*+4+5/ – The evaluation of the above postfix expression is
13. Which of the following algorithms provides the best time complexity in the worst-case scenario type questions

2. Technical Round

There will be only one programming question. You have to code it and then HR will ask you to explain the concept and logic on which you code it. The coding time will be 45 minutes.

The question given to me is given as follows:

Decode the Slanted Ciphertext

C++

#include <iostream>
#include <string>

using namespace std;

string encodeSlantedCiphertext(const string& plaintext, int numRows) {
    string encodedString = "";

    for (int i = 0; i < numRows; i++) {
        int charIndex = i;
        int direction = 1; // Direction of traversal: 1 for down, -1 for up

        while (charIndex < plaintext.length()) {
            encodedString += plaintext[charIndex]; // Add the character to the encoded string

            if (i == 0 || i == numRows - 1) {
                charIndex += 2 * (numRows - 1); // Move to the next character in the column
            } else {
                charIndex += 2 * (numRows - i - 1) * direction; // Move to the next character in the diagonal
                direction *= -1; // Reverse the direction
            }
        }
    }

    return encodedString;
}

int main() {
    string plaintext;
    int numRows;

    cout << "Enter the plaintext: ";
    getline(cin, plaintext);

    cout << "Enter the number of rows: ";
    cin >> numRows;

    cin.ignore(); // Ignore the newline character

    string encodedString = encodeSlantedCiphertext(plaintext, numRows);

    cout << "Plain text: " << plaintext << endl;
    cout << "Encoded string: " << encodedString << endl;

    return 0;
}

3. HR Round:

The resume tells all about you so that HR will ask questions based on your resume and hence you have to prepare your resume in a way you will be confident in any topic which mentioned in your resume.

This is just for 3 to 4 hours based on your answers.