Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by JC Software Solutions Team. If you also belong to the team, you can get access from here

JC Software Solutions Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

JC Software Solutions Angular JS Developer Interview Questions and Answers

Be the first one to contribute and help others!

Interview questions from similar companies

I appeared for an interview in Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 40 minutes
Round difficulty - Easy

  • Q1. 

    Count Subsequences Problem Statement

    Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.

    Explanation:

    A subsequence of an array i...

  • Ans. 

    Count the total number of subsequences in which all elements are equal in an integer array.

    • Iterate through the array and count the frequency of each element.

    • Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1) / 2).

    • Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNoWipro Limited interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Do practice as much as you can
Tip 2 : Coding is key to crack

Application resume tips for other job seekers

Tip 1 : It should look nice
Tip 2 : Skills should be mentioned properly

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. Mathematical ,verbal, logical, puzzles, pseudo code
  • Q2. Verbal
  • Q3. Logical

Interview Preparation Tips

Interview preparation tips for other job seekers - Help me for infosys apptitude test interview

I applied via Campus Placement and was interviewed in Oct 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Tell me about yourself

Interview Preparation Tips

Interview preparation tips for other job seekers - Explore your self , add studies,hobbies,short term and long term goals.keep it short and simple.

Interview Questionnaire 

2 Questions

  • Q1. What is software configuration management?
  • Ans. 

    Software configuration management is the process of tracking and controlling changes made to software throughout its lifecycle.

    • It involves version control, build management, and release management.

    • It ensures that changes are made in a controlled and systematic manner.

    • Examples include Git, SVN, and Jenkins.

    • It helps to maintain the integrity and quality of the software.

    • It is essential for collaboration among team members...

  • Answered by AI
  • Q2. What are software requirements?
  • Ans. 

    Software requirements are the functional and non-functional specifications that a software system must meet.

    • Software requirements define what the software should do and how it should behave

    • They include functional requirements (what the software should do) and non-functional requirements (how well it should do it)

    • Requirements are typically documented in a requirements specification document

    • They are used to guide the dev...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - 👉 First of all you have a good communication skills,Technical skills
👉 Be Confidential and be prepared
👉 Review common interview questions
👉 And finally End the interview with a good impression

I appeared for an interview in Nov 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 2 hours
Round difficulty - Medium

In the 1st round 
Aptitude
Reasoning
English
Automata fix( code debug) 
Timing in morning
Environment is good
Interviewer was very cool and interactive

  • Q1. 

    Encode the Message Problem Statement

    Given a text message, your task is to return the Run-length Encoding of the given message.

    Run-length encoding is a fast and simple method of encoding strings, repres...

  • Ans. 

    Implement a function to encode a text message using run-length encoding.

    • Iterate through the message and count consecutive characters

    • Append the character and its count to the encoded message

    • Handle edge cases like single characters or empty message

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

This is interview round 
Ques from basic electronics
C language

  • Q1. 

    Print Name and Age Problem Statement

    Create a class named Person with a string variable 'name' and an integer variable 'age', such that these variables are not accessible outside the class. Implement a me...

  • Ans. 

    Create a class Person with private variables name and age, and methods to set and get their values.

    • Create a class Person with private variables 'name' and 'age'.

    • Implement a method setValue to set the variables' values.

    • Implement a method getValue to print the variables' values.

    • Ensure the name is a non-empty string and the age is a non-negative integer.

    • Encapsulate the data and provide a clear interface for setting and ge...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 6 cgpaCognizant interview preparation:Topics to prepare for the interview - Electronics basics, C language , Data structure, OOPS, ProjectsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Do aptitude from indiabix. Go through your basics. At least one language u know. Learn about your branch basics. Know concept of data structure and oops. 
Tip 2 : prepare your final project well. 

Application resume tips for other job seekers

Tip 1 : the skills you know very well mention in resume
Tip 2 : mention project in resume

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. They asked me on java and I have joined as a fresher they not much questions as I got selected as fresher on oops concepts and collections
  • Q2. Please be confident while facing interview and they will check your communication skills

Interview Questionnaire 

1 Question

  • Q1. Based on programming

Interview Questionnaire 

2 Questions

  • Q1. Hibernate,Java 7,Multithreading
  • Q2. Prepare well on the above topics
Round 1 - Aptitude Test 

HTML

Round 2 - Aptitude Test 

Aptitude and resume shortlist and HTML

Round 3 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips

Interview Preparation Tips

Interview preparation tips for other job seekers - No tips

I appeared for an interview before Jun 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

  • Q1. 

    Find All Pairs Adding Up to Target

    Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.

    Input:

    The first line ...
  • Ans. 

    Given an array of integers and a target, find all pairs of elements that add up to the target.

    • Iterate through the array and for each element, check if the target minus the element exists in a hash set.

    • If it exists, add the pair to the result. If not, add the element to the hash set.

    • Handle cases where the same element is used twice in a pair.

    • Return (-1, -1) if no pair is found.

  • Answered by AI
  • Q2. 

    Clone a Linked List with Random Pointers

    Given a linked list where each node contains two pointers: one pointing to the next node and another random pointer that can point to any node within the list (or ...

  • Ans. 

    Create a deep copy of a linked list with random pointers.

    • Iterate through the original linked list and create a new node for each node in the list.

    • Store the mapping of original nodes to new nodes in a hashmap to handle random pointers.

    • Update the random pointers of new nodes based on the mapping stored in the hashmap.

    • Return the head of the copied linked list.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Unique Element in Array

    Given an arbitrary array arr consisting of N non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...

  • Ans. 

    Find the element that appears only once in an array where every other element appears thrice.

    • Use bitwise operations like XOR to find the unique element in linear time complexity.

    • XOR all elements in the array, the result will be the unique element.

    • Elements that appear thrice will cancel out each other in XOR operation.

    • Example: arr = [2, 2, 3, 2], XOR of all elements = 3 which is the unique element.

  • Answered by AI
  • Q2. 

    Next Greater Element Problem Statement

    You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.

    T...

  • Ans. 

    Find the Next Greater Element for each element in an array.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements with no greater element to the right

    • Pop elements from the stack until a greater element is found or stack is empty

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Convert BST to Greater Sum Tree

    Given a Binary Search Tree (BST) of integers, your task is to convert it into a greater sum tree. In the greater sum tree, each node's value should be replaced with the sum...

  • Ans. 

    Convert a Binary Search Tree into a Greater Sum Tree by replacing each node's value with the sum of all nodes' values greater than the current node's value.

    • Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.

    • Keep track of the running sum of visited nodes' values and update each node's value with this sum.

    • Recursively apply the above steps to all nodes in the BST.

    • Example: For input ...

  • Answered by AI
  • Q2. 

    Sort Linked List Problem Statement

    You are given a linked list of N nodes where each node contains values 0, 1, and 2 exclusively. Your task is to sort the linked list.

    Input:

    The first line contains an...
  • Ans. 

    Sort a linked list containing values 0, 1, and 2 exclusively.

    • Use three pointers to keep track of nodes with values 0, 1, and 2 separately.

    • Traverse the linked list and move nodes to their respective positions based on their values.

    • Finally, concatenate the three lists in the order 0 -> 1 -> 2 to get the sorted linked list.

  • Answered by AI
Round 4 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider edge cases like when the matrix is empty or when all cells are water (0s).

  • Answered by AI
  • Q2. 

    Maximum Path Sum in a Matrix

    Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...

  • Ans. 

    Find the maximum sum that can be obtained from a path in a matrix from the first row to the last row.

    • Use dynamic programming to keep track of the maximum sum at each cell.

    • Consider moving down, down-left, and down-right to calculate the maximum sum.

    • Start from the second row and update the values based on the maximum sum from the row above.

    • At the end, find the maximum sum in the last row to get the final result.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria> 7 CGPAAmazon interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, OS, Networks, GraphsTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 - Practice variety of questions
Tip 2 - Do atleast 2 projects

Application resume tips for other job seekers

Tip 1 : Do good projects
Tip 2 : resume should be one page

Final outcome of the interviewSelected

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

TCS Interview Questions
3.6
 • 11.1k Interviews
Accenture Interview Questions
3.7
 • 8.7k Interviews
Infosys Interview Questions
3.6
 • 7.9k Interviews
Wipro Interview Questions
3.7
 • 6.1k Interviews
Cognizant Interview Questions
3.7
 • 5.9k Interviews
Amazon Interview Questions
4.0
 • 5.4k Interviews
Capgemini Interview Questions
3.7
 • 5.1k Interviews
Tech Mahindra Interview Questions
3.5
 • 4.1k Interviews
HCLTech Interview Questions
3.5
 • 4.1k Interviews
Genpact Interview Questions
3.7
 • 3.4k Interviews
View all
Mean Stack Developer
4 salaries
unlock blur

₹3 L/yr - ₹6 L/yr

Angular Developer
4 salaries
unlock blur

₹2 L/yr - ₹4.3 L/yr

Node JS Developer
4 salaries
unlock blur

₹3 L/yr - ₹3.6 L/yr

React Native Developer
4 salaries
unlock blur

₹2.8 L/yr - ₹7.2 L/yr

Explore more salaries
Compare JC Software Solutions with

TCS

3.6
Compare

Accenture

3.7
Compare

Wipro

3.7
Compare

Cognizant

3.7
Compare
write
Share an Interview