Filter interviews by
I applied via campus placement at Indian Institute of Technology (IIT), Kharagpur 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 applied via campus placement at J S S Academy of Technical Education, Bangalore and was interviewed in Dec 2024. There were 3 interview rounds.
Average to easy difficulty level.
I applied via Company Website and was interviewed in Nov 2024. There were 4 interview rounds.
It was a simple Aptitude test designed to test your english proficiency and your quantitative skills.
There were 2 coding questions. The level of questions were not very high. The languages available for the round were Python, Java, C++, C, C#.
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Oct 2024. There were 3 interview rounds.
It contain 40 question which is very easy
It contain 3 coding question
I was interviewed in Dec 2024.
Reasoning, English, Numerical Ability
Pseudocode, Basic Data structure and algorithm questions
There were two coding questions
There was oncampus coding round , where 1 question was given.
Mercel platform 1 hour
Developed a web-based project management tool for tracking tasks and deadlines.
Used HTML, CSS, and JavaScript for front-end development
Implemented backend functionality using Node.js and MongoDB
Incorporated user authentication and authorization features
Utilized RESTful APIs for communication between front-end and back-end
I would write a code snippet based on the specific cluster or category provided.
Identify the specific cluster or category provided in the question
Write a code snippet that aligns with the requirements of the cluster
Ensure the code is accurate and relevant to the given cluster
posted on 2 Sep 2024
Array, Collections, String
posted on 3 Sep 2024
PUT is used to update or replace an existing resource, while POST is used to create a new resource.
PUT is idempotent, meaning multiple identical requests will have the same effect as a single request.
POST is not idempotent, meaning multiple identical requests may have different effects.
PUT requests are typically used for updating existing data, like updating a user's profile information.
POST requests are typically used...
posted on 24 Oct 2024
Numerical based questions are there mostly
Good basic level coding questions
I have worked on various projects including a web application for online shopping and a mobile app for task management.
Developed a web application using HTML, CSS, and JavaScript for online shopping
Created a mobile app using React Native for task management
Implemented RESTful APIs for communication between front-end and back-end systems