ADF Data Science Senior Software Engineer Interview Questions and Answers

Q1. Tell me more about your experience
Add your answer

Any online ideas, ds-algo, medium level

Swift, security framework, api, memory management

Q1. Basic ds-algo nd technical question
Add your answer

Q1. Managerial question
Add your answer

Q1. Just be prepared with your resume and basic DS Algo questions
Add your answer
Q2. Find total Nodes in a Binary tree along with time and space complexity
Ans. 
Total nodes in a binary tree can be found using depth-first or breadth-first traversal algorithms with time complexity O(n) and space complexity O(h), where h is the height of the tree.
• Use depth-first traversal (pre-order, in-order, post-order) or breadth-first traversal to visit each node and count the total nodes.

• Time complexity is O(n) where n is the number of nodes in the tree.

• Space complexity is O(h) where h is th...read more
Answered by AI
Add your answer
Q3. MYSQL Questions based on Inner Joins
Add your answer

Q1. Construct 4 Array Tree from scratch and implement some operations
Ans. 
Construct 4 Array Tree and implement operations
• Create an array to represent the tree structure

• Implement operations like insert, delete, search, and traversal

• Example: Construct a binary search tree using arrays
Answered by AI
Add your answer
Q2. Some quizzes to check logical thinking
Add your answer
Q3. How to compare 2 large 100 GB JSON files in O(1) Time complexity
Ans. 
Use hashing to compare the JSON files in O(1) time complexity.
• Create a hash function to convert the JSON data into a unique hash value.

• Calculate the hash value for each JSON file and compare the hash values.

• If the hash values are equal, the JSON files are identical.

• Example: Use MD5 or SHA-256 hash functions for generating hash values.
Answered by AI
View 1 more answer
Q4. Map parent to children of a 4 Array tree in O(1) Space complexity
Ans. 
Use array indices to map parent to children in a 4 Array tree in O(1) space complexity.
• Assign children of a parent at indices 4*i+1, 4*i+2, 4*i+3, 4*i+4 where i is the index of the parent.

• To find parent of a child at index j, use (j-1)/4 to get the parent index.
Answered by AI
Add your answer

Basic aptitude questions and 2 hard DP questions in the Online Test .

Q1. Basic SQL queries
Add your answer
Q2. OOP questions Java
Add your answer
Q3. Puzzles from Geeksforgeeks
Add your answer
Q4. DSA questions - medium level
Add your answer