Upload Button Icon Add office photos
Engaged Employer

i

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

Icertis Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Icertis Legal Process Associate Interview Questions and Answers

Updated 15 Jan 2025

Icertis Legal Process Associate Interview Experiences

1 interview found

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

I applied via Naukri.com and was interviewed before Jan 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. What is evergreen clause
  • Ans. 

    An evergreen clause is a contract provision that automatically renews the agreement at the end of the term unless one party gives notice to terminate.

    • Automatically renews the contract at the end of the term

    • Requires one party to give notice to terminate

    • Common in subscription services and rental agreements

  • Answered by AI
  • Q2. What is contract
  • Ans. 

    A contract is a legally binding agreement between two or more parties.

    • A contract must have an offer, acceptance, consideration, legal capacity, and legal purpose.

    • Contracts can be written or oral, but written contracts are generally more enforceable.

    • Examples of contracts include rental agreements, employment contracts, and sales contracts.

  • Answered by AI
Round 2 - HR 

(2 Questions)

  • Q1. Tell me about yourself
  • Ans. 

    I am a detail-oriented individual with a background in legal studies and a strong passion for the legal field.

    • Graduated with a degree in Law from XYZ University

    • Completed internships at law firms to gain practical experience

    • Proficient in legal research and writing

    • Strong analytical and problem-solving skills

    • Excellent communication and interpersonal abilities

  • Answered by AI
  • Q2. What was your role in your previous organisation
  • Ans. 

    I was responsible for managing legal documentation and assisting with legal research in my previous organization.

    • Managed legal documentation for cases

    • Assisted with legal research for ongoing projects

    • Collaborated with attorneys to prepare for trials

    • Reviewed and analyzed contracts and agreements

  • Answered by AI

Interview questions from similar companies

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

I applied via Walk-in and was interviewed before Dec 2023. There was 1 interview round.

Round 1 - Assignment 

Essay writing to check english.

Interview Preparation Tips

Interview preparation tips for other job seekers - Good co with job security.
Interview experience
2
Poor
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Jul 2023. There was 1 interview round.

Round 1 - Assignment 

Easy assignment with basic questions on patent

Interview Preparation Tips

Round: Interview
Experience: They asked to write 2 codes on recursion. Then some questions on resume. I asked them about the job profile and after knowing that they were hiring candidates for frontend programming, about which they didn’t mention in JAF. I told them that I was not interested in frontend development. And didn’t even answer any question after that. Unfortunately, I was selected.

General Tips: Plan your schedule judiciously keeping your capacity in mind. There is no point of making ideal plans and then not able to do even 50% of it.
Don’t get into unnecessary arguments or debate with people.
Don’t think about what others are doing. Focus on your preparation.
How you carry yourself matters. So, make sure you portray yourself in the way you want the other person to perceive you.
Be selective while applying for companies.
College Name: IIT Kanpur

I applied via Naukri.com and was interviewed in Nov 2019. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Tell us about yourself and your last job?
  • Ans. 

    I have a diverse background in sales and customer service. In my last job, I worked as a Sales Associate at a retail store.

    • Worked as a Sales Associate at a retail store

    • Assisted customers in finding products and making purchases

    • Handled cash transactions and operated the cash register

    • Maintained a clean and organized sales floor

    • Provided excellent customer service and resolved any issues or complaints

  • Answered by AI
  • Q2. What particular achievements have you had?
  • Ans. 

    I have achieved several milestones in my career, including increasing sales by 20% and receiving a promotion to team lead.

    • Increased sales by 20% through strategic marketing campaigns

    • Received a promotion to team lead for consistently exceeding targets

    • Implemented a new customer service system resulting in improved customer satisfaction ratings

  • Answered by AI
  • Q3. Do an assignment on a competition analysis for our client?
  • Ans. 

    Competition analysis assignment for a client

    • Identify direct and indirect competitors

    • Analyze competitors' products, pricing, and marketing strategies

    • Evaluate competitors' strengths and weaknesses

    • Assess market share and growth potential

    • Identify opportunities and threats in the competitive landscape

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - 1) If you don't understand a question, ask the interviewer in you own words.
2) Be prepared for multiple rounds of interview but don't panic. The same questions will be asked in each stage, so you will by and large have the same answer, you may have to talk about specific things that each interviewer may ask. But all in all about you and your experience.
3) Always wait for them to make you an offer for salary.
4) When HR makes you an offer. Be prepared that it will not be what you want.
- Just remember that they have a script of questions they will ask, if you answer them then they will think you can be hired at their decided CTC for you. But if you list out more points they can add to their list then they will also have to increase your salary. For example, you will have to spend a certain percentage of your salary on travelling and rent, and need to save more. List out additional online courses you have done that the average candidate has not. Point out to them that you were nominated for an award in your last job. These things count.
5) If you don't know the answer to a question of their's. Then say you don't know. But always, let them know you think you could learn it.
6) Recruiters know you can't know everything, and they don't expect you to. They also want to judge you on honesty, and how you respond to pressure.
7) JUST BREATHE. It will go far better than you planned. All the best!!!!
Interview experience
4
Good
Difficulty level
Hard
Process Duration
6-8 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Case Study 

Chargeback rights and case study

Round 2 - Case Study 

Chargeback case study

Round 3 - Chargeback Dispute  

(1 Question)

  • Q1. Normal questionnaire and case study

Interview Preparation Tips

Interview preparation tips for other job seekers - Chargeback dispute work flow

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

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

Interview Questionnaire 

1 Question

  • Q1. Sql based quedtion

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare continuously don't lose hope

I applied via Company Website and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. C c++ javascript HTML Java
  • Q2. What sir or mum required Is

Interview Preparation Tips

Interview preparation tips for other job seekers - My name is Saurabh Saxena
I live in nadaiya rampur Post govindpur tilhar shahjahanpur Uttar Pradesh
I have a complete graduation BCA

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

Interview Questionnaire 

1 Question

  • Q1. All were technical. Just keep practicing data structures and Algorithms and have good knowledge of the language you're good at.

Interview Preparation Tips

Interview preparation tips for other job seekers - Hey Folks
Just never get discouraged by your failures. Keep working hard and be consistent in your efforts. You will surely achieve what you deserve.

Icertis Interview FAQs

How many rounds are there in Icertis Legal Process Associate interview?
Icertis interview process usually has 2 rounds. The most common rounds in the Icertis interview process are Technical and HR.
What are the top questions asked in Icertis Legal Process Associate interview?

Some of the top questions asked at the Icertis Legal Process Associate interview -

  1. what is evergreen cla...read more
  2. what is contr...read more

Tell us how to improve this page.

Icertis Legal Process Associate Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Chetu Interview Questions
3.3
 • 174 Interviews
AVASOFT Interview Questions
3.6
 • 162 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Thomson Reuters Interview Questions
4.1
 • 113 Interviews
Amadeus Interview Questions
3.9
 • 107 Interviews
EbixCash Limited Interview Questions
4.0
 • 102 Interviews
UKG Interview Questions
3.1
 • 101 Interviews
SPRINKLR Interview Questions
3.0
 • 100 Interviews
View all
Functional Consultant
279 salaries
unlock blur

₹4.8 L/yr - ₹18 L/yr

Senior Functional Consultant
244 salaries
unlock blur

₹9 L/yr - ₹23 L/yr

Software Engineer
227 salaries
unlock blur

₹4.5 L/yr - ₹15 L/yr

Senior Software Engineer
224 salaries
unlock blur

₹9.9 L/yr - ₹23.9 L/yr

Lead Software Engineer
164 salaries
unlock blur

₹14 L/yr - ₹32 L/yr

Explore more salaries
Compare Icertis with

Apttus

4.4
Compare

Thomson Reuters

4.1
Compare

Oracle Cerner

3.7
Compare

Chetu

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