Filter interviews by
I applied via LinkedIn and was interviewed in Mar 2024. There were 3 interview rounds.
I applied via Recruitment Consulltant and was interviewed in Sep 2023. There were 3 interview rounds.
There will be 3 coding questions given to us for solving,we need solve two questions compulsory.
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
I applied via Campus Placement and was interviewed in Mar 2024. There was 1 interview round.
Questions were high level
I applied via Company Website and was interviewed in Aug 2021. There was 1 interview round.
Worst organization
Lack of communication and transparency
Inefficient management and decision-making
Toxic work culture and lack of employee support
Poorly defined goals and objectives
Lack of career growth opportunities
I applied via Campus Placement
Coding round and level was good, one araay question and two dp questions
posted on 24 Nov 2024
Move negative elements to right side of array
Iterate through the array and swap negative elements to the right side
Use two pointers approach to keep track of positive and negative elements
Maintain the order of elements while moving negatives to the right side
I applied via Recruitment Consultant and was interviewed in Apr 2021. There were 3 interview rounds.
Level order traversal of tree is a breadth-first search algorithm to visit all nodes in a tree level by level.
Use a queue to keep track of nodes to be visited
Enqueue the root node and loop until the queue is empty
Dequeue a node, visit it, and enqueue its children
Repeat until all nodes have been visited
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Easy
The test had it's webcam on, we were not allowed to go out of the frame.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
The program calculates the Nth Fibonacci number using a recursive formula.
The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.
The program uses a recursive function to calculate the Nth Fibonacci number.
The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.
You are provided with an unsorted array/list ARR
of N
integers. Your task is to determine the length of the longest consecutive sequence present in the array...
The task is to find the length of the longest consecutive sequence in an unsorted array of integers.
Sort the array to bring consecutive numbers together
Iterate through the sorted array and keep track of the current consecutive sequence length
Update the maximum length if a longer sequence is found
Round duration - 30 minutes
Round difficulty - Medium
The interview was online from home.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.
Iterate through the string from the last character to the first character and append each character to a new string.
Alternatively, you can use built-in string reversal functions or methods available in your programming language.
To solve the follow-up question with O(1) space complexity, you can use a tw...
Round duration - 20 minutes
Round difficulty - Easy
This was last round. In this round interviewer ask about me and what i know about company. Also he ask about my projects as well as my future goals .
The interviewer was very understanding and supportive.
Tip 1 : Find a good course, and first clear all your fundamentals and implementation of every data structure. You should be thorough with their time as well as space complexities.
Tip 2 : Upon clearing the fundamentals, select a platform where you have a large no of questions, also whose test cases are good. eg. LeetCode, InterviewBit or Codezen. Go and complete 300-400 questions.
Tip 3 : Also whenever you're not able to solve the problem, check out the editorial and then re-attempt it again. Also, check the discussion if there is some good solution to the same problem.
Tip 4 : For OOPS, DS and programming, I recommend Codezen, Leetcode, InterviewBit and GeeksforGeeks.
Tip 5 : For OS, DBMS and Computer Network, I recommend GateSmasher, Knowledge Gate and TutorialsPoint.
Tip 1 : Resume should contain facts, numbers, and data comparison.
Tip 2 : Mention only those projects and internships in your resume that you are comfortable with, that is, you can explain to the interviewee.
Tip 3 : Technical achievements in the field you're applying to, would be good.
Tip 4 : DO NOT FAKE THINGS, the interviewer is smart enough.
I applied via Naukri.com and was interviewed in Mar 2021. There were 3 interview rounds.
Developed a web application for managing customer orders and inventory
Used Java and Spring framework for backend development
Implemented a responsive user interface using HTML, CSS, and JavaScript
Integrated with a relational database for data storage and retrieval
Implemented authentication and authorization features for secure access
Performed unit testing and bug fixing throughout the development process
Some of the top questions asked at the Precisely Software Engineer interview -
based on 2 interviews
Interview experience
based on 8 reviews
Rating in categories
Software Engineer
49
salaries
| ₹8 L/yr - ₹22 L/yr |
Senior Software Engineer 2
46
salaries
| ₹17 L/yr - ₹38 L/yr |
Principal Software Engineer
38
salaries
| ₹24 L/yr - ₹59 L/yr |
Software Engineer Level 1
34
salaries
| ₹7 L/yr - ₹15 L/yr |
Software Engineer2
27
salaries
| ₹11.8 L/yr - ₹21.8 L/yr |
Fractal Analytics
Mu Sigma
Tiger Analytics
LatentView Analytics