TELUS Digital Software Developer Intern Interview Questions and Answers

Basic aptitude,math, english, communication, logic the test lasted for 1.5hours and was an online proctured test.

2 coding questions with language flexibility

Q1. Question about data structure
Add your answer
Q2. Question about dbms, computer networks, projects
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Counting Even and Odd Occurrences
You are provided with an array or list of integers named ARR of size N. The task is to determine two things:
1. How many elements appear an odd number of times?
2. How many...read more
Ans. 
Count the number of elements with odd and even occurrences in an array of integers.
• Iterate through the array and use a hashmap to store the count of each element.

• After counting, iterate through the hashmap to determine odd and even occurrences.

• Return the counts of elements with odd and even occurrences.
Answered by AI
Add your answer
Q2. 
Delete Nodes with Greater Values On Right
You are given a singly linked list where each node contains an integer value and a reference to the next node or NULL if it is the last node. The task is to remov...read more
Ans. 
Remove nodes in a singly linked list with a greater value on the right.
• Traverse the linked list and compare each node's value with the values of nodes to its right.

• If a node has a greater value on the right, remove it from the linked list.

• Update the references of the previous node to skip the removed node.
Answered by AI
Add your answer

There were 2 coding que on hakerrank

Q1. Tell me about yourself ?
Add your answer
Q2. OOPS concept based with java
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It is from 12 to 1:30 pm. Environment was very friendly and interviewer was very nice.

Q1. 
Nth Term of Geometric Progression Problem
Given the first term A, the common ratio R, and an integer N, your task is to find the Nth term of a geometric progression (GP) series.
Explanation:
The general...read more
Ans. 
Calculate the Nth term of a geometric progression series modulo 10^9 + 7.
• Use the formula A * R^(N-1) to find the Nth term of the GP series.

• Remember to calculate the result modulo 10^9 + 7.

• Handle multiple test cases efficiently to stay within the time limit.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Very friendly environment 

Leetcode medium questions was asked on hackerrank

Q1. What is database, system design
Ans. 
A database is a structured collection of data, while system design involves creating a plan for how different components of a system will work together.
• Database is used to store and organize data in a structured manner.

• System design involves creating a plan for how different components of a system will interact and work together efficiently.

• Examples of databases include MySQL, PostgreSQL, and MongoDB.

• Examples of system...read more
Answered by AI
Add your answer
Q2. Standard leetcode questions + hashmaps + projects
Add your answer

Write a code for prime number

Q1. What is difference between mapping and filter
Add your answer
Q2. What is time complexity
Add your answer

Q1. Conduct a phone or video interview
Add your answer
Q2. Consider how candidates may work in your team
Add your answer
Q3. Conduct a more in depth interview
Add your answer
Q4. Assign a remote coding assessment
Ans. 
Assign a remote coding assessment
• Clearly define the problem statement and requirements

• Provide a set of input/output examples for testing

• Specify the programming language and any constraints

• Set a time limit for completion

• Include instructions for submission and evaluation
Answered by AI
Add your answer
Q5. Request previous work samples
Add your answer

The task of Assignment