Filter interviews by
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
I was interviewed before Feb 2022.
Top trending discussions
posted on 19 Dec 2024
I was interviewed in Nov 2024.
I have worked on various projects ranging from web development to mobile app development, gaining experience in different technologies and frameworks.
Developed a web application using React.js and Node.js for a client in the e-commerce industry
Created a mobile app using Flutter for a startup in the travel sector
Collaborated with a team to implement a machine learning algorithm for data analysis in a research project
Led a team of developers on a project to develop a new software application.
Managed a team of 5 developers to ensure project deadlines were met
Assigned tasks to team members based on their strengths and expertise
Held regular team meetings to discuss progress and address any issues
Provided guidance and support to team members when needed
Collaborated with other departments to gather requirements and feedback
Code test to create a small search engine
Create a function that takes a search query and an array of strings as input
Iterate through the array of strings to find matches with the search query
Return an array of strings that contain the search query
It was combination of mcqs and 2 coding questions
Object-oriented programming concepts that focus on objects and classes for better code organization and reusability.
Encapsulation: Bundling data and methods that operate on the data into a single unit (class).
Inheritance: Ability of a class to inherit properties and behavior from another class.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hiding the complex implementation det...
Java is a programming language while Putjon is not a recognized term in software development.
Java is a widely used programming language for developing applications.
Putjon is not a recognized term in software development, it may be a typo or a specific term not commonly used.
There is no direct comparison between Java and Putjon as they are not related.
posted on 7 Sep 2024
I was interviewed in Aug 2024.
Medium level leetcode question
Developed a web application for managing inventory and sales for a retail store.
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database management
Incorporated authentication and authorization features for secure access
Functionalities in software development refer to the specific tasks or actions that a software program can perform.
Functionalities are the specific features or capabilities of a software program.
They define what the software can do and how it can be used.
Examples of functionalities include user authentication, data encryption, and file management.
Functionalities can be implemented through code modules or libraries.
Test...
I was interviewed in Aug 2024.
Hackertank Test containing dsa question
Success for me is achieving personal and professional goals while maintaining a healthy work-life balance.
Achieving personal goals such as learning new technologies or completing a project
Receiving positive feedback from colleagues or clients
Maintaining a healthy work-life balance by setting boundaries and taking time for self-care
Feeling fulfilled and satisfied with my work
Seeking new challenges and opportunities for growth in a different environment.
Looking for a new challenge to expand my skills and knowledge
Interested in exploring different technologies and industries
Seeking better career advancement opportunities
Wanting to work in a more collaborative team environment
Coding test was medium to hard leetcode problems.
I applied via Referral and was interviewed in Apr 2022. There was 1 interview round.
I was interviewed before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
The second round is also written but you need to write programming based on their concept.
The naïve approach for this question is to run a loop from the start to the end number. And for each number, check if it is prime or not. If the number is prime, we print it otherwise skip it.
One optimization to this approach would be to skip all even numbers (except 2 if present in interval) since even numbers are not prime.
Function to check if a number is prime or not :
isPrime(n):
if (n <= 1) return false
for (i=2;
The idea is to create a copy of num and recursively pass the copy by reference, and pass num by value. In the recursive calls, divide num by 10 while moving down the recursion tree. While moving up the recursion tree, divide the copy by 10. When they meet in a function for which all child calls are over, the last digit of num will be ith digit from the beginning and the last digit of copy will be ith digit from the end
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions mainly on Java and OOPS concepts.
Difference between Static methods and Instance methods
Instance method can access the instance methods and instance variables directly.
Instance method can access static variables and static methods directly.
Static methods can access the static variables and static methods directly.
Static methods can’t access instance methods and instance variables directly. They must use reference to object. And static method can’t use this keyword as there is no instance for ‘this’ to ref
Difference between Abstract Class and Interface
1) Abstract class can have abstract and non-abstract methods. Interface can have only abstract methods. Since Java 8, it can have default and static methods also.
2) Abstract class doesn't support multiple inheritance. Interface supports multiple inheritance.
3) Abstract class can have final, non-final, static and non-static variables. Interface has only static and final variables.
4) Abstract class can provide the implem...
ClassNotFoundException Vs NoClassDefFoundError in Java
1. As the name suggests, ClassNotFoundException is an exception while NoClassDefFoundError is an error.
2. ClassNotFoundException occurs when classpath does not get updated with required JAR files while error occurs when the required class definition is not present at runtime.
Difference between Error and Exception
1 Type :
Error : Classified as an unchecked type
Exception : Classified as checked and unchecked
2 Package :
Error : It belongs to java.lang.error
Exception : It belongs to java.lang.Exception
3 Recoverable/ Irrecoverable :
Error : It is irrecoverable
Exception : It is recoverable
4 Error : It can't be occur at compile time
Exception : It can occur at run time compile time both
5 Ex...
What is SerialVersionUID?
The serialization at runtime associates with each serializable class a version number called a serialVersionUID, which is used during deserialization to verify that the sender and receiver of a serialized object have loaded classes for that object that are compatible with respect to serialization.
What are the requirement for creating a Immutable Class in Java?
Following are the requirements:
The class must be declared as final so that child classes can’t be created.
Data members in the class must be declared private so that direct access is not allowed.
Data members in the class must be declared as final so that we can’t change the value of it after object creation.
A parameterized constructor should initialize all the fields performing a deep copy so that data members can...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed in Apr 2021.
Round duration - 120 Minutes
Round difficulty - Medium
I was MCQ + Coding round, Their were MCQ Based on DSA, Aptitude and 2 easy coding questions.
We will iterate from 1 to ‘N’ and count the number of even divisors and odd divisors. If they are equal, we will return true, else false.
Algorithm:
To check whether the string is a valid IFSC Code or not we can check every character of the string explicitly and check whether the string is in the correct format or not.
Algorithm:-
Round duration - 50 Minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Tell me somethings about OOPs.
Functional v/s OOPS programming language
Polymorphism
Static and Final Keyword in JAVA
Explain your project.
Show working of your project.
Tech stack used.
Rest API
There are 3 boxes of green, orange and green+orange. how will you know the all boxes after picking from one box ...
Round duration - 50 minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Tree traversal(Pre-order, Post-order, In-order, Level-order) and code of all orders.
All type Sorting Algorithms and their use cases
How will you make 102-102=1
make 30 using 5 2's
Tip 1 : Be strong at your basics.
Tip 2 : Do at least 2 projects and ask to find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you for a modification in your project?
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Tip 3 : Try to keep a single-page resume.
based on 2 reviews
Rating in categories
Senior Member of Technical Staff
96
salaries
| ₹12 L/yr - ₹22.1 L/yr |
Lead Member Technical Staff
43
salaries
| ₹19 L/yr - ₹32 L/yr |
Member Consulting Staff
35
salaries
| ₹20 L/yr - ₹56 L/yr |
Software Engineer
29
salaries
| ₹11 L/yr - ₹23 L/yr |
Member Technical Staff
28
salaries
| ₹9 L/yr - ₹20.2 L/yr |
Cadence Design Systems
Synopsys
Ansys Software Private Limited
Autodesk