Tekion Software Development Engineer II Interview Questions and Answers

Data Structures and Algorithms

Q1. Questions on system design
Add your answer

Q1. Cultural fit and work experience
Add your answer

Q1. Build a Hash Map which does everything in o(1)
Ans. 
Use a combination of hash table and linked list to achieve O(1) operations for a Hash Map.
• Use a hash table to store key-value pairs and a linked list to handle collisions.

• Implement a hash function to map keys to indices in the hash table.

• For each key, calculate the hash value and store the corresponding value in the hash table at that index.

• To handle collisions, use separate chaining with linked lists at each index of ...read more
Answered by AI
Add your answer
Q2. Buy and Sell Stock 4
Add your answer

Q1. Given a Matrix of character[][]. Write a program to search a string in that matrix efficiently.
Ans. 
Search for a string efficiently in a character matrix.
• Use depth-first search (DFS) or breadth-first search (BFS) to traverse the matrix and search for the string.

• Optimize by pruning search paths if a mismatch is encountered.

• Consider using a Trie data structure for faster string matching.

• Handle edge cases like empty matrix or string, out of bounds indices, etc.
Answered by AI
Add your answer
Q2. What advantage does streams in Java8 has over for loops.
Ans. 
Streams in Java8 offer concise and readable code for processing collections compared to traditional for loops.
• Streams provide functional-style operations like map, filter, and reduce for easy data processing.

• Streams allow for parallel processing of data, potentially improving performance.

• Streams promote immutability and encourage writing more declarative code.

• Streams reduce boilerplate code and make the code more reada...read more
Answered by AI
Add your answer

Mental and Verbal aptitude - 1 hour

Q1. Basic C++, DSA questions
Add your answer

Question related to operating system and computer network

Q1. Traverse all child nodes in tree
Ans. 
Traverse all child nodes in a tree data structure
• Use depth-first or breadth-first traversal algorithms

• Recursively visit each child node starting from the root node

• Consider using a stack or queue data structure for traversal

• Example: Traverse all nodes in a binary tree
Answered by AI
Add your answer

Q1. Question related to cloud and oops
Add your answer

Q1. Question related to my background and how web site work
Add your answer

Q1. Basics of oops, .net framework and .net core
Add your answer
Q2. Sql query for student department id
Ans. 
SQL query to retrieve student department id.
• Use SELECT statement to retrieve data

• Specify the columns to be selected, including the department id column

• Specify the table where the student data is stored

• Use WHERE clause to filter the results based on student information
Answered by AI
Add your answer
Q3. Solid principles and design patterns
Add your answer

Q1. Asked to code palindrome
Add your answer
Q2. Code duplicate string from main string and get index of sub string
Ans. 
Code to find index of sub string in main string and duplicate the sub string
• Use a loop to iterate through the main string and check for the sub string

• If sub string is found, duplicate it and store the index

• Return the index of the duplicated sub string
Answered by AI
Add your answer

Q1. Manager asked me to code the count index of substring and sum of substring
Add your answer
Q2. Questions as HR informed, it was worst and all interviews were scheduled at night time.he was more technical than the second round team lead instead of asking manager round
Add your answer

Q1. Java springboot basic to intermediate question
Add your answer
Q2. Java stream questions
Add your answer

Q1. Easy level DSA questions
Add your answer
Q2. Project based questions
Add your answer