Chingari Software Engineer Interview Questions and Answers

Machine Coding of Google Calendar

Machine Coding of MP3 Player

Q1. Find Duplicates problem
Ans. 
Find duplicates in an array of strings
• Iterate through the array and store each element in a hash set

• If an element is already in the hash set, it is a duplicate

• Return a list of all duplicates found
Answered by AI
Add your answer

Q1. Why Simpl? and compensation
Ans. 
Simpl offers a collaborative and innovative work environment with competitive compensation.
• Simpl values teamwork and creativity in software development

• Competitive compensation package offered to attract top talent

• Opportunities for growth and learning through challenging projects
Answered by AI
Add your answer

It was good , 2 questions are there to code.

Q1. Cs fundamental, Projects, coding.
Add your answer
Q2. A simple coding question of string using map
Ans. 
Using a map to manipulate strings can simplify tasks like counting characters or finding duplicates efficiently.
• Use a HashMap to count occurrences of each character in a string. Example: 'hello' -> {'h': 1, 'e': 1, 'l': 2, 'o': 1}.

• To find duplicates, iterate through the map and collect characters with a count greater than 1. Example: 'banana' -> ['a', 'n'].

• Maps can also be used to store transformations, like mapp...read more
Answered by AI
Add your answer

Q1. What is React router. what does it do.
Ans. 
React Router is a popular routing library for React applications.
• React Router is used for handling navigation in React applications.

• It allows defining multiple routes in the application and rendering different components based on the URL.

• React Router provides components like BrowserRouter, Route, Switch, and Link for routing.

• Example: will render the About component when the URL...read more
Answered by AI
Add your answer
Q2. Questions based on react basics.
Add your answer

A simple Google form assignment to shortlist candidates

Q1. ML related questions
Add your answer
Q2. Find duplicates in array
Ans. 
Use a hash set to find duplicates in an array of strings.
• Create a hash set to store unique elements.

• Iterate through the array and check if each element is already in the hash set.

• If it is, then it is a duplicate.

• Example: ['apple', 'banana', 'apple', 'orange'] should return 'apple' as a duplicate.
Answered by AI
Add your answer

It was an assignment where we were instructed to create a screen that fetches data from the backend and renders it with the functionality of bookmarking.

A Google Form-based Aptitude Test with Basic Questions

Q1. Asked Basic Time Complexity and DSA Questions like Time Complexity Of quick sort use of stack Data Structure etc
Add your answer

It was the final round asked to do a medium-level coding Question to convert a number such as 244 to word i.e Two Hundred and Forty four

Q1. High Level Design Book My Show
Add your answer
Q2. Questions on system design, core CS, Easy To Medium Leetcode style DSA, Behaviorial
Add your answer

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Q1. Difference between sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a specific order.
• Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

• Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

• For example, quick sort is generally faster than bubble sort for large data sets.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
• BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer