Credgenics Software Developer Intern Interview Questions and Answers

3 dsa questions medium level

Q1. 2 medium level dp questions based on string and stocks
Add your answer
Q2. One hard question based on graph
Add your answer

Q1. Hr questions and java , springboot questions etc
Add your answer

Test was based on arrays and some dsa concepts.

Coding and aptitude round

Q1. Tree dsa questions
Add your answer

Q1. Horse race question
Add your answer

Q1. Location specific question
Add your answer

They follow the same pattern questions in every college so go through those. These are easily accessible from Leetcode discussion section.

Q1. Well I was not selected for futther rounds :(
Add your answer

Javascript,html, CSS and MySQL

Q1. Basic NodeJs and MySQL questions,scenario-based technical questions and basic interview questions
Add your answer
Q2. What is an event loop, The second highest from the table
Ans. 
An event loop is a programming construct that waits for and dispatches events or messages in a program.
• Event loop is commonly used in asynchronous programming to handle tasks like I/O operations without blocking the main thread.

• It continuously checks for events in a queue and processes them one by one.

• Examples of event loops include Node.js event loop for handling asynchronous operations in JavaScript.

• Event loop helps ...read more
Answered by AI
Add your answer

Q1. Basic nodejs and SQL queries question
Add your answer

Q1. Basic interview question and technology based
Add your answer

Q1. Basic Python Questions Work Exp related discussions
Add your answer
Q2. Snake and Ladder Problem
Ans. 
Snake and Ladder Problem is a classic board game where players move their tokens based on the roll of a dice.
• The game involves a board with numbered squares, where players move their tokens based on the roll of a dice.

• Snakes and ladders on the board can either help a player advance or set them back.

• The game continues until a player reaches the final square, usually 100, to win.
Answered by AI
Add your answer

Q1. Internal Implementation of HashMap
Ans. 
HashMap is implemented using an array of linked lists to handle collisions.
• HashMap stores key-value pairs in an array of linked lists

• Hash function is used to determine the index of the array where the key-value pair will be stored

• Collision handling is done by chaining, where multiple key-value pairs with the same hash value are stored in the same linked list

• HashMap allows null keys and values

• HashMap is not synchronized...read more
Answered by AI
Add your answer