infosys logo
Infosys· specialist programmer

Infosys | Specialist Programmer | 2023 batch

Result
Offer
Location
pune
Posted
2 Jan 2023
406 reads

Summary

I participated in HackWithInfy 2022, securing a top rank which led to a Pre-Placement Interview opportunity for the Specialist Programmer role at Infosys. After a coding round on LRU Cache and several theoretical questions on OOPS and DBMS, I successfully received an offer.

How it went

I appeared in HackWithInfy 2022, an all-India coding competition organized by Infosys. I secured an Under 100th Rank in it, which earned me a Pre-Placement Interview opportunity for the Specialist Programmer role at Infosys. I also moved into the Grand Finale, which was organized in Infosys Pune Development Centre from August 25-29, 2022.

The HackWithInfy Round 1 consisted of 3 problem-solving questions. These included an easy brute force problem, a medium problem based on a Greedy algorithm, and a hard problem based on Dynamic Programming. I was allowed to solve these using C++, Java, or Python.

HackWithInfy Round 2 was a video interview with an interviewer conducted on Microsoft Teams, lasting less than an hour. First, he asked me to introduce myself. After my introduction, he immediately asked a very famous LeetCode question: LRU Cache. As I had solved this question previously, I quickly recalled the approach and started working on it.

After the coding question, he moved on to the theory part. He asked me OOPS questions, specifically covering the Pillars of OOPS (Abstraction, Encapsulation, Inheritance, Polymorphism). He delved deeper into Abstraction and then Inheritance, including its types, Multiple Inheritance, and Multilevel Inheritance.

Next, he questioned me on DBMS concepts. These included What are ACID properties, the difference between WHERE and HAVING clauses, What is Normalization and its types, and What is multivalued dependency.

Finally, he asked about my project which I had mentioned in my resume. The questions were not deep, just about the tech stacks I used and the motivation behind my project.

My verdict was: Selected.

Questions asked (8)

  1. 01

    LRU Cache

    Data Structures & Algorithms · Medium

    Design and implement a data structure for a Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key): Get the value of the key if the key exists in the cache, otherwise return -1. put(key, value): Set or insert the value if the key is not already present. When the cache reaches its capacity, it should invalidate the least recently used item before inserting a new item.

    Open the problem
  2. 02

    Pillars of OOPS

    Other

    Explain the four fundamental pillars of Object-Oriented Programming: Abstraction, Encapsulation, Inheritance, and Polymorphism.

  3. 03

    Explain Abstraction

    Other

    Describe the concept of Abstraction in Object-Oriented Programming. Provide examples of how it's achieved.

  4. 04

    Explain Inheritance and its Types

    Other

    Elaborate on the concept of Inheritance in OOP. Discuss different types of inheritance, specifically focusing on Multiple and Multilevel Inheritance.

  5. 05

    Explain ACID Properties

    Other

    Describe the ACID properties (Atomicity, Consistency, Isolation, Durability) in the context of database transactions.

  6. 06

    WHERE vs. HAVING Clause

    Other

    Explain the key differences between the WHERE and HAVING clauses in SQL, and when each should be used.

  7. 07

    Database Normalization and Types

    Other

    What is database Normalization? Discuss its importance and various normal forms (e.g., 1NF, 2NF, 3NF, BCNF).

  8. 08

    Explain Multivalued Dependency

    Other

    Define and explain the concept of Multivalued Dependency in database theory.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Infosys recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!