Filter interviews by
I appeared for an interview before Feb 2024.
Characteristics of OOP include encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Inheritance: Ability to create new classes based on existing classes.
Polymorphism: Ability to use a single interface for different data types or classes.
Abstraction: Hiding the implementation details and showing only the necessary features.
Dynamic refers to runtime behavior while object refers to a specific instance of a class.
Dynamic behavior is determined at runtime, while objects are instances of classes
Dynamic programming languages allow for dynamic behavior, while objects are static entities
Examples: In Python, dynamic behavior can be seen with dynamic typing, while objects are created using classes and instantiated as objects
finalize and compose are methods used in software development to manage resources and create complex objects.
finalize is a method in Java used for cleanup operations before an object is garbage collected
compose is a design pattern where objects are combined to create a more complex object
finalize is discouraged to be used in modern Java due to unpredictability
Indexes are data structures that improve the speed of data retrieval operations in databases.
Indexes are used to quickly locate data without having to search every row in a database table.
They are created on columns in a database table to speed up the data retrieval process.
Examples of indexes include primary keys, unique keys, and non-unique keys.
Use a SQL query with a GROUP BY clause to delete duplicate records.
Use a SELECT statement with a GROUP BY clause to identify the duplicate records.
Use the DELETE statement with a subquery to delete the duplicate records.
Make sure to keep the record with the lowest ID or timestamp if needed.
Views are virtual tables generated from a query, while temp tables are physical tables stored in tempdb for temporary use.
Views are saved queries that act as virtual tables, while temp tables are physical tables stored in tempdb.
Views are not stored physically on disk, while temp tables are stored in tempdb.
Views are used for simplifying complex queries and providing security, while temp tables are used for storing tem...
I applied via Campus Placement and was interviewed before Apr 2023. There were 4 interview rounds.
Basic aptitude test with reasonings
DSA related coding probleme
Join in SQL is used to combine rows from two or more tables based on a related column between them.
Join is used to retrieve data from multiple tables based on a related column
Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column
There are four types of joins in SQL: INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.
INNER JOIN: Returns rows when there is at least one match in both tables.
LEFT JOIN: Returns all rows from the left table, and the matched rows from the right table.
RIGHT JOIN: Returns all rows from the right table, and the matched rows from the left table.
FULL JOIN: Returns rows when there is a match in one of the tables.
Html page starts with the <html> tag.
Html page starts with the <html> tag.
The <html> tag defines the root of an HTML document.
All other HTML elements must be nested inside the <html> tag.
I applied via LinkedIn and was interviewed in Dec 2021. There were 2 interview rounds.
Indus Net Technologies interview questions for designations
Top trending discussions
I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
posted on 10 Nov 2015
I appeared for an interview before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
I appeared for an interview in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
A time range is given you can attempt with in that time and once started you cant resume .
Given a string STR
containing both lowercase and uppercase letters, the task is to sort the string so that the resulting string contains uppercase and lower...
Sort a string with alternate lowercase and uppercase letters in sorted order.
Create two separate arrays for lowercase and uppercase letters.
Sort both arrays individually.
Merge the two arrays alternately to form the final sorted string.
Given a string containing only parentheses and letters, your goal is to remove the minimum number of invalid parentheses to make the input string valid and return all possible v...
Given a string with parentheses and letters, remove minimum invalid parentheses to make it valid and return all possible valid strings.
Use BFS to explore all possible valid strings by removing parentheses one by one
Keep track of visited strings to avoid duplicates
Return all unique valid strings obtained after removing minimum number of parentheses
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 iterate to calculate F(N) efficiently.
Time complexity can be optimized to O(N) using dynamic programming.
Example: For N = 5, the 5th Fibonacci number is 5.
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
K = 2
1 1
K = 4
1 4 6 ...
To find the Kth row of Pascal's Triangle given a non-negative integer K.
Create an array to store the values of the Kth row of Pascal's Triangle
Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate the values
Return the array as the output
Tip 1 : Basics of java should be clear
Tip 2 : Do maximum question on strings and array
Tip 1 : Atleast 1 good project
Tip 2 : Good ranks on websites like hackerrank , leetcode.
based on 3 interviews
Interview experience
based on 62 reviews
Rating in categories
Software Engineer
315
salaries
| ₹3.2 L/yr - ₹13.3 L/yr |
Senior Software Engineer
164
salaries
| ₹4.2 L/yr - ₹13 L/yr |
Associate Software Engineer
156
salaries
| ₹1.8 L/yr - ₹8 L/yr |
Team Lead
46
salaries
| ₹5.1 L/yr - ₹13 L/yr |
Business Analyst
43
salaries
| ₹4.3 L/yr - ₹15 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions