Upload Button Icon Add office photos
Premium Employer

i

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

10405090xyzabc Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

10405090xyzabc Chief Executive Officer Interview Questions and Answers

Updated 17 Jul 2024

10405090xyzabc Chief Executive Officer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. This is question 1
  • Q2. This is question 3
Round 2 - One-on-one 

(1 Question)

  • Q1. This is question 1 -2

Interview Preparation Tips

Interview preparation tips for other job seekers - evrething is fine

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Questions related to various on field situations , work experience , guestimates , business acumen

Interview Questionnaire 

1 Question

  • Q1. C++ Basic , malloc, calloc

I applied via Naukri.com and was interviewed in Apr 2020. There were 5 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. What were all challenges have you faces in your projects and how you overcome it, explain with any example ?
  • Q2. How you deal with conflicts between your Senior member and junior member in your projects while you are project manager, what are all conflict resolution techniques, which is best & why?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be genuine, prep up your CV thoroughly, be ready with all questions in your domain & certifications, be polite, be smiling, calm and composed, share your past achievements & expain why are best for job with best logical reasoning.

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This was a Data Structures round. Both questions were answered in optimal time complexity with clean code. Every other question was answered to the best of my knowledge

  • Q1. 

    Rotting Oranges Problem Statement

    You are given an undirected and disconnected graph G(V, E) with V vertices numbered from 0 to V-1 and E edges. Your task is to perform a BFS traversal starting from the 0...

  • Ans. 

    Perform BFS traversal on an undirected and disconnected graph starting from vertex 0.

    • Implement BFS traversal algorithm starting from vertex 0

    • Use a queue to keep track of visited nodes and their neighbors

    • Print the traversal order in sorted order for each node's connected nodes

  • Answered by AI
  • Q2. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.

    • Start with the smallest possible sum that can be represented, which is 1.

    • Iterate through the array and update the smallest sum that cannot be represented.

    • Return the final smallest sum that cannot be represented.

  • Answered by AI
  • Q3. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Use a queue to keep track of visited nodes and their neighbors.

    • Ensure to visit all connected components of the graph.

    • Print the BFS traversal sequence for each test case in a separate line.

    • Handle cases where not all vertices are reachable from vertex 0.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 100 minutes
Round difficulty - Easy

Mostly technical and System Design questions were asked.

  • Q1. Design an LRU (Least Recently Used) cache.
  • Ans. 

    Design an LRU cache to store least recently used items efficiently.

    • Use a combination of a doubly linked list and a hashmap to store and retrieve items in O(1) time complexity.

    • When an item is accessed, move it to the front of the linked list to mark it as the most recently used.

    • If the cache is full, remove the least recently used item from the end of the linked list and the hashmap.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in GurgaonEligibility criteria1+ year of ExperienceDelhivery interview preparation:Topics to prepare for the interview - DS, Algorithms, OOPS, Dynamic Programming, System Design, Java SpringTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice At least 300 questions
Tip 2 : Build Resume according to Job Description 
Tip 3 : Working with Big Data/Distributed Systems is a Plus

Application resume tips for other job seekers

Tip 1 : Skills relevant to Job Description 
Tip 2 : Do not put false things on a resume, in-depth of knowledge of everything there on the resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Design a stack that support getmin in O(1) time and O(1) space complexities
  • Ans. 

    Design a stack that supports getmin in O(1) time and O(1) space complexities.

    • Use two stacks, one for storing the actual values and the other for storing the minimum values.

    • When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.

    • When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.

    • To get the minimum val...

  • Answered by AI
  • Q2. Questions related OS and DBMS
  • Q3. Binary tree traversal
  • Ans. 

    Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.

    • There are three main types of binary tree traversal: inorder, preorder, and postorder.

    • Inorder traversal visits the left subtree, then the root, then the right subtree.

    • Preorder traversal visits the root, then the left subtree, then the right subtree.

    • Postorder traversal visits the left subtree, then the right subt...

  • Answered by AI
  • Q4. LRU cache explanation
  • Ans. 

    LRU cache is a data structure that stores the most recently used items and discards the least recently used items.

    • LRU stands for Least Recently Used

    • It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item

    • It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion

    • Example: A web browser cache that ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Good with your programming skills and fundamentals.

Skills evaluated in this interview

Round 1 - Personal Interview 

(1 Question)

  • Q1. Questions bases on your resume and projects

I applied via Recruitment Consultant and was interviewed in Nov 2019. There were 5 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Basic C++, and Data structure focus on pointers and virtual function, vptr, vtable
  • Q2. Prepare about ur current project and process followed for entire development process thoroughly
  • Q3. Prepare common tools like. Linux, git, gdb
  • Q4. Prepare basics of data structures, OOPS, design patterns used

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep a steady approach, focus more and more on basics and working principle of concepts

I applied via Referral and was interviewed in Mar 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Do you know anything about cloud computing?
  • Ans. 

    Yes, cloud computing refers to the delivery of computing services over the internet.

    • Cloud computing allows users to access data and applications from anywhere with an internet connection.

    • It offers scalability, flexibility, and cost-effectiveness compared to traditional on-premises computing.

    • Examples of cloud computing services include Amazon Web Services, Microsoft Azure, and Google Cloud Platform.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Very chill interview on the basis of profile.
Learn about new technology like cloud etc.

Skills evaluated in this interview

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

10405090xyzabc Interview FAQs

How many rounds are there in 10405090xyzabc Chief Executive Officer interview?
10405090xyzabc interview process usually has 2 rounds. The most common rounds in the 10405090xyzabc interview process are Technical and One-on-one Round.
What are the top questions asked in 10405090xyzabc Chief Executive Officer interview?

Some of the top questions asked at the 10405090xyzabc Chief Executive Officer interview -

  1. this is question 1...read more
  2. this is questio...read more
  3. this is questio...read more

Tell us how to improve this page.

10405090xyzabc Chief Executive Officer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.0
 • 5.1k Interviews
Delhivery Interview Questions
3.8
 • 477 Interviews
Siemens Interview Questions
4.1
 • 425 Interviews
CARS24 Interview Questions
3.5
 • 337 Interviews
TVS Motor Interview Questions
4.0
 • 321 Interviews
ElasticRun Interview Questions
3.5
 • 253 Interviews
BlackBuck Interview Questions
3.8
 • 180 Interviews
Ather Energy Interview Questions
4.0
 • 56 Interviews
View all
Software Developer
16k salaries
unlock blur

₹1.2 L/yr - ₹8.4 L/yr

Software Engineer
10k salaries
unlock blur

₹1 L/yr - ₹5.4 L/yr

Sales Officer
748 salaries
unlock blur

₹5.3 L/yr - ₹5.7 L/yr

Softwaretest Engineer
25 salaries
unlock blur

₹1 L/yr - ₹1.9 L/yr

Test Engineer
12 salaries
unlock blur

₹1.8 L/yr - ₹7.3 L/yr

Explore more salaries
Compare 10405090xyzabc with

Amazon

4.0
Compare

Mahindra & Mahindra

4.1
Compare

Delhivery

3.8
Compare

Siemens

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview