i
NNIIT
Filter interviews by
2 questions of coding 10 mcq related to java,oops
Find max and min values in an array
Iterate through the array to find the maximum and minimum values
Initialize max and min variables with the first element of the array
Compare each element with max and min to update them accordingly
Top trending discussions
I applied via Approached by Company and was interviewed before Jan 2023. There were 2 interview rounds.
Yes, Agile is a project management methodology that emphasizes flexibility, collaboration, and iterative development.
Agile is a project management approach that focuses on delivering value to customers through iterative development and continuous feedback.
It promotes collaboration and flexibility, allowing teams to adapt to changing requirements and deliver high-quality products.
Agile methodologies include Scrum, Kanba...
User stories are concise descriptions of a feature or functionality from the perspective of the end user.
User stories are used in Agile software development to capture requirements
They are written in a simple, non-technical language
Each user story typically follows the format: 'As a [type of user], I want [some goal] so that [some reason]'
User stories help prioritize and plan development tasks
Example: 'As a customer, I...
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
The topic was smart work vs Hard work.
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
It was very insightful, and your confidence is checked
I am passionate about building relationships, meeting new people, and helping customers find solutions to their needs.
Enjoy interacting with people and building relationships
Thrilled by the challenge of meeting sales targets
Excited to help customers find solutions to their problems
To become a top-performing Sales Executive in the industry and eventually move into a leadership role.
To consistently exceed sales targets and drive revenue growth
To build strong relationships with clients and provide exceptional customer service
To continuously improve my sales skills and stay updated on industry trends
To eventually transition into a leadership role and mentor junior sales professionals
posted on 9 Oct 2022
Topic privatization in india
12 person in one group
Focused on confidence content and communication
Stay hydrated on-the-go with our durable and eco-friendly water bottle.
Made from high-quality, BPA-free materials
Leak-proof design ensures no spills or messes
Convenient carrying handle for easy transport
Sleek and stylish design that fits in any setting
Reusable and environmentally friendly
Perfect for outdoor activities, workouts, and everyday use
posted on 28 Nov 2022
I applied via Naukri.com and was interviewed before Nov 2021. There were 3 interview rounds.
They asked about social evils, child marriage and etc .
I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.
I appeared for an interview in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
Use Dijkstra's algorithm to find the shortest path between the given vertices.
Create a graph data structure to represent the weighted, undirected graph.
Handle cases where no path exists between the given vertices by returning -1.
Optimize the algorithm to handle multiple queries efficiently.
Consider edge cases such as...
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Merge Sort is a divide-an...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively
Sort the two halves separately
Merge the sorted halves to produce a fully sorted array
Time complexity of Merge Sort is O(n log n)
Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
You are provided with an N * N
maze where a rat is positioned at starting cell MAZE[0][0]
. The goal is to determine and print all possible paths that the rat can take to r...
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
Use backtracking to explore all possible paths from the starting cell to the destination cell.
At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.
Keep track of the path taken so far and mark the cells accordingly.
Once the destination cell i...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
based on 1 interview
Interview experience
Business Development Executive
7
salaries
| ₹1.4 L/yr - ₹5.5 L/yr |
Business Development Manager
4
salaries
| ₹8 L/yr - ₹10 L/yr |
Business Development Associate
3
salaries
| ₹4 L/yr - ₹6 L/yr |
Human Resource
3
salaries
| ₹2 L/yr - ₹4 L/yr |
(Bde)business Development Executive
3
salaries
| ₹5 L/yr - ₹5 L/yr |
Lido Learning
Acadecraft
KaaShiv InfoTech Company
Coding Ninjas