Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Mar 2023. There were 3 interview rounds.
There are simple coding and algorithm test
OOPS stands for Object-Oriented Programming System. Multithreading is the ability of a CPU to execute multiple threads concurrently.
OOPS is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
Multithreading allows multiple threads to exist within the context of a single process, each executing independently and concurrently.
Example of O...
I applied via Naukri.com and was interviewed before Feb 2023. There were 3 interview rounds.
Tell me about your Resume and Take any topic and talk about it for 5 mins.
Write a CRUD operations code in JAVA
Tecnics Integration Technologies interview questions for popular designations
I applied via Naukri.com and was interviewed before May 2022. There were 4 interview rounds.
Resume discussion and discussion about any topic of your choice
Java code to perform CRUD operations
I applied via Naukri.com and was interviewed before Mar 2021. There were 3 interview rounds.
Top trending discussions
posted on 21 Mar 2015
I was interviewed before Aug 2016.
I was interviewed in Apr 2017.
I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.
Experienced software developer
Passionate about coding and problem-solving
Supportive family that encourages my career in tech
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was an easy round which went really smooth.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using F(n-1) and F(n-2).
Ensure the input N is within the constraints 1 <= N <= 10000.
Example: For N = 5, the 5th Fibonacci number is 5 (1, 1, 2, 3, 5).
Given a positive integer N
, your task is to determine and return all prime numbers less than or equal to N
.
N = 10
2 3 5 7
N = 20
Implement a function to return all prime numbers less than or equal to a given positive integer N.
Create a function that takes a positive integer N as input
Iterate from 2 to N and check if each number is prime
Use a helper function to determine if a number is prime
Return an array of all prime numbers less than or equal to N
A merge join in SQL is a method of combining two sorted datasets by matching corresponding rows based on a specified condition.
Merge join is used when joining two large datasets that are already sorted.
It is more efficient than other join methods like nested loop join or hash join for sorted datasets.
The join condition must be an equality condition.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.i
Round duration - 30 minutes
Round difficulty - Easy
The round went excellent. I really enjoyed it. Just be confident about whatever you answer
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 6 interviews
Interview experience
based on 103 reviews
Rating in categories
Software Engineer
186
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Wipro
HCLTech
Tech Mahindra
Infosys