Upload Button Icon Add office photos

Filter interviews by

RUBRIK INDIA Full Stack Developer Interview Questions and Answers

Updated 20 Sep 2021

RUBRIK INDIA Full Stack Developer Interview Experiences

1 interview found

I applied via Naukri.com and was interviewed in Aug 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Javascript - Conceptual questions, What is hoisting (and when to use it), closure (when to use), Design patterns (monolithic vs microservices)

Interview Preparation Tips

Interview preparation tips for other job seekers - If you have 2+ year of experience in Javascript/SQL it's not tough to crack the 1st/2nd round of interview. Go through the basic concepts of language and be ready to answer like why, when , how to use any concept.

Interview questions from similar companies

I applied via Recruitment Consultant and was interviewed before Oct 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. C++ oops concepts
  • Q2. Early and late binding
  • Q3. Copy constructors

Interview Preparation Tips

Interview preparation tips for other job seekers - Job profile was software developer for c++

I applied via Recruitment Consulltant and was interviewed before Apr 2021. There were 2 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Apply for angular ui developer interview is very simple just recap your javascript basic to advanced and angular basic concepts deeply
  • Q2. Router components service angular performance optimization how to scale app, security
  • Ans. 

    Optimizing Angular app performance and security with router components and services

    • Use lazy loading to improve performance

    • Implement caching for frequently accessed data

    • Use Angular Universal for server-side rendering

    • Implement HTTPS and secure authentication for security

    • Use guards and interceptors to protect routes and prevent unauthorized access

  • Answered by AI
Round 2 - HR 

(1 Question)

  • Q1. Salary negotiation and work experience

Interview Preparation Tips

Interview preparation tips for other job seekers - Just politely and very confident while giving interview and interest

Skills evaluated in this interview

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

Interview Questionnaire 

1 Question

  • Q1. Easy interview, be strong with the basics and you'll be through

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basics very well

I applied via Naukri.com and was interviewed in Oct 2019. There were 5 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. I had been aksed tricky questions
  • Q2. I gave answers of all.

Interview Preparation Tips

Interview preparation tips for other job seekers - Mam it was quite good

Interview Questionnaire 

26 Questions

  • Q1. Define IP tables
  • Ans. 

    IP tables is a firewall configuration tool in Linux.

    • IP tables is used to filter network traffic based on a set of rules.

    • It can be used to block or allow traffic based on source/destination IP address, port number, protocol, etc.

    • IP tables is configured using the command line interface.

    • It is commonly used in Linux servers to secure the network.

    • Example: iptables -A INPUT -s 192.168.1.0/24 -j DROP

  • Answered by AI
  • Q2. Write a program to traverse a linked list
  • Ans. 

    Program to traverse a linked list

    • Start from the head node

    • Iterate through each node until the end is reached

    • Perform necessary operations on each node

  • Answered by AI
  • Q3. Write a program to reverse a linked list. → how will you do it if you are allowed to use extra space?
  • Ans. 

    Program to reverse a linked list using extra space.

    • Create a new empty linked list

    • Traverse the original linked list and push each node to the new linked list

    • Return the new linked list as the reversed linked list

  • Answered by AI
  • Q4. In a knockout football tournament, there are n teams. find total no. of matches to be played to choose the winner of the tournament
  • Ans. 

    Find the total number of matches to be played in a knockout football tournament with n teams.

    • The number of matches played in a knockout tournament is always one less than the number of teams.

    • Use the formula (n-1) to calculate the total number of matches.

    • For example, in a tournament with 8 teams, the total number of matches played would be 7.

  • Answered by AI
  • Q5. Given two nodes of a tree, find their closest ancestor
  • Ans. 

    Find closest ancestor of two nodes in a tree

    • Traverse the tree from root to both nodes and store the paths

    • Compare the paths to find the closest common ancestor

    • Use recursion to traverse the tree and find the ancestor

    • If one node is an ancestor of the other, return the ancestor node

  • Answered by AI
  • Q6. What is segmentation fault?
  • Ans. 

    Segmentation fault is a type of error that occurs when a program tries to access a memory location that it is not allowed to access.

    • Segmentation fault is also known as segfault.

    • It is a common error in C and C++ programming languages.

    • It occurs when a program tries to access a memory location that it is not allowed to access, such as an area of memory that has not been allocated to the program.

    • This can happen due to a va...

  • Answered by AI
  • Q7. If u have a million numbers, how will u find the maximum number from them if → the input is given on the fly i.e. the numbers are entered one by one. → numbers are given 1000 at a time
  • Ans. 

    To find the maximum number from a million numbers entered on the fly or 1000 at a time.

    • Create a variable to store the maximum number and initialize it to the first number entered

    • Compare each subsequent number entered with the current maximum and update the variable if necessary

    • If numbers are given 1000 at a time, store the maximum of each batch and compare them at the end to find the overall maximum

  • Answered by AI
  • Q8. For a kernel level process, should the variables be stored in a stack or a heap?
  • Ans. 

    Variables for kernel level process should be stored in stack.

    • Stack is faster than heap for accessing variables.

    • Stack is limited in size, so use it for small variables.

    • Heap is used for larger variables that need to persist beyond the function call.

    • Kernel level processes should avoid dynamic memory allocation.

  • Answered by AI
  • Q9. What is internal fragmentation?
  • Ans. 

    Internal fragmentation is the unused memory space within a partition or block.

    • Occurs when allocated memory is larger than required

    • Leads to inefficient use of memory

    • Can be reduced by using memory allocation techniques like paging or segmentation

  • Answered by AI
  • Q10. Can u compare 2 structure variables in c? why? why not? → what is cell padding? why cell padding?
  • Ans. 

    In C, structure variables cannot be directly compared using the comparison operators. Cell padding is used to align data in memory for efficiency.

    • Structure variables in C cannot be compared directly using comparison operators like == or !=. Instead, you need to compare each member of the structure individually.

    • Cell padding refers to the practice of adding empty bytes between structure members to align them in memory. T...

  • Answered by AI
  • Q11. Where are global (initialized + uninitialized) variables and local variables of a program stored?
  • Ans. 

    Global variables are stored in data segment while local variables are stored in stack memory.

    • Global variables are accessible throughout the program while local variables are only accessible within their scope.

    • Global variables are initialized to default values while local variables are not.

    • Global variables can be modified by any function while local variables can only be modified within their scope.

  • Answered by AI
  • Q12. How is the control of program passed from main() to any other function? where is the return address of main stored?
  • Ans. 

    Control is passed through function calls. Return address of main is stored in the stack.

    • Control is passed to a function when it is called from main()

    • The function executes and returns control to main() using the return statement

    • The return address of main() is stored in the stack

    • When the function returns, the return address is used to resume execution in main()

  • Answered by AI
  • Q13. How to calculate the square root of a number?? note: your compiler does not support math.h
  • Ans. 

    To calculate square root without math.h, use Newton's method.

    • Choose a number to find the square root of

    • Make an initial guess for the square root

    • Use Newton's method to refine the guess

    • Repeat until desired accuracy is achieved

    • Newton's method: new_guess = (guess + (number/guess))/2

  • Answered by AI
  • Q14. If you have 4 eggs and you are in a 30 floor building, find the lowest floor from which the eggs break when dropped. if on dropping, the egg does not break you can not pick it up again
  • Ans. 

    Find the lowest floor from which an egg breaks when dropped from a 30 floor building with 4 eggs.

    • Use binary search approach to minimize the number of drops

    • Start dropping the egg from the middle floor and check if it breaks

    • If it breaks, start dropping from the middle of the lower half, else start from the middle of the upper half

    • Repeat the process until the lowest floor is found

  • Answered by AI
  • Q15. If u hav a file system which is 95% full and now when new files are created, the os deletes the largest file, find the data structure to be used
  • Q16. If we use a heap in Q6, what will be the disadvantages of that approach
  • Ans. 

    Using a heap in Q6 can have certain disadvantages.

    • Heap operations are slower than array operations.

    • Heap requires extra memory allocation.

    • Heap may not be suitable for small datasets.

    • Heap may not be efficient for certain types of data structures.

    • Heap may lead to fragmentation of memory.

  • Answered by AI
  • Q17. In a unix or linux file system, how is a file path resolved? e.g given path of file: /root/home/mnit/abc.txt, how does an os finds where abc.txt is stored in memory??
  • Q18. Explain about your summer internship? what challenges did u face? → if you developed a software, what was the lifecycle model used?
  • Ans. 

    I interned at XYZ company and developed a software using Agile methodology. Faced challenges in meeting deadlines.

    • Interned at XYZ company and developed a software

    • Used Agile methodology for software development

    • Faced challenges in meeting deadlines

    • Collaborated with team members to overcome challenges

  • Answered by AI
  • Q19. Find an engineering solution to a given social problem
  • Ans. 

    Engineering solution to reduce plastic waste

    • Develop biodegradable plastics

    • Create recycling machines for households

    • Implement a deposit system for plastic bottles

    • Encourage the use of reusable bags and containers

    • Design products with minimal packaging

    • Develop a system to convert plastic waste into fuel

  • Answered by AI
  • Q20. We use cylindrical beaker in our daily life to measure different solutions. we have to bend in front of the beaker to see the level of the solution. find an efficient solution where we dont have to bend t...
  • Q21. What is your experience of the whole day?
  • Q22. What part did you like best in our ppt?
  • Ans. 

    I really enjoyed the section on your development process.

    • The detailed explanation of your agile methodology was impressive.

    • The emphasis on collaboration and communication stood out to me.

    • The use of real-life examples to illustrate your process was helpful.

    • I appreciated the focus on continuous improvement and learning.

    • Overall, it gave me a good understanding of how your team works and what to expect if I were to join.

  • Answered by AI
  • Q23. Are you clear about your role in netApp?
  • Ans. 

    Yes, my role as a software developer at NetApp is clear.

    • My role is to develop and maintain software applications for NetApp.

    • I work closely with other developers, project managers, and stakeholders to ensure that the software meets the needs of the business.

    • I am responsible for writing clean, efficient, and well-documented code.

    • I also participate in code reviews and contribute to the overall development process.

    • For exam...

  • Answered by AI
  • Q24. What subjects did u like the best in clg? why?
  • Ans. 

    I enjoyed computer science and mathematics the most in college.

    • Computer Science - I loved learning about algorithms, data structures, and programming languages.

    • Mathematics - I enjoyed solving complex problems and understanding mathematical concepts.

  • Answered by AI
  • Q25. Extra curricular activities in clg?
  • Ans. 

    Participated in various technical and cultural events, volunteered for social causes.

    • Participated in coding competitions like CodeChef, HackerRank, etc.

    • Organized technical events like hackathons, coding workshops, etc.

    • Volunteered for social causes like blood donation camps, cleanliness drives, etc.

    • Participated in cultural events like dance competitions, music concerts, etc.

  • Answered by AI
  • Q26. Any queries about our company or the compensation package etc

Interview Preparation Tips

Round: Test
Experience: First a written round was conducted. Written was based on Programming, Data structure, OS and Aptitude/Quant.

Skills: Algorithm, Data structure
College Name: MNIT Jaipur

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(5 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on DSA, Programming and OOPS.

  • Q1. 

    Implement strstr() Function in C Problem Statement

    Given two strings A and B, find the index of the first occurrence of A in B. If A is not present in B, return -1.

    Example:

    Input:
    A = "bc", B = "abcdd...
  • Ans. 

    Implement the strstr() function in C to find the index of the first occurrence of one string in another.

    • Iterate through the main string and check if the substring matches at each position.

    • Return the index if a match is found, else return -1.

    • Handle edge cases like empty strings or when the substring is longer than the main string.

  • Answered by AI
  • Q2. What happens when we try to access a null pointer in C?
  • Ans. 

    Accessing a null pointer in C results in a segmentation fault, as the program tries to access memory at address 0.

    • Attempting to dereference a null pointer will result in a segmentation fault, as the program tries to access memory at address 0.

    • It is important to always check if a pointer is null before attempting to access its value.

    • Example: int *ptr = NULL; printf('%d', *ptr); // This will result in a segmentation faul

  • Answered by AI
  • Q3. What are the phases of a compiler?
  • Ans. 

    Phases of a compiler include lexical analysis, syntax analysis, semantic analysis, optimization, and code generation.

    • Lexical analysis: Converts source code into tokens.

    • Syntax analysis: Checks the syntax of the code using a grammar.

    • Semantic analysis: Checks the meaning of the code.

    • Optimization: Improves the code for efficiency.

    • Code generation: Generates machine code or intermediate code.

  • Answered by AI
  • Q4. What is a system stack?
  • Ans. 

    A system stack is a data structure that stores information about the active subroutines of a computer program.

    • A system stack typically consists of a stack of frames, each representing a subroutine call.

    • The stack grows and shrinks as subroutines are called and returned.

    • The top of the stack points to the currently executing subroutine.

    • Common operations on a system stack include push (adding a new frame) and pop (removing

  • Answered by AI
  • Q5. 

    Count Set Bits Problem Statement

    Given an integer N, for each integer from 0 through N, find and print the number of set bits (1s) present in its binary representation.

    Example:

    Input:
    N = 5
    Output:
    ...
  • Ans. 

    Count the number of set bits in binary representation of integers from 0 to N.

    • Iterate through integers from 0 to N and count the number of set bits in their binary representation.

    • Use bitwise operations to check if a bit is set in the binary representation.

    • Return the count of set bits for each integer in the range.

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on DSA, Programming and OOPS.

  • Q1. 

    Inorder Traversal of a Binary Tree Without Recursion

    You are provided with a binary tree consisting of 'N' nodes, where each node contains an integer value. Your task is to perform the In-Order traversal ...

  • Ans. 

    Perform In-Order traversal on a binary tree without recursion.

    • Use a stack to simulate the recursive process of In-Order traversal.

    • Start with the root node and keep traversing left until reaching a null node, pushing nodes onto the stack.

    • Pop nodes from the stack, print the value, and move to the right child if it exists.

    • Repeat until the stack is empty and all nodes have been visited.

  • Answered by AI
  • Q2. 

    Detect Loop in Singly Linked List

    Determine if a given singly linked list of integers contains a cycle.

    Explanation:

    A cycle in a linked list occurs when a node's next points back to a previous node in ...

  • Ans. 

    Detect if a singly linked list has a cycle by using Floyd's Cycle Detection Algorithm.

    • Use Floyd's Cycle Detection Algorithm to detect a cycle in a singly linked list.

    • Maintain two pointers, one moving at twice the speed of the other.

    • If there is a cycle, the two pointers will eventually meet.

    • If one of the pointers reaches the end of the list (null), there is no cycle.

  • Answered by AI
  • Q3. What is an interrupt?
  • Ans. 

    An interrupt is a signal sent to the CPU to alert it of an event that needs immediate attention.

    • Interrupts can be generated by hardware devices or software programs.

    • They can be used to handle events such as keyboard input, mouse clicks, or network activity.

    • Interrupts can be classified as hardware interrupts, software interrupts, or exceptions.

    • Examples of interrupts include the timer interrupt, which is used for multita...

  • Answered by AI
  • Q4. What is the CSMA protocol?
  • Ans. 

    CSMA stands for Carrier Sense Multiple Access. It is a protocol used in network communication to avoid collisions.

    • CSMA allows devices to listen to the network before transmitting data to avoid collisions.

    • If a device senses that the network is busy, it waits for a random amount of time before attempting to transmit.

    • CSMA/CD (Collision Detection) is a variant of CSMA used in Ethernet networks.

    • CSMA/CA (Collision Avoidance)

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical Managerial round.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPANetApp India Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Networking, OS, DBMS, 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 interviewSelected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was the first technical round.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Keep track of the previous, current, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during reversal.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q3. What is internal fragmentation?
  • Ans. 

    Internal fragmentation occurs when allocated memory is larger than the requested memory, leading to wasted space.

    • Internal fragmentation is common in memory management systems.

    • It occurs when a block of memory is allocated to a process, but the process does not use all of the allocated memory.

    • This results in wasted space within the allocated block.

    • For example, if a process requests 100 bytes of memory but is allocated a ...

  • Answered by AI
  • Q4. Which part of memory stores uninitialized static and global variables?
  • Ans. 

    BSS segment in memory stores uninitialized static and global variables.

    • BSS segment stands for 'Block Started by Symbol' and is a section of memory where uninitialized static and global variables are stored.

    • Variables declared with the 'static' keyword or as global variables without initialization are stored in the BSS segment.

    • For example, int a; or static int b; would be stored in the BSS segment.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on DSA, OS, OOPS etc.

  • Q1. 

    Integer Square Root Calculation

    Given a positive integer 'N', compute its square root and return it. If 'N' is not a perfect square, then return the floor value of sqrt(N).

    Example:

    Input:
    N = 25
    N = 20
    N...
  • Ans. 

    Calculate the square root of a positive integer and return the floor value if not a perfect square.

    • Use the sqrt() function to calculate the square root of the given integer.

    • If the square root is not an integer, return the floor value using floor() function.

    • Handle constraints such as the range of 'N' and the number of test cases.

  • Answered by AI
  • Q2. Where does the returned value for the 'main' function go?
  • Ans. 

    The returned value for the 'main' function goes to the operating system.

    • The returned value is typically an integer representing the exit status of the program.

    • A return value of 0 usually indicates successful execution, while non-zero values indicate errors.

    • The operating system can use the return value to determine the success or failure of the program.

  • Answered by AI
  • Q3. What is a segmentation fault?
  • Ans. 

    A segmentation fault is a type of error that occurs when a program tries to access a memory location that it is not allowed to access.

    • Occurs when a program tries to access memory outside of its allocated space

    • Usually caused by bugs in the code such as accessing an uninitialized pointer or writing past the end of an array

    • Can lead to program crashes or unexpected behavior

    • Example: Accessing an element beyond the bounds of

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a typical managerial round.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPANetApp India Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OS, DBMS, Networking, 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 interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2016.

Interview Preparation Tips

Round: Group Discussion
Experience: Interview was scheduled in Grab Job consultancy. In that, a class room, where we all asked to sit and interviewer was sitting in front and asked to speak one by one on the topic traffic situation in Hyderabad.
Tips: Just speak once two to three lines. Don't rush to speak. Take ur time and don't try speak repeatedly.
Duration: 35 minutes

Round: Technical Interview
Experience: System based test. Easy question from java , c, data structure.

Round: HR Interview
Experience: Not held because already we got too late.

Skills: Proficiency In English, Basic Coding
College Name: Medak College of engineering

I was interviewed in Mar 2017.

Interview Questionnaire 

5 Questions

  • Q1. Oops concepts in Java?
  • Ans. 

    Oops concepts in Java

    • Encapsulation - hiding implementation details

    • Inheritance - reusing code and creating parent-child relationships

    • Polymorphism - multiple forms of a method or object

    • Abstraction - creating abstract classes and interfaces

    • Example: Encapsulation - using private variables and public methods

    • Example: Inheritance - creating a subclass that inherits from a superclass

    • Example: Polymorphism - using method overloa...

  • Answered by AI
  • Q2. Altering columns in Databases?
  • Ans. 

    Altering columns in databases involves modifying the structure of a table by adding, deleting or modifying columns.

    • Use ALTER TABLE statement to modify columns

    • Add new columns using ADD COLUMN

    • Delete columns using DROP COLUMN

    • Modify columns using MODIFY COLUMN

    • Changing column data type may result in data loss

  • Answered by AI
  • Q3. Asked some queries in SQL
  • Q4. Reversing a number in java?
  • Ans. 

    Reversing a number in Java

    • Convert the number to a string

    • Use StringBuilder to reverse the string

    • Convert the reversed string back to a number

  • Answered by AI
  • Q5. Extracting words from a line in java?
  • Ans. 

    To extract words from a line in Java, split the line using whitespace as delimiter.

    • Use the split() method of String class

    • Pass the whitespace regex as argument to split() method

    • Iterate over the resulting array to get individual words

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Started with the question "Tell me about yourself". Asked me about Core Java. Asked to solve some questions related to Java and SQL.
Tips: Be prepared with high knowledge in Java, Data Structures and SQL.

Skills: Java Programming, Data Strrutures, SQL
College Name: IIITDM Jabalpur

Skills evaluated in this interview

Tell us how to improve this page.

Customer Success Engineer
64 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
39 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Customer Success Engineer
37 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sde1
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Member Technical Staff
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare RUBRIK INDIA with

Druva

3.7
Compare

Veeam Software

4.0
Compare

CommVault

3.9
Compare

Cohesity

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