Tip 1: Practice basic coding questions, such as writing a program to generate the table of 5.
Tip 2: Practice SQL query questions.
Tip 3: Learn Excel, from basic to advanced.
Tip 1: Add at least 2 projects.
Tip 2: Don't include irrelevant information in the resume.
Tip 3: The resume should be clean and concise.
In this round the examiner ask me questions from my resume. He had given me 1 basic coding questions to solve, and given some SQL query questions to solve. Also he ask me questions from excel and questions from projects.



String 'S' is NOT case sensitive.
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
Create two utility functions to get the first and last positions of characters present in the string.
Start traversing the string and keep finding the positions of the first and last characters during each iteration.
If the first and last characters are the same for every iteration and the string is completely traversed, print 'YES'. Otherwise, print 'NO'.
Write an SQL query to get the current date.
Write an SQL query to create a new table that contains both the data and structure copied from another table.
Write an SQL query to find all the employees whose salary is between 50,000 and 100,000.
How to Freeze the Top Row and First Column in Excel?
What is conditional formatting in Excel?
Which process do you use to clean unwanted data from a large dataset?
In this round, the interviewer asked me two medium-level coding questions. He also asked me questions about machine learning, DBMS, Excel, and Power BI.



If the given grid is this:
[7, 19, 3]
[4, 21, 0]
Then the modified grid will be:
[7, 19, 0]
[0, 0, 0]
The idea is to maintain two additional arrays, say rows[] and cols[], to store the rows and columns that contain at least one element equal to 0. First, traverse the entire matrix, and for each mat[i][j] = 0, mark rows[i] = true and cols[j] = true. In the second traversal, for each cell (i, j), if either rows[i] or cols[j] is marked as true, update mat[i][j] = 0; otherwise, continue to the next cell.



1. You can only move one disk in one move.
2. You can not place a larger disk on top of a smaller disk.
3. You can only move the disk at the top of any rod.
You may assume that initially, the size of the ‘i’th disk from the top of the stack is equal to ‘i’, i.e. the disk at the bottom has size ‘N’, the disk above that has size ‘N - 1’, and so on. The disk at the top has size 1.

The idea is to use the helper node to reach the destination using recursion. Below is the pattern for this problem:
What is the order of appearance of the common clauses in a SELECT query?
Write an SQL query to retrieve the last N rows from the SQL table.
What is dictionary comprehension? Give an example.
Why can't we use linear regression for a classification task? (Learn)
What are some of the hyperparameters of the Random Forest Regressor that help avoid overfitting?
Explain some methods for handling missing values in that data. (Learn)

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?