Avalara Technologies
Cybernetics College Interview Questions and Answers
Q1. Write an API to implement HTTP GET method to hit an external datasource using pagination and filter the top rated movie in a certain Genre. There will be around 2000 entries of data objects related to movies an...
read moreImplement an API in Java to fetch top rated movies in a certain genre from an external datasource using pagination.
Create a REST API endpoint in Java using Spring Boot framework
Implement pagination by using query parameters for 'page' and 'size'
Filter the movies by genre and sort them by rating to fetch the top rated ones
Use a service layer to interact with the external datasource and fetch the data
Return the filtered and paginated movie data in the response
Q2. Minimum Number of Taps to Water the Garden
Given a garden that extends along a one-dimensional x-axis from point 0 to point N, your task is to determine the minimum number of taps needed to water the entire gar...read more
Find the minimum number of taps needed to water the entire garden using given tap ranges.
Iterate over each tap and find the maximum range it can cover.
Sort the taps based on their starting position and ending position.
Use a greedy approach to select the taps that cover the maximum range possible.
If any part of the garden remains uncovered, return -1.
Q3. DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GRAPH' m...read more
DFS traversal problem on an undirected and disconnected graph to find connected components.
Perform Depth First Search (DFS) on the graph to find connected components.
Use a visited array to keep track of visited vertices.
Iterate through all vertices and perform DFS on unvisited vertices to find connected components.
Print the number of connected components and list vertices in each component in ascending order.
Q4. Queue Using Stacks Implementation
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Explanation:
Your task is to complete predefined functions to suppor...read more
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue - one for enqueueing and one for dequeueing.
For enqueuing, simply push elements onto the stack.
For dequeuing, if the dequeue stack is empty, transfer all elements from enqueue stack to dequeue stack.
Peek operation can be done by checking the top element of the dequeue stack.
Check if the queue is empty by verifying if both stacks are empty.
Q5. Return Subsets Sum to K Problem Statement
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
Explanation:
A subset of an array 'ARR' is a tuple that c...read more
Return all subsets of an array that sum to a given integer K.
Use recursion to generate all possible subsets of the array.
Keep track of the current subset and its sum while traversing the array.
If the sum of the subset equals K, add it to the result.
Sort the elements in each subset to ensure increasing order of index.
Handle duplicate elements in the array appropriately.
Q6. Palindrome Partitioning Problem Statement
You are given a string S
. Your task is to partition S
such that every substring of the partition is a palindrome. Your objective is to return all possible palindrome pa...read more
Partition a string into palindromes and return all possible configurations.
Use backtracking to generate all possible palindrome partitions of the string.
Check if each substring is a palindrome before adding it to the partition.
Return all valid partitions as an array of strings.
Top HR Questions asked in Cybernetics College
Interview Process at Cybernetics College
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month