Tejas Networks Interview Experience for Research and Development Engineer | On Campus
Question Details
Hello everyone! I'm excited to share my complete interview experience with Tejas Networks, covering everything from the online test to the final selection. This was an on-...
Full Details
Hello everyone! I'm excited to share my complete interview experience with Tejas Networks, covering everything from the online test to the final selection. This was an on-campus recruitment drive held at LNCT Bhopal. (A brief overview is provided below.) Tejas Networks is an Indian telecom equipment company that designs and develops high-performance networking products used by telecom operators, internet service providers, and government networks. Known for its innovation and strong R&D, Tejas plays a key role in building India's digital infrastructure. This opportunity was exclusively for on-campus students and was conducted as a pool campus drive at LNCT Bhopal. To receive an interview call, students had to be shortlisted based on their academic performance and Online Test rounds. There were a total of four rounds , and each was an elimination round: Online Test (Aptitude and DSA Online Test - on campus ( Aptitude and DSA ) Technical Interview HR Interview Each round filters candidates based on performance to select the most suitable ones.
Round 1 CoCubes Online Assessment This was an online round consisting of two sections: ● Section 1: Aptitude + Verbal Ability The time for this section was 45 minutes. In this section 15 questions were asked from English (Easy to Moderate), 15 questions from Analytical Aptitude (Moderate), and finally 15 questions from Quantitative Aptitude (Moderate).
Note: ● It is possible to change between the three parts at any time. ● The Section automatically submits after 45 minutes. ● Online Proctoring is present, camera and mic permissions are required ● Section 2: Coding (C, C++, Java, etc. programming languages available) The time for this section was 45 minutes. Three coding questions were asked, with 2 fundamental questions (Very Easy), and one medium level question. Que1. Determine the point with the minimum distance from origin. (Easy) Que2. Calculate work given force and distance, and return minimum work. (Easy) Que3. Add two numbers represented as a LinkedList. (Medium)
Note: ● Questions can be solved in any order. ● The Section automatically submits after 45 minutes. ● Online Proctoring is present, camera and mic permissions are required.
Note: Round 1 is an elimination round and both sections are mandatory. Time for Section 1 and 2 is separate, but Section 1 has to be completed first before moving to Section 2. Tip: Focus more on time management in Section 1 because 30 questions are to be solved in 30 minutes. The Coding section is easy, and enough time is there.
Round 2 HirePro Online Assessment (On Campus) This was an on campus round consisting of three sections, and each section must be completed before moving to the next round: ● Section 1: Aptitude The time for this section was 15 minutes. Total 10 MCQ questions were asked from: ● Ratio and Proportions ● Time and Work ● Mixture and Alligation ● LCM and HCF, etc. ● Section 2: CS Fundamentals The time for this section was 25 minutes. A total of 15 MCQ questions were asked in this section focusing on: ● Computer Networks ● Data Structures including Tree ● C programming questions ● Pseudocodes based questions ● Section 3: Coding (C++ only) The time for this section was 60 minutes. Again three coding questions were asked ranging from moderate to hard difficulty. Question related to performing some operations on a number depending upon whether it is odd or even and reducing it to the number '4', while counting the number of odd and even numbers encountered at each step. The final answer is the ratio of odd\:even encountered (The ratio must be in simplified form if not then reduce it). (Hint: GCD) (Moderate) A string based question involving shifting each character in the string by 2 positions, in a cyclic fashion. (Easy) A rabbit is sitting at the top left corner of a matrix, and has to reach the bottom right corner. Each position in the matrix has a certain amount of carrots. The aim of the rabbit is to choose a path that maximises the amount of carrots gained. (Hint: Dynamic Programming) (Moderate)
Note: ● Questions can be solved in any order. ● Try to solve all three questions to progress further.
Note: ● Round 2 is also an elimination round. ● The sections have separate times, and it is not possible to change sections. ● Each section must be completed before moving to the next section.
Round 3 Technical Interview (On Campus) A purely technical Interview focusing on core subjects including Operating Systems, Computer Networks, Data Structures. Resume based questions were also asked. The questions include: ● Introduce yourself ● Resume Projects (Overview) Questions based on C/C++ programming: ● Structs ● Namespaces ● Typedef ● Undefined behavior in C++ ● Segmentation fault ● Templates ● Polymorphism (Depth) ● Friend function, virtual function, etc Questions based on Data Structures: ● Based on Recursion ● Based on Tree ● Based on LinkedList ● Based on Dynamic Programming Questions from Computer Networks: ● Ipconfig and ifconfig command ● About network devices ● OSI and TCP/IP Model ● TCP and UDP ● VLANs Questions from Operating Systems: ● Threads and Processes ● Context Switching ● Synchronization ● Deadlock ● Virtual Memory ● Scheduling Algorithms Programming questions, to be coded in C/C++ only: ● Rotate a matrix 90 degrees clockwise. ● Sum of squares of all Subsets of given Array. ● Multiply a number by 2 without using a multiplication operator. (Easy) The focus was on optimizing the solutions, and trying all alternate approaches of solving the problem.
Note: ● The interview length varies for each candidate, but each interview lasted about 40-45 minutes, some extending further. ● Try to be confident even if you don't know the answer to each and every question. ● Prepare the things written on your resume very well.
Round 4 HR Interview (On Campus) This was the final round, which lasted about 5-10 minutes. The HR asked general questions including: Tell me about yourself. Questions about hobbies, other than technicals mentioned in the resume. Why do you want to join Tejas Networks? Why did you choose this college? Are you willing to relocate? Are you comfortable with any of the locations? (Bangalore/Chennai/Mumbai/Gurugram) Important Notes : The company requires individuals proficient in C/C++ programming only. Focus your resume more toward C/C++. Round 2, 3, and 4 were conducted on the same day on campus. Each round is an elimination round. The overall difficulty level of each round is Easy to Moderate.
About This Question
This is a reported interview question from a tejas network interview for a data science role during the oa round reported in 2025.
It covers the following topics: Linked List, Trees, Strings, Dynamic Programming, Sql, Networking, Recursion, Os, Math, Arrays, Matrix .
Difficulty rating: Easy
More Tejas Network Interview Questions
About Tejas Network Interview Reports
This question was reported by a candidate who interviewed at Tejas Network. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Tejas Network are the higher-signal extractions to take from this report.
For broader preparation context, the Tejas Network interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Tejas Network reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Tejas Network Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Tejas Network reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.