Filter interviews by
Question on Dynamic programming
About the resume and design twitter as well
Top trending discussions
I applied via Approached by Company and was interviewed before Apr 2023. There were 3 interview rounds.
Questions regarding JS concepts. JS and React specific rounds, closures, Promises, etc
posted on 16 Nov 2021
I appeared for an interview in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Online test
Based on c++,c and java basics
MCQ questions based on C++, C, and Java basics.
Understand the differences between C++, C, and Java syntax and features.
Be familiar with basic concepts like data types, control structures, and functions.
Practice solving MCQs to improve your understanding of the languages.
Round duration - 150 Minutes
Round difficulty - Medium
Technical interview
The task is to determine the number of distinct elements in every sliding window of size 'K' across an array 'ARR' of size 'N'. A 'K' sized window is a contiguous sequ...
Calculate the count of distinct elements in each sliding window of size 'K' across an array 'ARR'.
Use a sliding window approach to iterate through the array and keep track of distinct elements using a hashmap or set.
Update the count of distinct elements in each window as it slides across the array.
Return the array detailing the count of distinct elements in each 'K' sized window for each test case.
You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.
The input consists of a single line contain...
Sort a Singly Linked List using Merge Sort algorithm.
Implement the Merge Sort algorithm for linked lists.
Divide the list into two halves, sort each half recursively, and then merge them.
Use a fast and slow pointer to find the middle of the list for splitting.
Handle the base cases of empty list or single node list.
Example: Input: 4 3 2 1 -1, Output: 1 2 3 4
Round duration - 20 minutes
Round difficulty - Hard
Hr interview
Tip 1 : Go through oosp concept properly
Tip 2 : Good knowledge on coding
Tip 3 : intermediate knowledge on database and data structures
Tip 1 : A project based on database
Tip 2 : Mention all the fields properly and have a prior knowledge on your project
posted on 15 Mar 2024
I applied via Job Fair and was interviewed before Mar 2023. There were 3 interview rounds.
2 data struture question advancevds i cpp
Implement a data structure for storing and manipulating an array of strings.
Use a dynamic array to store the strings.
Implement functions for adding, removing, and accessing strings in the array.
Consider memory management and resizing the array as needed.
posted on 25 Sep 2024
To check if a linked list is a palindrome, compare the first half of the list with the reversed second half.
Traverse the linked list to find the middle node
Reverse the second half of the linked list
Compare the first half with the reversed second half to check for palindrome
Binary search and design a data-structure to do insert, delete and get random in O(1)
posted on 20 Jul 2023
I applied via Campus Placement
Baics apptitude, easy only can clear
Basics of c language, alomost basics
posted on 16 Sep 2021
I appeared for an interview in Apr 2021.
Round duration - 45 minutes
Round difficulty - Medium
Timing was 12 PM. Interviewer was nice.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from end to start and append each character to a new string.
Alternatively, use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the length of the string and number of test cases.
Your task is to rearrange a given array ARR
such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
Iterate through the array and maintain two pointers - one for the next position to place a zero and one for the next non-zero element.
Swap the elements at these pointers until all zeros are moved to the left and non-zero elements are in their relative order.
Time complexi...
SQL query to find the second highest salary from a table
Use the MAX() function to find the highest salary
Use the NOT IN operator to exclude the highest salary from the results
Order the salaries in descending order and limit the result to 1
Tip 1 : Do some projects.
Tip 2 : Practice problem solving questions.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
I applied via Campus Placement and was interviewed in Jul 2024. There was 1 interview round.
based on 1 interview
Interview experience
Product Marketing Manager
10
salaries
| ₹22.4 L/yr - ₹32.5 L/yr |
Software Engineer
4
salaries
| ₹16 L/yr - ₹21 L/yr |
Project Manager
4
salaries
| ₹26.4 L/yr - ₹33.4 L/yr |
Technical Recruiter
4
salaries
| ₹6 L/yr - ₹21 L/yr |
UX Designer
4
salaries
| ₹13.1 L/yr - ₹17 L/yr |
Presto Infosolutions
Jasmin Infotech
Iron Systems
Paladion Networks