25 |
46 |
47 |
11 |
13 |
22 | Welcome to LTI
12 |
23 |
50 |
51 |
52 |
53 |
56 |
57 |
--------------------------------------------------------------------------------
/UserMangementApp/src/main/webapp/register.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
24 |
48 |
49 |
12 |
14 |
23 | Welcome to LTI
13 |
24 |
52 |
53 |
54 |
57 |
58 |
--------------------------------------------------------------------------------
/Leet-Code-Arrays/src/DeleteDuplicateinSortedArray.java:
--------------------------------------------------------------------------------
1 | /*Given a sorted array, remove the duplicates such that each element appears only once.
2 |
3 | Input: array = [1, 1, 2]
4 | Output: [1, 2]
5 | Input: array = [0, 0, 1, 1, 1, 2, 2, 3, 3, 4]
6 | Output: [0, 1, 2, 3, 4]
7 | * */
8 | public class DeleteDuplicateinSortedArray {
9 | public int removeDuplicates(int[] nums) {
10 |
11 | // The initial length is simply the capacity.
12 | int length = nums.length;
13 |
14 | // Assume the last element is always unique.
15 | // Then for each element, delete it iff it is
16 | // the same as the one after it. Use our deletion
17 | // algorithm for deleting from any index.
18 | for (int i = length - 2; i >= 0; i--) {
19 | if (nums[i] == nums[i + 1]) {
20 | // Delete the element at index i, using our standard
21 | // deletion algorithm we learned.
22 | for (int j = i + 1; j < length; j++) {
23 | nums[j - 1] = nums[j];
24 | }
25 | // Reduce the length by 1.
26 | length--;
27 | }
28 | }
29 | // Return the new length.
30 | return length;
31 | }
32 | public int[] copyWithRemovedDuplicates(int[] nums) {
33 |
34 | // Check for edge cases.
35 | if (nums == null || nums.length == 0) {
36 | return nums;
37 | }
38 |
39 | // Count how many unique elements are in the Array.
40 | int uniqueNumbers = 0;
41 | for (int i = 0; i < nums.length; i++) {
42 | // An element should be counted as unique if it's the first
43 | // element in the Array, or is different to the one before it.
44 | if (i == 0 || nums[i] != nums[i - 1]) {
45 | uniqueNumbers++;
46 | }
47 | }
48 |
49 | // Create a result Array.
50 | int[] result = new int[uniqueNumbers];
51 |
52 | // Write the unique elements into the result Array.
53 | int positionInResult = 0;
54 | for (int i = 0; i < nums.length; i++) {
55 | // Same condition as in the previous loop. Except this time, we can write
56 | // each unique number into the result Array instead of just counting them.
57 | if (i == 0 || nums[i] != nums[i - 1]) {
58 | result[positionInResult] = nums[i];
59 | positionInResult++;
60 | }
61 | }
62 | return result;
63 | }
64 | }
65 |
--------------------------------------------------------------------------------
/hackerRank/src/com/week3/IsAnagram.java:
--------------------------------------------------------------------------------
1 | package com.week3;
2 |
3 | import java.util.Arrays;
4 | import java.util.HashMap;
5 | import java.util.Map;
6 | import java.util.Scanner;
7 |
8 | public class IsAnagram {
9 | static boolean isAnagram(String a, String b) {
10 |
11 | // test for invalid input
12 | if( a == null || b == null || a.equals("") || b.equals("") )
13 | throw new IllegalArgumentException();
14 |
15 | // initial quick test for non-anagrams
16 | if ( a.length() != b.length() )
17 | return false;
18 |
19 | a = a.toLowerCase();
20 | b = b.toLowerCase();
21 |
22 | // populate a map with letters and frequencies of String b
23 | Map
25 |
51 |
26 |
50 | Register to explore amazing career opportunities
27 | 28 | 49 |
16 |
18 |
27 | Welcome to LTI
17 |28 | 29 |
30 |
73 |
76 |
77 |
78 |
79 |
--------------------------------------------------------------------------------
/Leet-Code/src/Week_04/LongestCommonSubSequence.java:
--------------------------------------------------------------------------------
1 | package Week_04;
2 | /*Longest Common Subsequence
3 |
4 | Solution
5 | Given two strings text1 and text2, return the length of their longest common subsequence.
6 |
7 | A subsequence of a string is a new string generated from the original string with some characters(can be none) deleted without changing the relative order of the remaining characters. (eg, "ace" is a subsequence of "abcde" while "aec" is not). A common subsequence of two strings is a subsequence that is common to both strings.
8 |
9 |
10 |
11 | If there is no common subsequence, return 0.
12 |
13 |
14 |
15 | Example 1:
16 |
17 | Input: text1 = "abcde", text2 = "ace"
18 | Output: 3
19 | Explanation: The longest common subsequence is "ace" and its length is 3.
20 | Example 2:
21 |
22 | Input: text1 = "abc", text2 = "abc"
23 | Output: 3
24 | Explanation: The longest common subsequence is "abc" and its length is 3.
25 | Example 3:
26 |
27 | Input: text1 = "abc", text2 = "def"
28 | Output: 0
29 | Explanation: There is no such common subsequence, so the result is 0.
30 |
31 |
32 | Constraints:
33 |
34 | 1 <= text1.length <= 1000
35 | 1 <= text2.length <= 1000
36 | The input strings consist of lowercase English characters only.
37 | * */
38 | public class LongestCommonSubSequence {
39 | public static int longestCommonSubsequence(String text1, String text2) {
40 |
41 | int[][] dp = new int[text1.length()+1][text2.length()+1];
42 | for(int i = 0; i
31 |
72 |
32 |
34 |
38 |
39 |
40 |
70 |
71 | List Of Users!
33 |34 |
35 | Add New User
36 |
37 | 38 |
| ID | 42 |Name | 43 |password | 44 |City | 46 |Mobile | 47 |Actions | 48 ||
|---|---|---|---|---|---|---|
| Edit 62 | Delete | 64 |
16 |
18 |
27 | Welcome to LTI
17 |28 | 29 |
30 |
64 |
67 |
68 |
--------------------------------------------------------------------------------
/UserMangementApp/src/main/webapp/index.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
31 |
63 |
32 |
34 | 61 |
62 | Update/Edit User Page!
33 |34 | 61 |
11 |
13 |
14 |
23 |
24 | Welcome to LTI
12 |
25 |
68 |
69 |
72 |
73 |
--------------------------------------------------------------------------------
/Leet-Code/src/Week_04/LRUCache.java:
--------------------------------------------------------------------------------
1 | package Week_04;
2 | /*
3 | * LRU Cache
4 |
5 | Solution
6 | Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.
7 |
8 | get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
9 | put(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.
10 |
11 | The cache is initialized with a positive capacity.
12 |
13 | Follow up:
14 | Could you do both operations in O(1) time complexity?
15 |
16 | //Example:
17 | //
18 | //LRUCache cache = new LRUCache( 2 /* capacity )
19 | //
20 | ////cache.put(1, 1);
21 | ////cache.put(2, 2);
22 | ////cache.get(1); // returns 1
23 | ////cache.put(3, 3); // evicts key 2
24 | ////cache.get(2); // returns -1 (not found)
25 | ////cache.put(4, 4); // evicts key 1
26 | ////cache.get(1); // returns -1 (not found)
27 | ////cache.get(3); // returns 3
28 | ////cache.get(4); // returns 4
29 | //*/
30 |
31 | import java.util.*;
32 |
33 | class LRUCache {
34 | private int capacity;
35 | private int size;
36 | private Map
26 |
44 | 27 | LTI (NSE: LTI) is a global technology consulting and digital solutions company 28 | helping more than 420 clients succeed in a converging world. With operations 29 | in 32 countries, we go the extra mile for our clients and accelerate their digital 30 | transformation with LTI’s Mosaic platform enabling their mobile, social, analytics, 31 | IoT and cloud journeys. 32 |
33 |34 | Founded 20 years ago as the information technology arm of the Larsen & Toubro group, 35 | our unique heritage gives us unrivaled real-world expertise to solve the most complex 36 | challenges of enterprises across all industries. 37 |
38 |39 | Each day, our team of more than 30,000 LTItes enable our clients to improve the effectiveness 40 | of their business and technology operations and deliver value to their customers, employees 41 | and shareholders. 42 |
43 |
45 |
67 | Our Belief
46 |
47 | 
48 |
50 |
48 | Go the Extra Mile
49 |
51 | 
52 |
54 |
52 | Be Agile
53 |
55 | 
56 |
58 |
56 | Push Frontiers of Innovation
57 |
59 | 
60 |
62 |
60 | Keep Learning
61 |
63 | 
64 |
66 |
64 | Solve For Society
65 |