AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Startup Interview Questions and Answers for Freshers
Startup Interview Experiences for Freshers
5 interviews found
Selected
I applied via Naukri.com and was interviewed in Jun 2024. There were 3 interview rounds.
C++:
#
#
Class Demo
{
int n;
Public:
Void accept()
{
Cout<<"Enter number";
Cin>>n;
if(n>10)
{
Cout<<" It is greater than 10";
}
if(n<10)
{
Cout<<"It is not greater than 10";
}
}
};
Void main ()
{
Clrscr( ) ;
Demo D
D. accept () ;
getch () ;
}
Class Test Calculator
{
Public Static void main (String [] args) {
Calculator C1=new Calculator ();
C1:Addition (10, 20) ;
C1:Multiplication (10, 20) ;
C1:Subtraction (10, 20) ;
C1:Division (10, 20);
}
}
My self: Aditya Manik Gidhane
I Study in Complete : BSc (computer science)
Java Developer Trainee Interview Questions asked at other Companies
I applied via Newspaper Ad and was interviewed in Oct 2024. There was 1 interview round.
Verbal and anlytical topics
Full Stack Developer Interview Questions asked at other Companies
(1 Question)
- Q1. DESCRIBE THE ONBOARDING PROCESS
- Ans.
Onboarding process involves integrating new employees into the organization and providing them with the necessary tools and information to succeed.
Orientation sessions to introduce company culture and policies
Training on job responsibilities and expectations
Assigning a mentor or buddy for support and guidance
Setting up necessary equipment and access to systems
Regular check-ins to monitor progress and address any concer
HR Intern Interview Questions asked at other Companies
I applied via Naukri.com and was interviewed in Aug 2022. There was 1 interview round.
(1 Question)
- Q1. What is AJAX and why is it used?
- Ans.
AJAX stands for Asynchronous JavaScript and XML. It is used to update parts of a web page without reloading the entire page.
AJAX allows for asynchronous communication between the client and server
It is commonly used to create dynamic and responsive web applications
AJAX uses XMLHttpRequest (XHR) object to send and receive data asynchronously
Examples of AJAX in action include auto-suggest search boxes and real-time chat
Interview Preparation Tips
- PHP
Skills evaluated in this interview
Software Developer Interview Questions asked at other Companies
Startup interview questions for popular designations
I applied via Referral and was interviewed in Dec 2021. There were 3 interview rounds.
Algorithm, multiple choice, 40 mins
(1 Question)
- Q1. Where do you see yourself in 2 years
Interview Preparation Tips
Software Engineer Intern Trainee Interview Questions asked at other Companies
Top trending discussions
Interview questions from similar companies
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Check palindrome , anagram of string with O(n)
- Ans.
To check palindrome and anagram of a string with O(n), use a hash table to store character frequencies.
Create a hash table to store the frequency of each character in the string.
For palindrome, check that no more than one character has an odd frequency.
For anagram, compare the hash tables of the two strings.
If the hash tables are equal, the strings are anagrams.
If the hash tables differ by only one character, the strin...
- Q2. Optimized solutions and core principles applied in OOPS
- Ans.
Optimized solutions and core principles applied in OOPS
Encapsulation, Inheritance, Polymorphism, Abstraction are core principles of OOPS
Optimized solutions can be achieved through efficient algorithms and data structures
Design patterns like Singleton, Factory, Observer can also be used for optimized solutions
Interview Preparation Tips
Skills evaluated in this interview
I appeared for an interview before May 2021.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Hard
- Q1.
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
- Ans.
Find the duplicate number in an integer array containing numbers from 0 to (N - 2).
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number that appears twice in the array.
The duplicate number is always present in the given array.
(1 Question)
Round duration - 50 Minutes
Round difficulty - Easy
- Q1.
Bubble Sort Problem Statement
Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-d...
- Ans.
Bubble Sort is used to sort an array of non-negative integers in non-decreasing order by swapping adjacent elements if they are not in the correct order.
Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.
Repeat this process until the array is sorted in non-decreasing order.
Time complexity of Bubble Sort is O(n^2) in worst case.
Example: For input [6, 2, 8, 4, 10], the o
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1.
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has
Nhouses numbered from 1 ... - Ans.
Find the shortest path between two houses in a city represented as an unweighted graph.
Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.
Start BFS from the source house and keep track of the shortest path to each house.
Once the destination house is reached, backtrack to find the shortest path.
Consider using a queue data structure to implement BFS efficiently.
Round duration - 60 Minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : online resources
Tip 2 : cracking the coding interview by Gayle laykemann this is one of the best book for learning the concept at the initial level. Start practicing the approaches mention in the book once done apply the same to similar level pattern questions.
Tip 3 : geeks for geeks start from school level and then move towards easy medium and hard once done practice the previous year questions
Tip 1 : precise clear concise and well written
Tip 2 : mentions the skills sets along with the projects
Skills evaluated in this interview
I appeared for an interview before Nov 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
It was in the evening at about 7 pm. The test platform was quite user friendly and easy to use.
There were 3 sections in test. One was logical ability, second was english, third was coding
Questions were of medium difficulty.
- Q1.
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
- Ans.
The task is to find the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to solve this problem efficiently.
Create a 1D array to store the number of ways to make change for each value from 0 to the target value.
Iterate through the denominations and update the array based on the current denomination.
The final answer will be the value at the target index of the ar
(1 Question)
Round duration - 30 Minutes
Round difficulty - Medium
It was a 30 minute interview. In which I was provided with questions on data structures and algorithms to check my problem solving skills.
- Q1.
Non-Decreasing Array Problem Statement
Given an integer array
ARRof sizeN, determine if it can be transformed into a non-decreasing array by modifying at most one element.An array is defined as non-de...
- Ans.
Determine if an array can be transformed into a non-decreasing array by modifying at most one element.
Iterate through the array and check if there are more than one decreasing elements.
If there is only one decreasing element, check if modifying it can make the array non-decreasing.
Return true if the array can be made non-decreasing by modifying at most one element, otherwise false.
Round duration - 40 Minutes
Round difficulty - Medium
In this round , interviewer discussed about my resume. As I had done a internship in sql and database so he asked me questions related to dbms and sql queries.
Interview Preparation Tips
Tip 1 : practice data structures and algorithms thoroughly
Tip 2 : do atleast 2 project
Tip 3 : maintain a decent cgpa (above 8.5)
Tip 1 : write all your academic achievements on resume
Tip 2 : do not write false things in resume
Tip 3 : be thorough with your resume
Skills evaluated in this interview
Software Developer Interview Questions & Answers
State Street Corporation
Anonymous
posted on 20 May 2017
I appeared for an interview in May 2017.
Interview Questionnaire
6 Questions
- Q1. Can string class be extended
- Ans.
Yes, the string class can be extended in most programming languages.
Inheritance can be used to extend the functionality of the string class.
By creating a new class that inherits from the string class, additional methods and properties can be added.
Extending the string class allows for customization and adding specific functionality to strings.
Example: In Python, the string class can be extended by creating a new class
- Q2. What are the implecit object in JSP
- Ans.
Implicit objects in JSP are predefined objects that are available for use without any declaration or initialization.
Implicit objects in JSP include request, response, session, application, out, config, pageContext, page, exception, and others.
These objects provide access to various aspects of the JSP environment and can be used to perform common tasks.
For example, the request object allows access to HTTP request parame...
- Q3. How does hash map works
- Ans.
A hash map is a data structure that uses a hash function to map keys to values.
Hash map stores key-value pairs
It uses a hash function to compute an index for each key
Collisions can occur when two keys hash to the same index
Hash maps provide fast access to values based on their keys
- Q4. Difference between string buffer and string builder
- Ans.
StringBuffer and StringBuilder are both used to manipulate strings, but StringBuffer is thread-safe while StringBuilder is not.
StringBuffer is synchronized, making it safe for use in multi-threaded environments.
StringBuilder is not synchronized, making it faster but not thread-safe.
StringBuffer is preferred when multiple threads are involved, while StringBuilder is preferred for single-threaded scenarios.
Both classes p...
- Q5. What is MVC
- Ans.
MVC is a software architectural pattern that separates an application into three main components: Model, View, and Controller.
Model represents the data and business logic of the application.
View is responsible for displaying the user interface.
Controller handles user input, updates the model, and interacts with the view.
MVC promotes separation of concerns and modularity in software development.
Example: In a web applica...
- Q6. What are the annotation used in RESTFULL web services
- Ans.
Annotations used in RESTful web services
1. @Path - Specifies the URI path for the resource
2. @GET - Specifies that the method handles HTTP GET requests
3. @POST - Specifies that the method handles HTTP POST requests
4. @PUT - Specifies that the method handles HTTP PUT requests
5. @DELETE - Specifies that the method handles HTTP DELETE requests
6. @PathParam - Binds the value of a URI template parameter to a method paramete...
Interview Preparation Tips
Skills evaluated in this interview
Interview Preparation Tips
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5
- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.
College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]
Startup Interview FAQs
Tell us how to improve this page.
Startup Interviews By Designations
- Startup Software Engineer Interview Questions
- Startup Software Developer Interview Questions
- Startup Product Manager Interview Questions
- Startup Full Stack Developer Interview Questions
- Startup Product Management Trainee Interview Questions
- Startup Java Developer Interview Questions
- Startup Data Engineer Interview Questions
- Startup HR Intern Interview Questions
- Show more
Interview Questions for Popular Designations
Startup Interview Process for Freshers
based on 3 interviews
Interview experience
Interview Questions from Similar Companies
|
Software Engineer
42
salaries
|  ₹9.9 L/yr - ₹26 L/yr |
|
Software Developer
39
salaries
| ₹4 L/yr - ₹12.2 L/yr |
|
Product Manager
20
salaries
| ₹8.9 L/yr - ₹31 L/yr |
|
Front end Developer
18
salaries
| ₹1 L/yr - ₹5 L/yr |
|
Consultant
17
salaries
| ₹12 L/yr - ₹36 L/yr |
HSBC Group
Cholamandalam Investment & Finance
Citicorp
BNY
- Home >
- Interviews >
- Startup Interview Questions >
- Startup Interview Questions for Fresher
