Tejas Network interview questions
Online test → Technical → HR·100% entry level
CS fundamentals
Showing 28 of 77 reported in this area
Differentiate between TCP and UDP.
Explain the Singleton design pattern
Explain thread synchronization in Java
Explain various CPU scheduling policies
Explain OSI layers and their applications
Explain polymorphism in C++ with examples.
What is a template class? Write an example.
Which protocol is used in Skype video calls?
Explain undefined behavior in C++ and give examples.
Implement hashCode() and equals() methods in a class.
Explain the Producer-Consumer problem and its solution
Implement the Producer-Consumer problem using threads.
Explain ConcurrentHashMap and how it differs from HashMap
Explain arrays and pointers in C and how they are related
Explain deadlock in operating systems and its conditions.
Explain memory management techniques in operating systems
How do you find the last 5 words in a file using a command?
What happens when two threads modify an ArrayList concurrently?
Implement a Set and sort an Employee class based on ID and Name.
Explain the different protocols used at each layer of the OSI model
Explain dynamic memory allocation in C (malloc, calloc, realloc, free)
Explain the implementation and contract of equals() and hashCode() methods
Explain interprocess communication and interthread communication mechanisms
Explain the Producer-Consumer problem and how it is handled using multithreading.
If hashCode() always returns 1 for two objects of the same class, are the objects equal?
Explain the significance of C keywords such as virtual, enum, structures, unions, pointers, and array vs pointer differences
Explain thread concepts in operating systems
On which CPU core is a given thread running and how can you find it?
DSA
Showing 28 of 65 reported in this area
Connect N ropes with minimum cost.
Implement a queue using only one stack.
Implement Quick Sort using a linked list
Rotate a 2D image (matrix) by 90 degrees
Rotate a matrix by 90 degrees clockwise.
Print all boundary elements of a binary tree
Add two numbers represented as a Linked List.
Rotate a matrix by 270 degrees anticlockwise.
Delete the middle node of a singly linked list
Rotate a given square matrix by 90 degrees clockwise.
Make the middle node of a singly linked list the new head
Print all permutations of a given string (example: "TJS")
Recursively delete consecutive duplicate characters in a string
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree
Calculate the sum of all elements of all possible subarrays of a given array.
Remove a character from a string such that the resulting string is a palindrome
Add two numbers represented as linked lists and return the sum as a linked list.
Find the first non-repeated character in a string with optimized time complexity.
Generate a non-repeating sorted list from two unsorted lists containing duplicates
Find the maximum path sum in a matrix from the top-left corner to the bottom-right corner.
Implement a doubly linked list from scratch and print all pairs of nodes whose values sum to k.
Given an array {1,2,3,4,5}, find the number of triplets (a, b, c) such that a^2 + b^2 = c^2 in O(n^2) time.
Design a data structure to continuously maintain the top 100 highest numbers from an infinite stream of integers.
Given a sorted array, rearrange it in minimum-maximum order without using extra O(n) memory and with minimum time complexity
A rabbit starts at the top-left of a matrix and must reach the bottom-right while maximizing the total carrots collected. Find the maximum carrots that can be collected.
Perform operations on a number based on whether it is odd or even to reduce it to 4, count odd and even numbers encountered, and return the simplified ratio of odd:even.
Copy a linked list with an arbitrary (random) pointer.
Find the sum of squares of all subsets of a given array.
Aptitude
Showing 3 of 6 reported in this area
Solve aptitude questions involving tricky quantitative and logical reasoning problems
Aptitude questions involving logical reasoning and quantitative problem solving under time constraints
Quantitative aptitude problems (no specific problem mentioned)
asked oncePractice this →
System design
1 questions reported in this area
Design a Chess Board class.
Showing 60 of 124 questions. Ranked by how often the same question came back across reports.
Practise a Tejas Network-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Tejas Network ask?
Candidate interview reports most often cover CS fundamentals (52%) and DSA (44%).
How many rounds does Tejas Network interview have?
Candidate interview reports show an average of 3.2 rounds per experience, with a typical sequence of Online test → Technical → HR. Individual interview paths can vary.
Is the Tejas Network interview hard?
Among questions with a reported difficulty, the mix is easy 50%, medium 44%, hard 5%.