Corecard Software Software Developer Interview Questions and Answers

Implement the function "Printlast10lines" such that the program prints the last 10 (or less) in a given string

Q1. Delete nth node in a singe linked list
Ans. 
To delete the nth node in a single linked list, we need to find the (n-1)th node and update its next pointer.
• Traverse the linked list to find the (n-1)th node

• Update the next pointer of the (n-1)th node to skip the nth node

• Free the memory allocated to the nth node
Answered by AI
Add your answer

Machine coding.
Code structure, naming, best practices are more important than time or space complexity.

Same as Round 1, except more complex problem statement

Q1. Integration round. Given a library, do some operations with it, i.e. pull specific data point from file, make an POST call using different data point etc.
Add your answer

Q1. Given a codebase, fix a specific bug
Ans. 
I would start by reproducing the bug, analyzing the code, identifying the root cause, implementing a fix, testing the fix, and finally deploying it.
• Reproduce the bug by following the steps that lead to the issue.

• Analyze the code surrounding the bug to understand the context and potential causes.

• Identify the root cause of the bug by debugging and tracing the code execution.

• Implement a fix by making the necessary code ch...read more
Answered by AI
Add your answer

Q1. Standard HLD/LLD design problem
Ans. 
HLD focuses on overall system architecture, while LLD delves into specific implementation details.
• HLD includes components, modules, interfaces, and dependencies.

• LLD involves detailed class diagrams, data structures, algorithms, and database schema.

• Example: HLD may outline a system using microservices architecture, while LLD may specify how each microservice communicates and stores data.
Answered by AI
Add your answer

LLD for load balancer

Q1. API integrations, integrate 3rd party API to visualize ride locations and generate images
Add your answer

Solve a bug in JSON like parsing library

Screening round was a 1 hour coding test. Mostly non leetcode style where the question is incremental - Eg. Identify a pattern in a given text value and extract it then perform subsequent transformations. There is no right or wrong its just how well you are able to do the task.

Q1. Resume related system design deep dive
Add your answer

Another round similar to the first one with an incremental coding test. Question was very lengthy.

Q1. SQL database and you need to find out what is wrong with the data
Add your answer

Q1. Another coding round where you need to go clone a repo and extend an existing feature using the libraries in the documentation provided.
Add your answer

It was 30 min coding test and question was from easy level DSA question

Q1. Difference between react and next
Ans. 
React is a JavaScript library for building user interfaces, while Next is a framework for building server-side rendered React applications.
• React is a JavaScript library for building user interfaces.

• Next is a framework for building server-side rendered React applications.

• Next provides features like server-side rendering, static site generation, and routing out of the box.
Answered by AI
Add your answer
Q2. What is Nodejs and its event loop
Ans. 
Node.js is a runtime environment that allows you to run JavaScript on the server side.
• Node.js is built on Chrome's V8 JavaScript engine.

• It uses an event-driven, non-blocking I/O model.

• The event loop is responsible for handling asynchronous operations in Node.js.

• Example: Reading a file asynchronously in Node.js using fs module.
Answered by AI
Add your answer

Q1. It was one-on-one round with the CTO. They judged me on my technical knowledge as well as understanding of tech-era.
Add your answer
Q2. I was asked question related to the languages and tech-stacks I mentioned in my resume and also question related to OOPs concepts.
Add your answer

Q1. Find connected components in a graph
Ans. 
Use Depth First Search (DFS) to find connected components in a graph
• Start by initializing all vertices as unvisited

• Iterate through each vertex and perform DFS to find connected components

• Keep track of visited vertices to avoid revisiting

• Example: For a graph with vertices {A, B, C} and edges {(A, B), (B, C)}, the connected components are {A, B, C}
Answered by AI
Add your answer

Q1. Design chess game
Ans. 
Design a chess game with proper board setup, piece movements, and win conditions.
• Create a 8x8 grid to represent the chess board

• Assign initial positions to each type of chess piece (pawn, rook, knight, bishop, queen, king)

• Implement rules for each piece's movement (e.g. pawn moves forward, rook moves horizontally/vertically)

• Check for valid moves and capture opponent's pieces

• Implement win conditions (checkmate, stalemate)

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