Filter interviews by
AI tools/process can be used to automate tasks, analyze data, make predictions, and improve decision-making.
Identify the problem or task that can benefit from AI technology
Choose the appropriate AI tools or algorithms based on the problem
Collect and preprocess data to train the AI model
Train the AI model using the data
Evaluate the performance of the AI model and make necessary adjustments
Deploy the AI model in the prod...
CI-CD process automates the building, testing, and deployment of code changes.
Continuous Integration (CI) involves automatically integrating code changes into a shared repository multiple times a day.
Continuous Deployment (CD) involves automatically deploying code changes to production after passing automated tests.
CI-CD process helps in detecting and fixing integration errors early in the development cycle.
Tools like ...
Top trending discussions
I applied via Approached by Company
Joining tables with different joins in SQL
Use INNER JOIN to return rows when there is at least one match in both tables
Use LEFT JOIN to return all rows from the left table and the matched rows from the right table
Use RIGHT JOIN to return all rows from the right table and the matched rows from the left table
Use FULL JOIN to return rows when there is a match in one of the tables
HackerRank Coding Test followed by one to one
I applied via Referral and was interviewed in Oct 2021. There were 3 interview rounds.
I appeared for an interview in Jan 2024.
Aptitude and coding on hackerrank
I applied via Campus Placement and was interviewed before Aug 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
based on 1 interview
Interview experience
Software Engineer
5
salaries
| ₹8.7 L/yr - ₹29.2 L/yr |
Senior Database Administrator
3
salaries
| ₹13 L/yr - ₹20 L/yr |
Medcode
Maxgen Technologies
Cyfuture
Value Point Systems