Upload Button Icon Add office photos

Filter interviews by

Clear (1)

NoBrokerHOOD Software Developer Interview Questions and Answers

Updated 18 Oct 2023

NoBrokerHOOD Software Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in Sep 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

Programming assessment tools used to objectively evaluate a candidates programing skills across parameters such as problem solving, coding aptitude and debugging

Round 3 - One-on-one 

(2 Questions)

  • Q1. 1. Do you prefer working independently or as a part of a team
  • Ans. I'm prefer working as a part of a team
  • Answered Anonymously
  • Q2. As a part of an

Interview Preparation Tips

Interview preparation tips for other job seekers - Hi, I'm anjali devi maddu and I'm writing about the position of employ with your company . I'm submitted my resume.I think you'll find that my brief personal details could be a good fit for the job and I'd love to discuss my qualifications in more details

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: The first round had two sections. First section consisted of general aptitude and technical aptitude questions. In the second section we were given one coding question, for which we had to write the code in a language of our preference (C,C++,Java). Around 20 students were selected in the first round.

Round: Technical Interview
Experience: The second round was a technical interview. Two interviewers were present and the interview duration was 1-1.5 hours. Questions on Computer Networks, Databases, Operating Systems, Algorithms were asked. But they were more concerned about coding fundamentals especially C++ and Java. 6 students were selected in the second round.

Round: Technical Interview
Experience: Third round was again a technical interview. The interview process was same as previous second round.

Round: HR Interview
Experience: All the 6 students who were selected for the third round had a HR interview.

General Tips: The technical interview process was exhausting as the interview duration was 1-1.5 hours and challenging as they asked questions from all major fields of computer science.
Skill Tips: Prepare a decent resume and have at least 3-4 hard copies of it available with you all the times.Also do carry passport size photos with you. While going for interviews wear proper formals,carry 2-3 copies of resume and a pen.
Skills: C, Basic coding questions, Database, Data structures, Computer Networks, OS, Algorithms
College Name: NIT SURATHKAL

I was interviewed before Apr 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

The test has 3 sections :
1. Quantitative contains 20 questions. These questions are easy to me. If u practice quant, you can easily solve it.


2. Technical contains 20 questions. Some questions are on C , C++ , java outputs. Remaining are based on DSA. If u Know all the time complexities of algorithms then it is easy . In technical they gave one DSA problem.
 

3. Essay: They have given one picture and then asked to write an essay by seeing the picture.

  • Q1. 

    Dijkstra's Algorithm for Shortest Path

    Given an undirected graph with 'V' vertices labeled from 0 to V-1 and 'E' edges. Each edge has a weight that represents the distance between two nodes 'X' and 'Y'.

    ...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distances from a source node to all other vertices in a graph.

    • Dijkstra's algorithm is a greedy algorithm that finds the shortest path from a source node to all other nodes in a graph.

    • It uses a priority queue to select the node with the smallest distance and relaxes its neighbors.

    • The algorithm maintains a distance array to keep track of the shortest distances from t...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

3 persons are there in panel. They are asking questions on basic concepts in subjects and some advanced concepts.

  • Q1. What is a Daemon Process?
  • Ans. 

    A daemon process is a background process that runs continuously to perform system tasks.

    • Daemon processes do not have a controlling terminal.

    • They typically run in the background and perform tasks such as managing hardware devices, network services, or system maintenance.

    • Examples of daemon processes include cron, sshd, and apache.

    • Daemon processes are often started during system boot and run until the system is shut down.

  • Answered by AI
  • Q2. What are the advantages of system calls in operating systems?
  • Ans. 

    System calls provide a way for user-level processes to interact with the operating system kernel.

    • System calls allow user programs to request services from the operating system.

    • They provide a secure and controlled way for applications to access system resources.

    • System calls enable processes to perform tasks such as file operations, network communication, and process management.

    • Examples of system calls include open(), re

  • Answered by AI
  • Q3. Can you explain the select() system call?
  • Ans. 

    The select() system call is used in Unix-like operating systems to monitor multiple file descriptors for activity.

    • select() allows a program to wait for multiple I/O operations to complete on multiple file descriptors.

    • It takes three sets of file descriptors as arguments - readfds, writefds, and errorfds.

    • The function will block until an activity is detected on one of the file descriptors or until a timeout occurs.

    • select(...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPADE Shaw India interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Apr 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

  • Q1. 

    Binary Tree Mirror Conversion Problem

    Given a binary tree, your task is to convert it into its mirror tree.

    A binary tree is a data structure where each parent node has at most two children.

    The mirror ...

  • Ans. 

    Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.

    • Traverse the binary tree in postorder fashion and swap the left and right children of each non-leaf node.

    • Use recursion to solve the problem efficiently.

    • Remember to handle null child nodes represented by -1 in the input.

  • Answered by AI
  • Q2. 

    Maximum Sum Subarray Problem Statement

    Given an array of integers, find the maximum sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Output:
    137
    Exp...
  • Ans. 

    Find the maximum sum of any contiguous subarray within an array in O(N) time complexity.

    • Iterate through the array and keep track of the maximum sum of subarrays encountered so far

    • At each index, decide whether to include the current element in the subarray or start a new subarray

    • Update the maximum sum if a new maximum is found

    • Example: For array [34, -50, 42, 14, -5, 86], the maximum sum subarray is [42, 14, -5, 86] with

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Hard

Technical Interview round with questions on DSA.

  • Q1. 

    Find the Largest BST Subtree in a Given Binary Tree

    Your task is to determine the size of the largest subtree of a given binary tree which is also a Binary Search Tree (BST).

    BST Definition:

    • The left...
  • Ans. 

    Find the size of the largest subtree in a binary tree that is also a Binary Search Tree (BST).

    • Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.

    • Keep track of the size of the largest BST subtree encountered so far.

    • Use the properties of a BST to determine if a subtree is a valid BST.

    • Consider edge cases such as empty tree or single node tree.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1

  • Answered by AI
  • Q2. 

    Next Higher and Previous Lower Number with Same Number of Set Bits

    Given a positive integer n, the task is to find the next smallest integer and the previous largest integer that contain the exact same nu...

  • Ans. 

    Find next smallest and previous largest integers with same number of set bits as given integer.

    • Count the number of set bits in the given integer using bitwise operations.

    • For next smallest integer, find the next number with same number of set bits by iterating through numbers greater than the given integer.

    • For previous largest integer, find the previous number with same number of set bits by iterating through numbers sm

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPADE Shaw India interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

12 Questions

  • Q1. Find maximum length BST in a given binary tree?
  • Ans. 

    To find the maximum length BST in a given binary tree.

    • Traverse the tree in post-order fashion

    • For each node, check if it satisfies the BST property

    • If it does, calculate the size of the BST rooted at that node

    • Keep track of the maximum size seen so far

  • Answered by AI
  • Q2. Write an algorithm to find the absolute max subsequence of an array containing both positive and negative numbers in O(n) time ?
  • Ans. 

    Algorithm to find absolute max subsequence of an array with positive and negative numbers in O(n) time.

    • Initialize max_so_far and max_ending_here as 0

    • Loop through the array and for each element, add it to max_ending_here

    • If max_ending_here becomes negative, reset it to 0

    • If max_ending_here is greater than max_so_far, update max_so_far

    • Return max_so_far

  • Answered by AI
  • Q3. Given an array eliminate the duplicates and print it. Linear time complexity?
  • Ans. 

    Eliminate duplicates in an array of strings and print it in linear time complexity.

    • Use a hash set to keep track of unique elements

    • Iterate through the array and add non-duplicate elements to the hash set

    • Print the hash set elements to get the final array

  • Answered by AI
  • Q4. Balancing of Btrees / AVL trees?
  • Ans. 

    Balancing of Btrees / AVL trees is important for efficient search and insertion operations.

    • Btrees and AVL trees are self-balancing binary search trees.

    • Balancing ensures that the height of the tree is minimized, leading to faster search and insertion operations.

    • Btrees are used in databases while AVL trees are used in memory.

    • Balancing is achieved by performing rotations and node splitting.

    • AVL trees have a stricter balanc...

  • Answered by AI
  • Q5. Two cops and a robber are located on opposite corners of a cube and move along its edges. They all move at the same rate. Is it possible for the cops to catch the robber. [Each of the 3 people can see each...
  • Q6. In some tournament 139 teams have participated. Tournament is knock out. what is the number of matches to choose the champion to be held?
  • Ans. 

    139 teams in a knock-out tournament, find the number of matches to choose the champion.

    • In a knock-out tournament, each team plays only one match per round.

    • The number of matches required to choose the champion is one less than the number of teams.

    • Therefore, the number of matches required is 138.

  • Answered by AI
  • Q7. OS concepts – Threading, Deadlocks, Paging etc
  • Q8. Databases Questions – Transactions, ACID etc
  • Q9. Project details in your resume?
  • Ans. 

    My resume includes projects such as a web-based inventory management system and a mobile app for tracking fitness goals.

    • Developed a web-based inventory management system using PHP and MySQL

    • Created a mobile app for tracking fitness goals using React Native

    • Implemented RESTful APIs for communication between front-end and back-end

    • Utilized version control tools such as Git for collaborative development

    • Designed and implement...

  • Answered by AI
  • Q10. Given a 7mt long gold bar , need to cut and give to worker for 7 days (1 meter long) How many min cuts?
  • Q11. Write algo to mirror a given Binary Tree?
  • Ans. 

    Algorithm to mirror a given Binary Tree

    • Create a function to swap left and right child nodes of a given node

    • Recursively call the function on left and right child nodes

    • Base case: if node is null, return

    • Call the function on the root node of the binary tree

  • Answered by AI
  • Q12. Find the next largest int of a given int such that it has same number of 1′s in binary?
  • Ans. 

    Find the next largest int with same number of 1's in binary.

    • Count the number of 1's in the binary representation of the given int.

    • Increment the given int until a number with the same number of 1's is found.

    • Return the next largest int with same number of 1's.

  • Answered by AI

Interview Preparation Tips

Skills: C,C++ , JAVA , Finding output, Basic Concepts
College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

21 Questions

  • Q1. Hobbies and interests
  • Q2. Questions regarding java
  • Q3. OOP concepts in Java
  • Ans. 

    OOP concepts in Java

    • Encapsulation - hiding implementation details

    • Inheritance - creating new classes from existing ones

    • Polymorphism - ability of objects to take on multiple forms

    • Abstraction - focusing on essential features and ignoring the rest

    • Example: A Car class can inherit from a Vehicle class

    • Example: A Dog class can have a bark() method that overrides the Animal class's makeSound() method

    • Example: A Shape class can h...

  • Answered by AI
  • Q4. OOP Java Design problems
  • Ans. 

    Answering OOP Java design problems

    • Identify the problem domain and create a class hierarchy

    • Use encapsulation to hide implementation details

    • Apply inheritance to reuse code and create subtypes

    • Implement polymorphism to allow objects to take on multiple forms

    • Avoid tight coupling and favor composition over inheritance

    • Use design patterns to solve common problems

    • Consider SOLID principles for maintainable code

  • Answered by AI
  • Q5. C++ Virtual Functions
  • Q6. What is the difference between C and C++?
  • Ans. 

    C++ is an extension of C with object-oriented programming features.

    • C++ supports classes and objects while C does not.

    • C++ has better support for polymorphism and inheritance.

    • C++ has a standard template library (STL) which C does not have.

    • C++ allows function overloading while C does not.

    • C++ has exception handling while C does not.

  • Answered by AI
  • Q7. What is inheritance?
  • Ans. 

    Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.

    • Inheritance allows code reusability and saves time and effort in programming.

    • The existing class is called the superclass or parent class, and the new class is called the subclass or child class.

    • The subclass inherits all the properties and methods of the superclass and can also add its own...

  • Answered by AI
  • Q8. What is the difference between default and copy constructor?
  • Ans. 

    Default constructor is provided by the compiler if no constructor is defined. Copy constructor creates a new object by copying an existing object.

    • Default constructor initializes member variables to default values.

    • Copy constructor creates a new object with the same values as an existing object.

    • Default constructor is called automatically by the compiler if no constructor is defined.

    • Copy constructor is called when an obje...

  • Answered by AI
  • Q9. What are access specifiers?
  • Ans. 

    Access specifiers are keywords in object-oriented programming languages that determine the visibility and accessibility of class members.

    • Access specifiers are used to restrict access to class members.

    • There are three types of access specifiers: public, private, and protected.

    • Public members can be accessed from anywhere in the program.

    • Private members can only be accessed within the class.

    • Protected members can be accessed...

  • Answered by AI
  • Q10. What is library functions?
  • Ans. 

    Library functions are pre-written code that can be reused to perform common tasks.

    • Library functions save time and effort by providing pre-written code.

    • They are often included in programming languages or external libraries.

    • Examples include functions for string manipulation, mathematical calculations, and file input/output.

    • Library functions can be called from within a program to perform specific tasks.

    • They can also be cu

  • Answered by AI
  • Q11. What is the difference between DML and DLL?
  • Ans. 

    DML is Data Manipulation Language used to manipulate data in a database. DLL is Data Definition Language used to define database schema.

    • DML is used to insert, update, delete data in a database.

    • DLL is used to create, alter, drop database objects like tables, views, indexes.

    • DML statements include INSERT, UPDATE, DELETE.

    • DLL statements include CREATE, ALTER, DROP.

    • DML affects data in a database, DLL affects the structure of

  • Answered by AI
  • Q12. What is the difference between primary key and unique key?
  • Ans. 

    Primary key uniquely identifies a record in a table, while unique key ensures that all values in a column are distinct.

    • Primary key can't have null values, while unique key can have one null value.

    • A table can have only one primary key, but multiple unique keys.

    • Primary key is used as a foreign key in other tables, while unique key is not.

    • Example: Primary key - employee ID, Unique key - email address.

  • Answered by AI
  • Q13. What is a stack?
  • Ans. 

    A stack is a data structure that follows the Last-In-First-Out (LIFO) principle.

    • Elements are added to the top of the stack and removed from the top.

    • Common operations include push (add element) and pop (remove element).

    • Stacks can be implemented using arrays or linked lists.

    • Examples include the call stack in programming and the undo/redo feature in text editors.

  • Answered by AI
  • Q14. What is an Assembly?
  • Ans. 

    Assembly is a low-level programming language that is used to write programs that can directly interact with computer hardware.

    • Assembly language is specific to a particular computer architecture.

    • It is a low-level language that is difficult to read and write.

    • Assembly language programs are faster and more efficient than programs written in high-level languages.

    • Examples of assembly language include x86, ARM, and MIPS.

    • Assem...

  • Answered by AI
  • Q15. What are class access modifiers?
  • Ans. 

    Class access modifiers are keywords used to control the visibility and accessibility of class members.

    • There are four access modifiers in Java: public, private, protected, and default

    • Public members can be accessed from anywhere

    • Private members can only be accessed within the same class

    • Protected members can be accessed within the same class, subclasses, and same package

    • Default members can be accessed within the same packa

  • Answered by AI
  • Q16. What is serialization?
  • Ans. 

    Serialization is the process of converting an object into a format that can be stored or transmitted.

    • Serialization is used to save the state of an object and recreate it later.

    • It is commonly used in network communication to transmit data between different systems.

    • Examples of serialization formats include JSON, XML, and binary formats like Protocol Buffers.

    • Deserialization is the opposite process of converting serialized

  • Answered by AI
  • Q17. What is the purpose of Normalisation?
  • Ans. 

    Normalisation is the process of organizing data in a database to reduce redundancy and improve data integrity.

    • Normalisation helps to eliminate data redundancy and inconsistencies

    • It ensures that each piece of data is stored in only one place

    • It helps to improve data integrity and accuracy

    • It makes it easier to maintain and update the database

    • There are different levels of normalisation, each with its own set of rules and g

  • Answered by AI
  • Q18. What is the difference between Truncate and Delete?
  • Ans. 

    Truncate removes all data from a table while Delete removes specific data from a table.

    • Truncate is faster than Delete as it doesn't log individual row deletions.

    • Truncate resets the identity of the table while Delete doesn't.

    • Truncate can't be rolled back while Delete can be.

    • Truncate doesn't fire triggers while Delete does.

  • Answered by AI
  • Q19. What is the difference between DBMS and RDBMs?
  • Ans. 

    DBMS is a software system to manage databases while RDBMS is a type of DBMS that uses a relational model.

    • DBMS stands for Database Management System while RDBMS stands for Relational Database Management System.

    • DBMS can manage any type of database while RDBMS uses a relational model to manage data.

    • DBMS does not enforce any specific data model while RDBMS enforces a relational data model.

    • Examples of DBMS include MongoDB, ...

  • Answered by AI
  • Q20. What is Recursion Function?
  • Ans. 

    Recursion function is a function that calls itself until a base condition is met.

    • Recursion is a technique used to solve problems by breaking them down into smaller sub-problems.

    • It involves a function calling itself with a modified input until a base case is reached.

    • Recursion can be used to solve problems such as factorial, Fibonacci series, and binary search.

    • Recursion can be implemented using loops as well, but it may ...

  • Answered by AI
  • Q21. Interview with the Director

Interview Preparation Tips

Round: Test
Experience: Initially they took an online round but due to some network problem, they had to scrap it. Next morning, they came up with a paper based round. There were 2 sections. One was aptitude and one was coding, both being objective type. The aptitude section was as lengthy as difficult. No one could have solved all 30 questions in 30 minutes time. Infact, I was only able to attempt 10. Next 40 minutes or so was reserved for the coding test. The questions they asked covered almost all the topics they mentioned in their pre-placement presentation. But the maximum number of questions were related to getting output or finding errors in C, C++ and JAVA codes. The questions they asked from theoretical subjects were more or less the basics and easy. In those questions (which were quite a few in number), you will be given a huge chunk of code with some part missing and you have to identify which snippet among the options best fits in there. Sometimes its given what the code is supposed to do, but in some questions it was also your task to find out. So I think the differentiating factor is how well your actual coding skills are. And you need to know these 3 languages atleast – C, C++ and JAVA. Again, similar to aptitude section the coding section was also very lengthy with some programs extending upto 1 or more pages. I’d recommend to skip those programs initially and jump to other easy problems first. Then if you have time, you can come back and attempt them.In the end of the coding round, they had one special subjective test in which they asked you to write the full code in any language for the give problem statement. In my case, the problem was : “Given a tree, find the depth of the largest binary search tree it contains.” I know it sounds simple enough but only until you start coding it. And while writing codes of such problems, make sure to display your data-structures and algorithmic skills and not your knowledge of STL libraries. Even if you’re not able to solve the problem and you used some complicated data structures (by using, I mean you created them from scratch without any help from STL libraries) and some good algorithms, then they are likely to appreciate your coding skills if not your problem-solving skills. And just a hint although I think you already know this – BST are the favourites of all software companies . Overall, I sat for 2 companies including Amazon and both of them had a coding problem related to BST only.
Duration: 70 minutes
Total Questions: 2

Round: HR Interview
Experience: Anyways, then there were usual HR questions like your hobbies, interests, family background, history of my town, etc. He did ask me some technical questions also like on seeing the word ‘Hacking’ in my resume, we started discussing upon hacking, its types and laws related to it.

Round: Technical Interview
Experience: They started off with puzzles, which were quite easy and common ones. Then only after 2 puzzles they started asking me about my favourite subject and language. I told them OS, Networks and C++. But instead they asked me all about Java ! I kept telling them I hadn’t revised Java but that didn’t help. They’ll ask some question and I’ll write the code in C++ and they would ask me to convert it to Java. They’d also ask the equivalents of C++ OOP concepts in Java. Its not that I know nothing of Java, I have actually done a lot of coding in it, but that day and time, I was totally unprepared. So I kept guessing a lot based on my poor memory and later to my surprise, I found I got many of them right .They also asked some design questions in which they asked me to write the class and related functions (just the prototypes) for implementing a parking lot management system. Then there were questions on hacking and security. They also asked about the network problem they faced the previous day when the online round was going on, due to which they had to scrap it. They asked what could be the reason behind it and what could be the solution. Overall, again the majority of the questions were coding type with C++ concepts like virtual functions, JAVA OOP, and design problems. This round went on for 15-20 minutes past 1 hour or so.

Round: Behavioural Interview
Experience: Finally, after few hours I was called for my last interview round. It was more like a casual round in which the D.E.Shaw associate director was taking my interview. The first thing he said was “I just wanted to meet you once myself” and he asked a few HR questions again. He asked me if I had any higher studies plan, my strengths and 2 weaknesses, why their company, etc. It was a cool round with the atmosphere also easy and it went on for just 20 minutes or so.

Skill Tips: Criteria :Cs/IT/ECE And CGPA min of 7.0[CSE] .For ECE =7.5
D. E. Shaw generally prefers computer science branch students but they’re not as strict as Amazon or Google and for for CS students it was only 7.0 . Luckily, my CGPA was above the cutoff and I was allowed to sit for the process.
Skills: C++, Java, DBMS, OOP
College Name: BITS PILANI

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DBMS.

  • Q1. What is data integrity?
  • Ans. 

    Data integrity refers to the accuracy, consistency, and reliability of data throughout its lifecycle.

    • Data integrity ensures that data is accurate and consistent in storage and transmission.

    • It involves maintaining the quality and reliability of data over time.

    • Methods for ensuring data integrity include checksums, encryption, and error detection codes.

    • Examples of data integrity violations include data corruption, unautho

  • Answered by AI
  • Q2. What is a trigger in the context of a database management system?
  • Ans. 

    A trigger is a special type of stored procedure that automatically executes when certain events occur in a database.

    • Triggers are used to enforce business rules, maintain data integrity, and automate repetitive tasks.

    • They can be triggered by INSERT, UPDATE, or DELETE operations on a table.

    • Examples of triggers include auditing changes to a table, updating related tables when a record is modified, or enforcing referential

  • Answered by AI
  • Q3. What is the difference between clustered and non-clustered indexes in a database management system?
  • Ans. 

    Clustered indexes physically order the data in the table, while non-clustered indexes do not.

    • Clustered indexes determine the physical order of data in the table, while non-clustered indexes do not.

    • A table can have only one clustered index, but multiple non-clustered indexes.

    • Clustered indexes are faster for retrieval of data, especially range queries, compared to non-clustered indexes.

    • Non-clustered indexes are stored se...

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions on DBMS.

  • Q1. What is the difference between UNION and UNION ALL in SQL?
  • Ans. 

    UNION combines and removes duplicates, UNION ALL combines without removing duplicates.

    • UNION merges the result sets of two or more SELECT statements and removes duplicates.

    • UNION ALL merges the result sets of two or more SELECT statements without removing duplicates.

    • UNION is slower than UNION ALL as it involves removing duplicates.

    • Example: SELECT column1 FROM table1 UNION SELECT column1 FROM table2;

    • Example: SELECT column...

  • Answered by AI
  • Q2. What are the functions of a cursor in PL/SQL?
  • Ans. 

    A cursor in PL/SQL is used to retrieve and process multiple rows of data one at a time.

    • Allows iteration over a result set

    • Retrieves data row by row

    • Can be used to update or delete rows in a table

    • Must be declared, opened, fetched, and closed

  • Answered by AI
  • Q3. Write a SQL query to fetch the nth highest salary from a table.
  • Ans. 

    SQL query to fetch the nth highest salary from a table

    • Use the ORDER BY clause to sort salaries in descending order

    • Use the LIMIT clause to fetch the nth highest salary

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a managerial round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACerner Corporation interview preparation:Topics to prepare for the interview - SQL, Database Management Systems, OOPS, DSA, System DesignTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Since this was a SQL post, I would suggest you to get the basics intact and try practicing few queries.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Apr 2020. There were 5 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. I have got questions about vsam files and about SQL queries.
  • Q2. What is my previous work and project roles and responsibilities.?

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare with basics clear with your project,your work,and your roles and responsibilities and be good to make them understand what you willing to answer.

I applied via Naukri.com and was interviewed before May 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Questions were related to your technology on which you are good, it starts with basic that identifies you worked in your technology and good knowledge over workflow and your coding standard.

Interview Preparation Tips

Interview preparation tips for other job seekers - Working hard and prepare yourself to achieve your goal where you are satisfy with your job. There is no shortcut, you have to face the challenges. Be prepare yourself

I applied via Naukri.com and was interviewed in Aug 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. My first question is tell me about yourself then they ask what you do after graduation. Then ask some technical question like oops concept and collections and map and some question in sql and jdbc also.

Interview Preparation Tips

Interview preparation tips for other job seekers - It is a product base MNC and it is good for fresher.
Contribute & help others!
anonymous
You can choose to be anonymous

NoBrokerHOOD Interview FAQs

How many rounds are there in NoBrokerHOOD Software Developer interview?
NoBrokerHOOD interview process usually has 3 rounds. The most common rounds in the NoBrokerHOOD interview process are Resume Shortlist, Coding Test and One-on-one Round.

Recently Viewed

JOBS

Browse jobs

Discover jobs you love

COMPANY BENEFITS

KNR Constructions

20 benefits

COMPANY BENEFITS

IRB Infrastructure

60 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

INTERVIEWS

insightsoftware

No Interviews

INTERVIEWS

5paisa Capital Ltd.

No Interviews

INTERVIEWS

Grant Thornton

No Interviews

INTERVIEWS

Grant Thornton

No Interviews

INTERVIEWS

Decimal Point Analytics

No Interviews

Tell us how to improve this page.

NoBrokerHOOD Software Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

NoBrokerHOOD Software Developer Reviews and Ratings

based on 3 reviews

4.0/5

Rating in categories

3.7

Skill development

3.7

Work-life balance

3.7

Salary

3.7

Job security

3.7

Company culture

3.7

Promotions

3.7

Work satisfaction

Explore 3 Reviews and Ratings
Territory Sales Manager
311 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Key Account Manager
119 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Key Account Manager
69 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Territory Sales Manager
46 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Relationship Manager
40 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare NoBrokerHOOD with

ApnaComplex

2.5
Compare

myGate

3.2
Compare

ApartmentADDA

1.1
Compare

Apna Ghar

4.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview