Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Sep 2023. There were 4 interview rounds.
Gk apti and coding questions were there
Top trending discussions
I applied via Naukri.com and was interviewed before Aug 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2018. There were 2 interview rounds.
staticmethod and class method are two types of methods in Python classes.
staticmethod is a method that belongs to a class but does not have access to the class or instance.
classmethod is a method that belongs to a class and has access to the class but not the instance.
staticmethod is used when a method does not need to access the class or instance.
classmethod is used when a method needs to access the class but not the ...
Sorting in a dictionary
Use sorted() function to sort the dictionary by keys or values
Use lambda function to sort the dictionary by custom key
Use OrderedDict() to maintain the order of the sorted dictionary
I have used 'django.db.models' package in my Django models.
The 'django.db.models' package provides the base classes for defining models in Django.
It includes classes like 'Model', 'CharField', 'IntegerField', 'ForeignKey', etc.
These classes are used to define the fields and relationships in a Django model.
For example, 'class MyModel(models.Model): name = models.CharField(max_length=50)'
This creates a model with a 'name...
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 round went well. Interview depends on your basic knowledge of C/C++.
Given two sparse matrices MAT1
and MAT2
of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...
Implement a function to multiply two sparse matrices and return the resulting matrix.
Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication
Iterate through the non-zero elements of the matrices to perform the multiplication efficiently
Handle the edge cases such as empty matrices or matrices with all zero elements
Ensure the dimensions of the matrices are compatible
Tanmay and Rohit are best buddies. Tanmay gives Rohit a challenge involving an array of N natural numbers. The task is to perform and answer a series of queries on the ...
Count the number of even or odd numbers in a range of an array based on given queries.
Create an array to store the input numbers.
Iterate through the queries and update or count even/odd numbers based on the query type.
Output the count of even or odd numbers for each query of type 1 or 2.
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
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.
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.
posted on 21 Mar 2015
I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Software Developer
123
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Application Consultant
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Developer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Analyst
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Intellect Design Arena
Nucleus Software Exports
Majesco
Coforge