Edgrasp.in Interview Questions and Answers

Aptitude on clocks, calenders, boats and streams..

Aptitude based on clocks, calendars, boats and streams..

Q1. Asked about python, c, c++, html, css
Add your answer
Q2. Python basics, differences between them
Add your answer

Q1. How would you use your skill for sales
Add your answer

It was quite easy

Q1. Based on resume. Go through with your resume..
Add your answer

Basic coding maths aptitude java python communication skills test

Java coding c plus python SQL oracle dbmsos

Q1. Introduce Yourself,Write a code to find repeative characters in a String
Ans. 
I am a software engineering student with a passion for coding. Here is a code to find repetitive characters in a string.
• Iterate through the characters in the string and store their occurrences in a HashMap.

• Check the HashMap for characters with occurrences greater than 1 to find repetitive characters.

• Return the repetitive characters as an array of strings.
Answered by AI
Add your answer
Q2. Hi this is my name and qualification and experience
Add your answer

Q1. SQL question difference between having and where
Ans. 
HAVING is used with GROUP BY to filter groups, WHERE is used to filter rows
• HAVING is used with GROUP BY to filter groups based on aggregate functions

• WHERE is used to filter rows based on conditions

• HAVING is applied after GROUP BY, WHERE is applied before GROUP BY

• Example: SELECT department, AVG(salary) FROM employees GROUP BY department HAVING AVG(salary) > 50000;

• Example: SELECT * FROM employees WHERE department = 'S
Answered by AI
Add your answer

Q1. Tell me about your self , internship or exp. Why sales?
Ans. 
I have a background in marketing and sales through internships and previous work experience. I am passionate about sales because of the opportunity to build relationships and drive revenue.
• Interned at XYZ company where I learned about sales strategies and techniques

• Worked as a sales associate at ABC store, exceeding sales targets consistently

• Enjoy the challenge of meeting customer needs and closing deals

• Passionate abou...read more
Answered by AI
Add your answer

A sales pitch round in which a scenario was provided.

Q1. Final interview questions from cv.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Path Queries Problem Statement
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...read more
Ans. 
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...read more
Answered by AI
Add your answer
Q2. 
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...read more
Ans. 
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]
Answered by AI
Add your answer
Q3. 
Rat in a Maze: All Paths Problem
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...read more
Ans. 
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...read more
Answered by AI
Add your answer