Filter interviews by
BST stands for Binary Search Tree.
BST is a type of binary tree where each node has at most two children.
In a BST, the left child of a node is always smaller than the node, and the right child is always greater.
BSTs are commonly used for efficient searching, insertion, and deletion operations.
Example: [5, 3, 7, 2, 4, 6, 8] is a BST.
Given a directed dependency graph, find sequence to install packages if each node has a structure of package name and dependency list.
Use topological sorting algorithm to find the installation sequence
Start with nodes that have no dependencies and gradually remove dependencies as packages are installed
If there is a cycle in the graph, it is not possible to find a valid installation sequence
The task is to count the occurrences of words from a dictionary in a big string efficiently.
Create a hash map to store the count of each word from the dictionary.
Split the big string into words and iterate through each word.
Check if the word exists in the dictionary and update its count in the hash map.
Return the hash map with word counts.
Find peak in increasing and decreasing sequence
Use binary search to find the peak element
Compare the middle element with its neighbors to determine if it's a peak
If the middle element is smaller than its left neighbor, search in the left half of the array
If the middle element is smaller than its right neighbor, search in the right half of the array
Construct a Binary Search Tree (BST) using preorder traversal.
Preorder traversal visits the root node first, then the left subtree, and finally the right subtree.
To construct a BST from preorder traversal, we can use a recursive approach.
The first element in the preorder traversal is the root of the BST.
All elements smaller than the root will be in the left subtree, and all elements greater than the root will be i...
Concatenation of two strings in C
Use the strcat() function to concatenate two strings in C
Make sure the destination string has enough space to hold the concatenated result
The destination string should be null-terminated before concatenation
Inorder traversal is a depth-first traversal algorithm that visits the left subtree, then the root, and finally the right subtree.
Start at the root node
Traverse the left subtree recursively
Visit the root node
Traverse the right subtree recursively
I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
Concatenation of two strings in C
Use the strcat() function to concatenate two strings in C
Make sure the destination string has enough space to hold the concatenated result
The destination string should be null-terminated before concatenation
BST stands for Binary Search Tree.
BST is a type of binary tree where each node has at most two children.
In a BST, the left child of a node is always smaller than the node, and the right child is always greater.
BSTs are commonly used for efficient searching, insertion, and deletion operations.
Example: [5, 3, 7, 2, 4, 6, 8] is a BST.
Find peak in increasing and decreasing sequence
Use binary search to find the peak element
Compare the middle element with its neighbors to determine if it's a peak
If the middle element is smaller than its left neighbor, search in the left half of the array
If the middle element is smaller than its right neighbor, search in the right half of the array
The task is to count the occurrences of words from a dictionary in a big string efficiently.
Create a hash map to store the count of each word from the dictionary.
Split the big string into words and iterate through each word.
Check if the word exists in the dictionary and update its count in the hash map.
Return the hash map with word counts.
Inorder traversal is a depth-first traversal algorithm that visits the left subtree, then the root, and finally the right subtree.
Start at the root node
Traverse the left subtree recursively
Visit the root node
Traverse the right subtree recursively
Construct a Binary Search Tree (BST) using preorder traversal.
Preorder traversal visits the root node first, then the left subtree, and finally the right subtree.
To construct a BST from preorder traversal, we can use a recursive approach.
The first element in the preorder traversal is the root of the BST.
All elements smaller than the root will be in the left subtree, and all elements greater than the root will be in the...
Given a directed dependency graph, find sequence to install packages if each node has a structure of package name and dependency list.
Use topological sorting algorithm to find the installation sequence
Start with nodes that have no dependencies and gradually remove dependencies as packages are installed
If there is a cycle in the graph, it is not possible to find a valid installation sequence
I am a recent graduate with a degree in Computer Science and a passion for software development.
Recent graduate with a degree in Computer Science
Passionate about software development
Experience with programming languages like Java and Python
My strengths include problem-solving, teamwork, adaptability, communication, and attention to detail. My weaknesses include public speaking, time management, and delegation.
Strengths: problem-solving - I enjoy analyzing and finding solutions to complex problems
Strengths: teamwork - I work well with others and value collaboration
Strengths: adaptability - I am able to quickly adjust to new situations and challenges
Streng...
TiVo offers innovative technology and a user-friendly interface for entertainment enthusiasts.
TiVo provides a unique and customizable viewing experience with features like recording, pausing, and rewinding live TV.
The platform offers access to a wide range of streaming services and apps, making it a one-stop entertainment hub.
TiVo's intuitive interface and recommendation system help users discover new content based on ...
Yes, I have led a team in my previous role as a project manager.
Led a team of 5 developers in a software development project
Assigned tasks, set deadlines, and conducted regular team meetings
Resolved conflicts and ensured project milestones were met
Received positive feedback from team members for leadership skills
I am currently focused on gaining practical experience in the industry, but may consider higher studies in the future.
Currently focused on gaining practical experience in the industry
Open to considering higher studies in the future for further specialization
Will assess the benefits of higher studies based on career goals and industry trends
Top trending discussions
I applied via Campus Placement and was interviewed before Aug 2020. There were 4 interview rounds.
Collections are data structures that store and manipulate groups of objects.
Collections provide a way to organize and manage large amounts of data
They can be used to perform operations on groups of objects, such as sorting or searching
Examples of collections include arrays, lists, sets, and maps
Java 8 introduces lambda expressions, functional interfaces, streams, and default methods.
Lambda expressions allow functional programming in Java
Functional interfaces enable the use of lambda expressions
Streams provide a concise way to perform operations on collections
Default methods allow interfaces to have implementation
Date and Time API improvements
Nashorn JavaScript engine
Spring Boot is a framework for building standalone, production-grade Spring-based applications.
Spring Boot simplifies the process of creating and deploying Spring-based applications.
It provides a pre-configured environment with a set of opinionated defaults.
It includes embedded servers like Tomcat, Jetty, and Undertow.
It supports a wide range of data sources and data access technologies.
It enables easy integration with...
JPA stands for Java Persistence API, a specification for object-relational mapping in Java applications.
JPA is used to map Java objects to relational database tables.
It provides a set of annotations to define the mapping between Java classes and database tables.
JPA also supports querying data using the Java Persistence Query Language (JPQL).
I applied via Company Website and was interviewed before Jan 2021. There was 1 interview round.
I applied via Company Website and was interviewed before Oct 2021. There were 5 interview rounds.
Basic Aptitude with some difficult questions
3 set of coding question were asked 1 easy ,1 medium ,1 hard
I applied via Company Website and was interviewed before Mar 2021. There were 3 interview rounds.
The Questions in the aptitude test were Average but you need to be pretty quick to solve them sp yes speed matters in aptitude test
After aptitude there was a coding test which was not necessary to clear for ASE profile but if you clear it then you will be considered for SE profile. its better to give your all out in the coding test to gain a better career level at accenture
I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed in Jan 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Jul 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2021. There were 2 interview rounds.
Some of the top questions asked at the Rovi Associate Software Engineer interview -
Accenture
Wipro
Cognizant
Capgemini