Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Implementation Based Question (Anagrams) on Code Signal .
The most difficult subject I faced was advanced calculus.
I struggled with understanding complex mathematical concepts and applying them to real-world problems.
I prepared for it by seeking help from professors, attending extra tutoring sessions, and practicing with challenging problems.
I also utilized online resources and study groups to enhance my understanding and improve my problem-solving skills.
I want to join Cohesity because of their innovative technology and strong company culture.
Innovative technology - Cohesity is known for their cutting-edge solutions in data management and storage.
Strong company culture - I have heard great things about Cohesity's inclusive and collaborative work environment.
Career growth opportunities - I believe that joining Cohesity will provide me with valuable learning experiences
The most complex project I worked on was developing a machine learning algorithm for predicting customer churn in a telecom company.
The project involved analyzing large volumes of customer data to identify patterns and factors leading to churn.
Implementing various machine learning models such as logistic regression, random forests, and neural networks to predict churn accurately.
Dealing with imbalanced data and optimiz...
Reliability in networks is ensured through redundancy, fault tolerance, monitoring, and regular maintenance.
Redundancy: Having backup components or paths to prevent single points of failure.
Fault tolerance: Systems are designed to continue functioning even if a component fails.
Monitoring: Constantly checking network performance and addressing issues proactively.
Regular maintenance: Updating software, replacing hardware...
Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.
Virtual memory allows programs to use more memory than is physically available on the computer.
It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.
Virtual memory uses a combination of RAM and di...
I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.
A DSA question was given and I was asked to solve
Top trending discussions
I was interviewed before Jan 2016.
posted on 10 Mar 2015
Algorithm to find 2 numbers in an array whose sum is equal to a target integer
Use a hash table to store the difference between target and each element in the array
Iterate through the array and check if the current element exists in the hash table
Return the pair of elements that sum up to the target integer
Write a select statement to retrieve work of all users who belong to my team.
Join USERS and WORK tables on user_id
Join MANAGERS and USERS tables on team
Filter by manager_id
The manifest.json file contains the most important information of a Chrome extension.
The manifest.json file includes the version number, permissions, content scripts, background scripts, and other important details.
It is located in the root directory of the extension.
It is required for all Chrome extensions.
Example: "manifest_version": 2, "version": "1.0", "permissions": ["tabs", "storage"]
Hashtable is faster for finding an item than a sorted list.
Hashtable has constant time complexity O(1) for finding an item.
Sorted list has logarithmic time complexity O(log n) for finding an item.
Hashtable uses hashing to directly access the item's location.
Sorted list requires binary search to find the item's location.
Hashtable is ideal for large datasets with frequent lookups.
Sorted list is ideal for datasets that re
JSON and XML are the most popular data interchange formats when using APIs.
JSON (JavaScript Object Notation) is a lightweight format that is easy to read and write. It is widely used in web APIs.
XML (Extensible Markup Language) is a more complex format that is also widely used in web APIs.
Other formats include CSV (Comma Separated Values), YAML (YAML Ain't Markup Language), and Protocol Buffers.
Popular APIs for Social Commerce services
Facebook Graph API for social media integration
Instagram API for photo sharing and tagging
Twitter API for real-time updates and customer engagement
Pinterest API for product discovery and sharing
Google Maps API for location-based services
PayPal API for secure payment processing
Use a script to iterate through each HTML page, locate phone numbers, and update their format.
Write a script using a programming language like Python or JavaScript to iterate through each HTML page
Use regular expressions to locate phone numbers in the pages
Update the format of the phone numbers as needed (e.g. adding country code, changing separators)
Save the updated HTML pages with the new phone number format
Designing Google Suggest system
I would start by analyzing user search patterns and frequently searched keywords
Then, I would create a database of these keywords and their associated search results
I would use indexing services to quickly retrieve relevant results for each keyword
I would also implement machine learning algorithms to improve the accuracy of suggestions over time
Check if a number is a power of 2 and odd.
To check if a number is a power of 2, use bitwise AND operator with the number and its predecessor. If the result is 0, it is a power of 2.
To check if a number is odd, use modulus operator with 2. If the result is 1, it is odd.
Example code in Python:
def is_power_of_two(num):
return num & (num - 1) == 0
def is_odd(num):
return num % 2 == 1
By introducing new menu items, optimizing pricing strategy, and improving the overall dining experience.
Conduct a survey to understand the preferences of employees
Introduce healthy and affordable meal options
Offer discounts for bulk orders or loyalty programs
Partner with local vendors to source fresh ingredients
Improve the ambiance and seating arrangements
Implement online ordering and delivery services
Reviewing 30 million ads from 42 languages in Google AdWords and rejecting non-compliant ads requires a systematic approach.
Create a set of specific rules and guidelines for ad compliance
Use automated tools to filter out ads that violate the rules
Assign a team of reviewers to manually check the remaining ads
Ensure that the reviewers are fluent in the languages of the ads they are reviewing
Regularly update the rules and...
Multiple data structures are used to print nodes in a specific order. One data structure cannot be used alone.
The given order suggests a depth-first search traversal of a tree-like structure.
A stack can be used to keep track of the nodes to be visited.
A queue can be used to store the children of a node in the order they are visited.
An array can be used to store the nodes in the required order.
A linked list can be used ...
Find largest pen using minimum comparisons with tops.
Divide pens into two groups and compare largest pen from each group with largest top.
Repeat the process with the group containing the largest pen until only one pen is left.
The remaining pen is the largest pen.
Total number of comparisons required is 2n-3.
Given n dice with 'a' sides and sum b, return no. of ways to obtain b. Optimize time and space complexity.
Use dynamic programming to reduce time complexity
Create a 2D array to store the number of ways to obtain each sum for each number of dice
Use rolling arrays to optimize space complexity
Example: n=2, a=6, b=7 -> 6 ways to obtain sum 7
Example: n=3, a=4, b=8 -> 21 ways to obtain sum 8
Sort 128 GB data on 2 machines with 64 GB RAM each. Extend to 1000 machines.
Use external sorting algorithm like merge sort or quick sort
Divide data into smaller chunks and sort them individually
Merge sorted chunks using additional RAM
For 1000 machines, use distributed sorting algorithms like MapReduce or Hadoop
Ensure data consistency and fault tolerance in distributed sorting
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was the first technical round.
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
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.
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...
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.
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 ...
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.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions on DSA, OS, OOPS etc.
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).
N = 25
N = 20
N...
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.
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.
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
Round duration - 30 minutes
Round difficulty - Easy
This was a typical managerial round.
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
Technical Interview round with questions on DSA, Programming and OOPS.
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.
A = "bc", B = "abcdd...
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.
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
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.
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
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.
N = 5
...
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.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions on DSA, Programming and OOPS.
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 ...
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.
Determine if a given singly linked list of integers contains a cycle.
A cycle in a linked list occurs when a node's next points back to a previous node in ...
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.
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...
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)
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
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.
Connection-oriented protocols establish a dedicated end-to-end connection before data transmission, while connectionless protocols do not.
Connection-oriented protocols ensure reliable data transmission, while connectionless protocols do not guarantee reliability.
Connection-oriented protocols are used in applications such as file transfer and email, while connectionless protocols are used in applications such as video s...
My experience of the whole day was productive and challenging.
Started the day with a team meeting to discuss project progress
Worked on coding and debugging for several hours
Collaborated with colleagues to solve complex problems
Attended a training session on new software development tools
Finished the day by reviewing and documenting my work
I am a software developer at NetApp.
Design and develop software applications
Collaborate with cross-functional teams
Write clean and efficient code
Participate in code reviews and testing
Stay up-to-date with emerging trends and technologies
A QA (Quality Assurance) is responsible for ensuring that software products meet the required quality standards.
Develop and execute test plans and test cases
Identify and report defects and issues
Collaborate with developers to resolve issues
Ensure compliance with industry standards and regulations
Continuously improve testing processes and methodologies
based on 2 interviews
Interview experience
Software Engineer
432
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
289
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
272
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Support Engineer
139
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
132
salaries
| ₹0 L/yr - ₹0 L/yr |
RUBRIK INDIA
Druva
Veeam Software
CommVault