Upload Button Icon Add office photos

Theorem Incorporation

Compare button icon Compare button icon Compare

Filter interviews by

Theorem Incorporation Senior Web Developer Interview Questions and Answers

Updated 21 Oct 2021

Theorem Incorporation Senior Web Developer Interview Experiences

1 interview found

I applied via Company Website and was interviewed in Apr 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Technical questions regarding the role and responsibilities

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare yourself before take the interview

Interview questions from similar companies

Interview Questionnaire 

2 Questions

  • Q1. Core python
  • Q2. OOPS concept

Interview Questionnaire 

3 Questions

  • Q1. N a line where words are separated by spaces, , and capitalize first letter of the reversed word. Other letters of the word should be in small. Input : “how are you?” → Output: “Woh Era ?uoy”
  • Ans. 

    The program capitalizes the first letter of each reversed word in a sentence.

    • Split the sentence into an array of words using space as a delimiter.

    • Reverse each word in the array and capitalize the first letter.

    • Join the modified words back into a sentence.

  • Answered by AI
  • Q2. He second question reduced to finding maximum weight matching in a bipartite graph. Not many people would have done this (maybe none)
  • Q3. There are 2 sets of countries. One set will donate clothes (something of this sort) and anotherset will accept clothes. A country can be in only 1 of the sets. The amount of clothes donated is also given. ...

Interview Preparation Tips

Round: Test
Experience: There were about 20 MCQs (30 minutes) to be done after the coding section. MCQs were totally nonsense. Can be done in 10 mins.For coding section 60 mins.  It was hosted on Hackerrank.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: After this, selected candidates were interviewed that consists of 4 rounds and discussion was mostly on your CV and data structure problems.

General Tips: Be honest with your interviewer. If you are not comfortable in 1 topic, tell your interviewer honestly. Do well in other areas. Look for hints from the interviewer if you get stuck. They want to see how you approach a problem.
Skills: Algortihm, Data structure
College Name: IIT DELHI
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(4 Questions)

  • Q1. Basic JavaScript and React.js questions
  • Q2. Questions on functions, hooks and DOM
  • Q3. Questions on SSR
  • Q4. Questions on strings and arrays
Round 2 - Coding Test 

Api related questions

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2023. There were 4 interview rounds.

Round 1 - Coding Test 

It will be around 3 hours and 2 questions of leetcode hard difficulty will be asked in the interview and 1 question is of codeforces 2400+ difficulty question.

Round 2 - Technical 

(2 Questions)

  • Q1. 1-2 DSA medium-hard difficulty question will be asked.
  • Q2. CS fundamentals in depth had been asked in the ending of the interview.
Round 3 - Technical 

(1 Question)

  • Q1. System Design problem was asked.
Round 4 - HR 

(1 Question)

  • Q1. This is a cultural fit round. Common HR question was asked.

Interview Preparation Tips

Interview preparation tips for other job seekers - Competitive programmer at the minimum rank of codeforces specialist is must.In depth knowledge of CS fundamentals is required. Basic Understanding of system design concepts is must,with standard problems.

I appeared for an interview in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Easy

This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.

1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes

This Round was Conducted on Hackerrank (Webcam Enabled).

  • Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
  • Ans. 

    To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.

    • Understand the problem statement and expected output

    • Review the code for syntax errors, logical errors, and potential bugs

    • Use debugging tools like breakpoints, print statements, and IDE debuggers

    • Test the code with different inputs and edge cases to identify the bug

    • Make necessary corrections and re

  • Answered by AI
  • Q2. 

    Nodes at Distance K from Target Node in Binary Tree

    Given a Binary Tree of distinct integers and two integers, target and K, return a list of values of all nodes located at a distance K from the target no...

  • Ans. 

    Find nodes at distance K from target node in a Binary Tree.

    • Use BFS to traverse the tree and keep track of the distance of each node from the target node.

    • Maintain a set to keep track of visited nodes to avoid revisiting them.

    • Return the values of nodes at distance K from the target node.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

  • Q1. 

    Subarray Challenge: Largest Equal 0s and 1s

    Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.

    Input:

    Input beg...

  • Ans. 

    Find the length of the largest subarray with equal number of 0s and 1s in a given array.

    • Iterate through the array and maintain a count of 0s and 1s encountered so far.

    • Store the count difference in a hashmap with the index as key.

    • If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

    • Return the length of the longest subarray found.

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in MumbaiEligibility criteriaAbove 8 CGPAMedia.net interview preparation:Topics to prepare for the interview - DP, Greedy Techniques, Sorting Concepts, OS, DBMSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.

Application resume tips for other job seekers

Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Feb 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

The test was at 6 pm with cam on and in fullscreen mode.

  • Q1. 

    Interleaving Two Strings Problem Statement

    You are given three strings 'A', 'B', and 'C'. Determine if 'C' is formed by interleaving 'A' and 'B'.

    String 'C' is an interleaving of 'A' and 'B' if the lengt...

  • Ans. 

    The problem involves determining if a string 'C' is formed by interleaving two given strings 'A' and 'B'.

    • Check if the length of 'C' is equal to the sum of the lengths of 'A' and 'B'.

    • Verify if all characters of 'A' and 'B' exist in 'C' while maintaining their order.

    • Return 'True' if 'C' is an interleaving of 'A' and 'B', otherwise return 'False'.

  • Answered by AI
  • Q2. 

    Construct Binary Tree from Inorder and Postorder Traversal

    Given two lists representing the inorder and postorder traversal of a binary tree of integer type with 'N' nodes, construct the binary tree and r...

  • Ans. 

    Construct a binary tree from inorder and postorder traversal lists and return its root.

    • Create a map to store the indices of elements in the inorder traversal list for quick access during tree construction.

    • Use the postorder list to determine the root of the tree and recursively build left and right subtrees.

    • Construct the tree by recursively dividing the inorder list based on the root index in postorder list.

    • Return the r...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

At 10:00 AM. Interviewer was very friendly and young but his cam was off.

  • Q1. 

    Find Paths in Binary Tree

    Kevin has sketched a series of integers, forming a diagram that represents a binary tree. Challenged by a friend, Kevin needs to find all paths from the root to the leaf where th...

Round 3 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

It was held at 4 p.m. The interviewer was senior compared to the one in the previous round. Also, his cam was also on, but he wasn't speaking much and neither giving any expressions.

  • Q1. 

    Boxes of Power Problem Statement

    Given a set of boxes represented by an array gainPower, where each box has a certain power value, along with an initial power value 'power', your task is to maximize the t...

  • Ans. 

    Maximize total score by selecting boxes optimally based on power values and operations.

    • Iterate through the boxes and perform operations based on power values and current score

    • Keep track of power, score, and selected boxes to maximize total score

    • Example: For input [3, 50, [20, 30, 40]], select boxes with power 20 and 30 to get a score of 2

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in MumbaiEligibility criteriaNone except no active backlogsMedia.net interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DP, OOPS, Operating Systems, Computer NetworksTime required to prepare for the interview - 7 monthsInterview preparation tips for other job seekers

Tip 1 : DSA is the key. Starting from scratch, one can become proficients in a couple of months.
Tip 2 : Solve questions just a bit outside your comfort zone. Solve too easy to too hard questions is not of any use.
Tip 3 : Be consistent, make a habit of following good coding practices.
Tip 4 : Get to know the ins and out of your projects. You must be very confident while explaining those.
Tip 5 : Don't just directly to system-design, brush up on OOPS principles, networks, OS, DBMS before that.

Application resume tips for other job seekers

Tip 1 : Keep it crisp and to the point. Make bullet points.
Tip 2 : Bold the things you want to be paid attention to. Use numbers rather than vague sentences.
Tip 3 : Only put the things you are confident about.
Tip 4 : Don't put things irrelevant to the job, it only dilutes the main content.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Asked two array and string dsa questions of medium-hard level

Interview Preparation Tips

Topics to prepare for Media.net Software Services (India) Software Developer interview:
  • DSA
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Apr 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Prepare js array and string functions, and React js core concepts
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I appeared for an interview before Oct 2023.

Round 1 - Coding Test 

It was based on frontend technologies

Round 2 - One-on-one 

(1 Question)

  • Q1. Basic frontend question
Round 3 - One-on-one 

(1 Question)

  • Q1. Managerial round

Tell us how to improve this page.

Interview Questions from Similar Companies

R.R. Donnelley Interview Questions
3.9
 • 104 Interviews
Epsilon Interview Questions
3.9
 • 90 Interviews
Publicis Interview Questions
3.7
 • 52 Interviews
Regalix Interview Questions
2.9
 • 45 Interviews
Denave Interview Questions
3.6
 • 40 Interviews
Xdbs Interview Questions
3.2
 • 39 Interviews
Smollan Group Interview Questions
4.1
 • 36 Interviews
Groupm Media Interview Questions
3.9
 • 35 Interviews
View all
Theorem Incorporation Senior Web Developer Salary
based on 11 salaries
₹3.9 L/yr - ₹13 L/yr
At par with the average Senior Web Developer Salary in India
View more details

Theorem Incorporation Senior Web Developer Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

5.0

Skill development

4.0

Work-life balance

3.0

Salary

4.0

Job security

5.0

Company culture

3.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Campaign Specialist
147 salaries
unlock blur

₹2.5 L/yr - ₹6 L/yr

Client Service Analyst
139 salaries
unlock blur

₹1.7 L/yr - ₹4.5 L/yr

Campaign Manager
44 salaries
unlock blur

₹3.4 L/yr - ₹11.8 L/yr

Software Engineer
34 salaries
unlock blur

₹1.4 L/yr - ₹10.5 L/yr

Senior Campaign Specialist
28 salaries
unlock blur

₹4 L/yr - ₹9 L/yr

Explore more salaries
Compare Theorem Incorporation with

R.R. Donnelley

3.9
Compare

Epsilon

3.9
Compare

Denave

3.6
Compare

Smollan Group

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview