Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by AN3 TECHNO POWER Team. If you also belong to the team, you can get access from here

AN3 TECHNO POWER Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

AN3 TECHNO POWER Interview Questions and Answers

Updated 24 Feb 2025

AN3 TECHNO POWER Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I appeared for an interview in Aug 2024.

Round 1 - One-on-one 

(1 Question)

  • Q1. Can you provide a brief introduction and an overview of your past experience?

Top trending discussions

View All
Interview Tips & Stories
1w
toobluntforu
·
works at
Cvent
Can speak English, can’t deliver in interviews
I feel like I can't speak fluently during interviews. I do know english well and use it daily to communicate, but the moment I'm in an interview, I just get stuck. since it's not my first language, I struggle to express what I actually feel. I know the answer in my head, but I just can’t deliver it properly at that moment. Please guide me
Got a question about AN3 TECHNO POWER?
Ask anonymously on communities.

Interview questions from similar companies

I applied via Campus Placement

Interview Questionnaire 

3 Questions

  • Q1. They asked me optimise the code I had written for the first question
  • Q2. Given a binary tree, find out the maximum sum path from root to leaf. This problem, but they said tree has only positive integers. -----/ . To store the path I had used global array. They asked me alternat...
  • Q3. Given a list of words. Given three operations find out the minimum steps to reach from source string to destination string. Basically, -----/ this is the problem with some modification. For this question I...
  • Ans. 

    The question is about finding the minimum steps to reach from a source string to a destination string using three operations.

    • BFS and DFS are graph traversal techniques that can be used to solve this problem.

    • BFS is typically used when finding the shortest path or exploring all possible paths in a graph.

    • DFS is useful when searching for a specific path or exploring deeply into a graph.

    • In this case, BFS can be used to find...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: • 1 question was on time complexity of searching an unsorted array.
• 2 questions were on recursion, ie, number of recursive calls.
• 1 question on analysing given function on string.
• 1 question was on probability(Two hotels, say A and B. Probability of moving from A to B is 2/3, staying at A is 1/3. Probability of moving from B to A and staying at B is 1/2. If they make decisions each hour, and if they were at A at 7:00 pm, what is the probability that they will be at B at 10:00 pm).
• If a set has elements {1,2,3,4 .... n}. Then what is the sum of elements of it's power set. (Ex: S = {1,2}. Then power set is {{},{1},{2},{1,2}}. The sum is 6.
• If a set has elements {1,2,3,4,5,6,7,8,9,10}. Then how many subsets of 3 elements has no consecutive elements.
• 1 question was on designing a DFA for a string starting with a and ending with c and has at least b in it.
• 1 question had machine instructions. We had to find out minimum number of cycles needed to execute the given set of instructions. (a) If the instructions are executed in the given order. (b) If the instructions are executed in random order.
• 1 puzzle on bridges.

Tips: In this round they not only see the answer. They also verify how you approached(So, give correct explanation to your answers).
Duration: 90 minutes
Total Questions: 10

Round: Coding Round
Experience: Two questions were there. 3 hours duration.

1. Long question, I don't remember fully. I'll just give input/output examples. It was basically on string decoding. If jon2snow3 is there the decoded string will be jonjonsnowjonjonsnowjonjonsnow. Given a string and an integer k we have print the kth character in the decoded string
input:
jon2snow3
8
output:
n

2. Given an array and an integer k return the number of contiguous sub arrays whose sum is divisible by k.
input format:
n k

input:
4 5
10 0 4 5

output:
4

explaination: {10},{0},{10,0},{5} are the sub arrays with sum divisible by 5.


Tips: You will have lots of time, so try to optimise the solution if you can. Remember here also they review each individual's code.

Round: Technical Interview
Experience: They will help you a lot if you are stuck at some point in the question. You have to be smart enough to grasp the clue.
Tips: They only ask questions only on data structures and algorithms.

Skill Tips: You have to be strong in coding. Algorithm questions will be mostly on dynamic programming. Data structures questions are mostly on trees.
Skills: C Programming, Maths(esp Probability), Algorithms And Data Structures
Duration: 5
College Name: JSS Mahavidyapeetha Sri Jayachamarajendra College Of Engineering, Mysore

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. Asked me about my answer for a question in the logical test and asked me to find mistake
  • Q2. Some tree question
  • Q3. Some array question

Interview Preparation Tips

Round: Test
Experience: Just logical questions. Maybe create a DFA and NFA.
Duration: 1 hour
Total Questions: 20

Round: Coding
Experience: Given two questions. Each question is written like a story, but once you get the idea, it will be a simple question

College Name: Govt. Model Engineering College
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
-

I appeared for an interview in Mar 2025, where I was asked the following questions.

  • Q1. Write algo to find the next element of a given value x in a sorted array?
  • Ans. 

    Find the next element of a given value x in a sorted array using binary search for efficiency.

    • Use binary search to find the index of x in the sorted array.

    • If x is found, check the next index for the next element.

    • If x is not found, the next element is the smallest element greater than x.

    • Example: For array [1, 3, 5, 7] and x = 5, the next element is 7.

    • Example: For array [1, 2, 4, 6] and x = 3, the next element is 4.

  • Answered by AI
  • Q2. Write algo to swap two element without using third variable? case 1: if both variable are integer case 2:if both variable are strings
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I appeared for an interview in Oct 2024, where I was asked the following questions.

  • Q1. DSA, Machine Coding
  • Q2. Data Structures and Algorithm
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Level was medium to hard

Round 2 - Technical 

(5 Questions)

  • Q1. Technical interview
  • Q2. Questions on DSA Cs fundamentals
  • Q3. Coding questions
  • Q4. Ques on String array
  • Q5. To print tree in anticlock wise direction
  • Ans. 

    To print a tree in anticlockwise direction, start from the bottom left and traverse each level from right to left.

    • Start from the bottom left of the tree

    • Traverse each level from right to left

    • Print the nodes as you traverse

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Some old coding platform with limited testcases

Round 2 - Technical 

(1 Question)

  • Q1. Normal dp problems
Round 3 - Manegeral 

(1 Question)

  • Q1. About resume and projects
Are these interview questions helpful?
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. About my current company
  • Q2. About the work I do in my current company
Round 2 - Coding Test 

Coding round where they ask few coding questions

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 coding questions, aptitude and electronics

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

3 rounds online, dsa, hr

Round 2 - One-on-one 

(2 Questions)

  • Q1. Dsa on dp topic
  • Q2. Dsa on dp topics

AN3 TECHNO POWER Interview FAQs

How many rounds are there in AN3 TECHNO POWER interview?
AN3 TECHNO POWER interview process usually has 1 rounds. The most common rounds in the AN3 TECHNO POWER interview process are One-on-one Round.

Tell us how to improve this page.

Overall Interview Experience Rating

5/5

based on 2 interview experiences

Difficulty level

Easy 100%

Duration

Less than 2 weeks 100%
View more

Interview Questions from Similar Companies

AvenueCorp Interview Questions
4.6
 • 6 Interviews
Hykon Interview Questions
3.6
 • 4 Interviews
View all

AN3 TECHNO POWER Reviews and Ratings

based on 8 reviews

1.8/5

Rating in categories

1.7

Skill development

2.3

Work-life balance

2.3

Salary

1.8

Job security

1.7

Company culture

2.0

Promotions

1.8

Work satisfaction

Explore 8 Reviews and Ratings
Engineer
3 salaries
unlock blur

₹3 L/yr - ₹3.4 L/yr

Graphic Designer
3 salaries
unlock blur

₹2.4 L/yr - ₹5.4 L/yr

Junior Design Engineer
3 salaries
unlock blur

₹3.5 L/yr - ₹4.5 L/yr

Explore more salaries
Compare AN3 TECHNO POWER with

Hykon

3.6
Compare

Chheda Electricals and Electronics

3.8
Compare

Vu Televisions

3.1
Compare

Systematic Group

3.3
Compare
write
Share an Interview