Upload Button Icon Add office photos

Filter interviews by

Startup Software Developer Interview Questions and Answers for Freshers

Updated 22 Sep 2022

Startup Software Developer Interview Experiences for Freshers

1 interview found

Software Developer Interview Questions & Answers

user image Sujoy Banerjee

posted on 22 Sep 2022

I applied via Naukri.com and was interviewed in Aug 2022. There was 1 interview round.

Round 1 - Technical 

(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

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Startup Software Developer interview:
  • PHP
Interview preparation tips for other job seekers - Have the basic core knowledge of the topic.

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

There were three coding questions.

Round 2 - Technical 

(5 Questions)

  • Q1. Could you provide a thorough explanation of the project?
  • Q2. OOps Concepts and question from the technical subjects
  • Q3. Why Spring Boot
  • Q4. JWT Authentication
  • Q5. Docker and Kubernetes
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

DP graphs strings it was good

Round 2 - Technical 

(2 Questions)

  • Q1. Reverse a linkded list
  • Ans. 

    Reverse a linked list by changing the direction of pointers

    • Start with three pointers: current, previous, and next

    • Iterate through the list, updating pointers to reverse the direction

    • Return the new head of the reversed list

  • Answered by AI
  • Q2. Print fibonacci series
  • Ans. 

    The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.

    • Start with two variables initialized to 0 and 1

    • Loop through desired number of iterations, adding the previous two numbers to get the next number

    • Print or store each number in the series

  • Answered by AI

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jan 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

It was just a typical logical reasoning and aptitude MCQ test

Round 3 - Coding Test 

There were 2 coding questions and you can select any language for solving it. The test was online

Round 4 - Technical 

(13 Questions)

  • Q1. He simply asked me which coding language I prefer and why ? (Mine was C++)
  • Q2. Difference between C and C++?
  • Ans. 

    C is a procedural programming language while C++ is an object-oriented programming language.

    • C is a procedural programming language, while C++ supports both procedural and object-oriented programming.

    • C does not have classes and objects, while C++ does.

    • C does not support function overloading, while C++ does.

    • C does not have exception handling, while C++ does.

    • C does not have namespaces, while C++ does.

  • Answered by AI
  • Q3. What is Object oriented programming?
  • Ans. 

    Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.

    • Objects are instances of classes, which define the structure and behavior of the objects.

    • Encapsulation, inheritance, and polymorphism are key principles of object oriented programming.

    • Example: Inheritance allows a class to inherit properties and methods from another class.

    • Example: Encapsulation hides t...

  • Answered by AI
  • Q4. What are the 4 pillars of OOPs?
  • Ans. 

    Encapsulation, Inheritance, Polymorphism, Abstraction

    • Encapsulation: Bundling data and methods that operate on the data into a single unit

    • 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 details and showing only the necessary features

  • Answered by AI
  • Q5. Write down code implementing all 4 pillars of OOPs.
  • Ans. 

    Code implementing all 4 pillars of OOPs

    • Encapsulation: Encapsulate data within classes and provide public methods to access and modify the data.

    • Inheritance: Create a hierarchy of classes where child classes inherit attributes and methods from parent classes.

    • Polymorphism: Allow objects of different classes to be treated as objects of a common superclass through method overriding and overloading.

    • Abstraction: Hide complex ...

  • Answered by AI
  • Q6. Difference between Stacks and Queues?
  • Ans. 

    Stacks are Last In First Out (LIFO) data structures, while Queues are First In First Out (FIFO) data structures.

    • Stacks: Elements are added and removed from the same end, like a stack of plates. Example: Undo feature in text editors.

    • Queues: Elements are added at the rear and removed from the front, like a line of people waiting. Example: Print queue in a printer.

  • Answered by AI
  • Q7. Write a code to find the 2nd largest element in an array.
  • Ans. 

    Code to find the 2nd largest element in an array

    • Sort the array in descending order and return the element at index 1

    • Iterate through the array and keep track of the two largest elements

    • Handle edge cases like arrays with less than 2 elements

  • Answered by AI
  • Q8. What is merge sort and its Algorithm ?
  • Ans. 

    Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges them.

    • Divide the input array into two halves

    • Recursively sort each half

    • Merge the sorted halves back together

  • Answered by AI
  • Q9. What is DBMS and RDBMS and difference between them?
  • Ans. 

    DBMS stands for Database Management System, while RDBMS stands for Relational Database Management System. RDBMS is a type of DBMS.

    • DBMS is a software system that allows users to define, create, maintain and control access to the database.

    • RDBMS is a type of DBMS that stores data in a structured format using tables with rows and columns.

    • RDBMS enforces a set of rules called ACID properties to ensure data integrity, while D...

  • Answered by AI
  • Q10. What is SQL and who its different from mySQL?
  • Ans. 

    SQL is a standard language for managing databases, while MySQL is a specific open-source relational database management system.

    • SQL stands for Structured Query Language and is used to communicate with databases.

    • SQL is a standard language that can be used with various database management systems.

    • MySQL is a specific open-source relational database management system that uses SQL.

    • MySQL is one of the most popular database m...

  • Answered by AI
  • Q11. Difference between Delete, Truncate and Drop?
  • Ans. 

    Delete removes specific rows from a table, Truncate removes all rows from a table, and Drop removes the table itself.

    • Delete is a DML command that removes specific rows from a table based on a condition.

    • Truncate is a DDL command that removes all rows from a table but keeps the table structure.

    • Drop is a DDL command that removes the entire table along with its structure.

  • Answered by AI
  • Q12. Different kind of Joins in DBMS ?
  • Ans. 

    Different types of joins in DBMS include inner join, outer join, left join, right join, and full join.

    • Inner join: Returns rows when there is a match in both tables.

    • Outer join: Returns all rows from one table and only matching rows from the other table.

    • Left join: Returns all rows from the left table and the matched rows from the right table.

    • Right join: Returns all rows from the right table and the matched rows from the ...

  • Answered by AI
  • Q13. And at last 2 to 3 SQL queries. They were not that hard, Just basic queries.

Interview Preparation Tips

Interview preparation tips for other job seekers - Well be prepared with DSA,OOPs and DBMS concept. If you don't know BST or Graphs or Heaps that well, no problem just be confident. Most of the times they don't ask anything more that linked list.
If you don't know the answer of a coding question (NOTE: not a theoretical question) try for sometime to come up with the solution and while thinking keep saying your approach out loud to the interview and if after taking 1 to 2 mins you still don't know just say, Sorry I can't recall it right now but I will definitely get to it after the interview. Don't use this approach for theoretical questions, Either you have an answer to that or not.
Never Beat around the bush, be specific and to the point.

And at last, I just wanna say that passing an interview needs 40% skill, 20% communication, 20% confidence, 10% mood of the interview and 10% is luck.

Why I am saying mood of the interview and luck????
In my case, I was not selected for the final HR round. First of all, in all 137 students selected for the technical interview, my name was at 111 and randomly they called the first student for the interview and it was me. So that's luck.
OK after I entered my interviewer cabin, I saw a look of aggression on my interviewers face. We didn't smiled once during my 50min interview. He didn't even asked me to introduce myself.

He asked me 15 questions in total and I correctly answers 10 of them to the point and for the rest 5 I explained my approach to them.
Still I got rejected, and one of my friend who was answered like 2 questions out of 10 got selected because his interviewer was different. (NOTE: I am really happy for my friend, He is like my best buddy and my only well wisher that I know about).

So yeah just prepare well and be confident and even if things go south and you gave your best, just think that today was not your day and just move on.

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

2 hours with 4 questions

Round 2 - Technical 

(1 Question)

  • Q1. Basic oops, os, and two dsa questions, one was on tree and other on priority queue

Interview Preparation Tips

Interview preparation tips for other job seekers - read oops, os and dsa .

I applied via Campus Placement and was interviewed in Jul 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. 1st Question was if we could obtain a string by swapping position from a given string 2nd Question was basic 0/1 knapsack problem 3rd Question was to write a sql query 4th Question was related to Java ex...

Interview Preparation Tips

Round: Test
Experience: The test was for two and half hours where 1 hour was for general aptitude, 1 hr was for coding aptitude(either on java or C or C++as you choose) and 1/2 an hour for two coding questions.

Round: Technical Interview
Experience: In technical round they asked puzzles, aptitude questions and basic C coding. I was asked to write the code for two questions(one was on sort and search) and was asked the logic of two questions.They asked basics of linked lists, stacks, queues. Infact they were not very interested in the syntax and were pressing on the logic

General Tips: Being a non software branch students is not at all a problem. The company took 4 interns where 3 were from core branches. The fact that we had to work in JAVA and most of us didn't know JAVA, the company only looks for aptitude and ability to learn. So if you don't know anything, tell frankly that you don't know that part, rather than guessing. Be thorough with what you know and confidentially answer all the questions.
Also do not be tensed and take things lightly, if the interviewer is joking. Be candid.
Skill Tips: Learn basics of coding from books . Aptitude can be done from sites likes geeks for geeks, etc. The level of aptitude is not very high and infact the coding aptitude is also theoretical and does not involve in depth knowledge.
Skills:
College Name: NIT Surathkal

Interview Preparation Tips

Round: Technical Interview
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 ]

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. Maximum Sum With Specific Difference

    You are given an array of integers and a number ‘K’. You can pair two elements in the array 'ARR' if the absolute difference between them is strictly less than ...

  • Ans. Sorting

    Approach: We sort the given array in increasing order. For every element, we try to pair it with its previous element first. Since the array is sorted, the value of ‘ARR[i]’ would be more than ‘ARR[i - 1]’. We need to pair with a difference less than ‘K’, which means if 'ARR[i - 2]' can be paired, then ‘ARR[i - 1]’ can also be paired in a sorted array. Here, we prefer the previous element so that if ‘ARR[i]’ - ‘...

  • Answered by CodingNinjas
  • Q2. Ninja And The Tree

    Ninja is learning tree data structure these days. While learning, she came across learn about the Binary Search tree. She found BST quite interesting. She decided to make her own Binary ...

  • Ans. Brute Force Approach

    Algorithm:

     

    1. We will initialize an array of integers to store the inorder traversal of the given BST.
    2. As two nodes are swapped currently, so the inorder traversal will not be sorted.
    3. Sort the array.
    4. Now, this is a sorted array so this will represent the inorder traversal of the BST.
    5. Insert the array elements back to the tree inorder manner.
    Space Complexity: O(n)Explanation:

    O(N), where ‘N’ is the num...

  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Developer in BangaloreEligibility criteriaAbove 7 CGPAAmerican Express interview preparation:Topics to prepare for the interview - OOPs concept. Various concepts like static, non-static, virtual function, abstract class, interface, etc. Dynamic programming(imp), Data Structures - Linked List, Graph, stack , queue, treeTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Solve Code chef long challenges
Tip 2 : Solve at least problem A, B,C of codeforces competition(help to solve problems in time limit).
Tip 3 : Having at least 1 good project is a plus point.

Application resume tips for other job seekers

Tip 1 : Not more than 2 pages(1 page is good)
Tip 2 : Must know about each and every point in the resume.
Tip 3 : There should be no grammatical error in the resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

It had medium to difficult apitude questions. Make sure to practice hard.

Round 2 - Coding Test 

It had medium .level questions in it

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice more

Startup Interview FAQs

How many rounds are there in Startup Software Developer interview for freshers?
Startup interview process for freshers usually has 1 rounds. The most common rounds in the Startup interview process for freshers are Technical.
What are the top questions asked in Startup Software Developer interview for freshers?

Some of the top questions asked at the Startup Software Developer interview for freshers -

  1. What is AJAX and why is it us...read more
  2. Behavioural questi...read more

Tell us how to improve this page.

People are getting interviews through

based on 1 Startup interview
Job Portal
100%
Low Confidence
?
Low Confidence means the data is based on a small number of responses received from the candidates.
Startup Software Developer Salary
based on 40 salaries
₹2.2 L/yr - ₹10.7 L/yr
9% less than the average Software Developer Salary in India
View more details

Startup Software Developer Reviews and Ratings

based on 2 reviews

4.9/5

Rating in categories

4.9

Skill development

4.7

Work-Life balance

3.9

Salary & Benefits

4.0

Job Security

4.7

Company culture

5.0

Promotions/Appraisal

4.9

Work Satisfaction

Explore 2 Reviews and Ratings
Software Developer
40 salaries
unlock blur

₹2.2 L/yr - ₹10.7 L/yr

Software Engineer
31 salaries
unlock blur

₹2 L/yr - ₹10.2 L/yr

Consultant
22 salaries
unlock blur

₹7.2 L/yr - ₹20.1 L/yr

Front end Developer
14 salaries
unlock blur

₹1.7 L/yr - ₹8 L/yr

Product Manager
13 salaries
unlock blur

₹7.2 L/yr - ₹28.2 L/yr

Explore more salaries
Compare Startup with

Flipkart

4.0
Compare

Ola Cabs

3.4
Compare

Paytm

3.3
Compare

Swiggy

3.8
Compare

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Did you find this page helpful?
Yes No
write
Share an Interview