Algogenix Pvt Ltd interview experience Real time questions & tips from candidates to crack your interview

Software Developer

Algogenix Pvt Ltd
upvote
share-icon
3 rounds | 9 Coding problems

Interview preparation journey

expand-icon
Journey
My journey to the AlgoGenix interview was a culmination of dedication and preparation. I honed my programming skills and practised logical reasoning extensively. The interview process, which included written tests and a verbal interview with the CEO, challenged both my technical knowledge and my willingness to learn. Despite unforeseen personal challenges preventing me from joining, the experience taught me valuable lessons in perseverance and adaptability, shaping my approach to future opportunities.
Application story
My application journey for the role at AlgoGenix Private Limited began with customizing resumes and cover letters, which I submitted through platforms like Naukri.com. After eagerly awaiting responses, I was delighted to receive an invitation to their selection process. I dedicated extensive time to preparing for the interviews, focusing on refining my skills in Java, C++, and Data Structures and Algorithms (DSA) to ensure readiness for the challenges ahead. The tests took place offline at their office, conveniently located near a metro station, which eased transportation.
Preparation
Duration: 2 Months
Topics: OOPS concept, Data Structures, JavaScript (with React Framework), Virtualization, Basics of Advance java
Tip
Tip

Tip 1: Thoroughly research the company.

Tip 2: Embrace continuous learning.

Tip 3: Be prepared for unexpected twists.

Application process
Where: Naukri
Eligibility: MCA/Btech (Computer Science), Minimum 65%, Core Java, Web Technologies, DBMS
Resume Tip
Resume tip

Tip 1: Keep it concise.

Tip 2: Put the best, most relevant information first.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration30 minutes
Interview date14 Apr 2023
Coding problem3

1. What is the output of the following code?

public class Main {
   public static void main(String[] args) {
       int x = 5;
       int y = 2;
      int z = x/y
       System.out.println(z);
   }
}

2. Last-In-First-Out (LIFO)

Which data structure follows the Last-In-First-Out (LIFO) principle?
A) Queue
B) Stack
C) Linked List
D) ArrayAnswer

3. Object-Oriented Programming (OOP)

Which of the following is NOT a fundamental concept of Object-Oriented Programming (OOP)?

Encapsulation
Polymorphism
Abstraction
Sequential Execution

02
Round
Medium
Face to Face
Duration30 minutes
Interview date14 Apr 2023
Coding problem4

1. Java

What are Interfaces in Java? (Learn)

2. Reverse the String

Easy
15m average time
85% success
0/40
Asked in companies
IBMFacebookAcko

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".
follow up:
Try to solve the problem in O(1) space complexity. 
Try solving now

3. Time Complexity

What is the time complexity of inserting an element at the end of an ArrayList in Java?

4. subclass of a class

In Java, which keyword is used to define a subclass of a class? (Learn)

03
Round
Medium
Face to Face
Duration45 minutes
Interview date14 Apr 2023
Coding problem2

1. Find the frequency of each character in a string.

Moderate
25m average time
75% success
0/80
Asked in companies
Info Edge India (Naukri.com)AdobeUber

You have been given a string ‘S’.


You must return the string ‘S’ sorted in decreasing order based on the frequency of characters.

If there are multiple answers, return any of them.


Example :
Let 'S'= “abAb”. 

Here the characters ‘a’ and ‘A’ have frequency 1 and character ‘b’ has frequency ‘2’.  

Therefore the sorted string is “bbAa”. 
Try solving now

2. Binary Search

Easy
15m average time
85% success
0/40
Asked in companies
OracleMedia.netAdobe

You are given an integer array 'A' of size 'N', sorted in non-decreasing order. You are also given an integer 'target'. Your task is to write a function to search for 'target' in the array 'A'. If it exists, return its index in 0-based indexing. If 'target' is not present in the array 'A', return -1.


Note:
You must write an algorithm whose time complexity is O(LogN)


Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2580 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
3931 views
1 comments
0 upvotes
company logo
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
2806 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by Amazon
1133 views
0 comments
0 upvotes