i
Seclore
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Aug 2023. There were 2 interview rounds.
Prepare well on HCF, LCM, there were questions on time management, ratio and mixtures
Prepare C++ and Java and Python. I was asked questions on Python
Top trending discussions
First round is coding round
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
Coding test of easy level questions. 3-4 questions was there.
I applied via Company Website and was interviewed before Jul 2023. There was 1 interview round.
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Given two sorted integer arrays ARR1
and ARR2
of size M and N, respectively, merge them into ARR1
as one sorted array. Assume that ARR1
has a size of M + N to hol...
Merge two sorted arrays into one sorted array in place.
Iterate from the end of both arrays and compare elements to merge in place
Use two pointers to keep track of the current position in each array
Update the elements in ARR1 from the end to the beginning
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
The task is to determine if a given string consisting of parentheses is balanced or not.
Iterate through each character in the string and use a stack to keep track of opening parentheses
If an opening parenthesis is encountered, push it onto the stack
If a closing parenthesis is encountered, check if it matches the top of the stack. If it does, pop the stack, else return 'Not Balanced'
At the end, if the stack is empty, re
Given a 32-bit signed integer N
, your task is to return the reversed integer. If reversing the integer causes overflow, return -1
.
The first line contains an int...
Reverse a 32-bit signed integer and handle overflow cases.
Implement a function to reverse the given integer.
Check for overflow conditions and return -1 if overflow occurs.
Use 32-bit capacity data types only.
Example: For input 123, output should be 321.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 45 minutes
Round difficulty - Easy
You are provided with a binary tree consisting of 'N' nodes. Your goal is to identify the deepest leaf node that is a left child of some node within the given bina...
Identify the deepest left leaf node in a binary tree.
Traverse the binary tree in level order to find the deepest left leaf node.
Keep track of the maximum depth and the value of the deepest left leaf node found so far.
Return the value of the deepest left leaf node at the end.
You are given an integer array ARR
. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...
Find the length of the shortest subarray that needs to be sorted to make the entire array sorted in ascending order.
Iterate from left to right to find the first element out of order.
Iterate from right to left to find the last element out of order.
Calculate the length of the subarray between the out of order elements.
Round duration - 45 minutes
Round difficulty - Easy
You are provided with a Binary Tree and one of its leaf nodes. Your task is to invert this binary tree, making sure to adhere to the following guidelines:
Invert a binary tree with a given leaf node as the new root, following specific guidelines.
Start by identifying the leaf node provided in the input.
Follow the guidelines to invert the binary tree with the leaf node as the new root.
Ensure that the left child becomes the right child of the new root if available, and the parent becomes the left child.
Implement the inversion process for each test case and output the result
Round duration - 30 minutes
Round difficulty - Easy
This Round the HR checks whether you will be good fit for culture code that's followed by the company.
Tip 1 : Make sure that you have good understand of data structures, Algorithm and OOPS
Tip 2 : Practice as many problems as you can in any platform that you are comfortable on.
Tip 3 : Have a decent knowledge on SQL, DBMS, OS, computer networks
Tip 1 : Keep your resume short preferably 1 page and make sure its communicating all points
Tip 2 : Add only those thing that you are confident on.
I was interviewed before Mar 2024.
Hackerrank test - leetcode type questions - easy to medium
Assignment - to submit in Github
I am a recent graduate with a degree in Business Administration, passionate about marketing and eager to learn and grow in a dynamic work environment.
Recent graduate with a degree in Business Administration
Passionate about marketing
Eager to learn and grow in a dynamic work environment
I applied via Campus Placement and was interviewed in Aug 2023. There were 2 interview rounds.
10 Genral Apti , 10 code apti duration 1 hr
3 hrs, 2 Stages 1st stage 3 Question, 2nd stage have 3 Question
I applied via Referral and was interviewed before Jan 2023. There were 4 interview rounds.
Topics varying from Maths,Logical Reasoning and Coding MCQs
30-40mints GD on random topic
I applied via Campus Placement and was interviewed in Jan 2023. There were 5 interview rounds.
Technical MCQ questions given which are pseudo code and grammar, aptitude test
Given two coding questions to execute within amount of time
based on 1 interview
Interview experience
Product Engineer
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Engineer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Quality Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Application Support Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Druva
Freshworks
Zoho
Tally Solutions